Category: <span>Added</span>

A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem

Daily traffic congestion poses significant challenges for companies operating in urban areas. By considering predicted travel times throughout the day, route planning systems can improve delivery schedules, thereby reducing costs associated with delays and congestion. Although the time-dependent vehicle routing …

Integrating Large Language Models and Optimization in Semi- Structured Decision Making: Methodology and a Case Study

Semi-structured decisions, which fall between highly structured and unstructured decision types, rely on human intuition and experience for the final choice, while using data and analytical models to generate tentative solutions. These processes are traditionally iterative and time-consuming, requiring cycles …

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks

We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results. First, we study basic operations on piecewise linear arrival time functions. In particular, we devise a faster …

Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem

We analyze several time dependency issues for the selective traveling salesman problem with time-dependent profits. Specifically, we consider the case in which the profit collected at a vertex depends on the service time, understood as the time spent at this …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close