Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows
Journal of Heuristics
Minimizing a Convex Cost Closure Set
SIAM Journal on Discrete Mathematics
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
INFORMS Journal on Computing
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Discrete Applied Mathematics
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
Computers and Operations Research
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A heuristic method for the inventory routing problem with time windows
Expert Systems with Applications: An International Journal
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Computers and Operations Research
A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows
ICCL'11 Proceedings of the Second international conference on Computational logistics
Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Computers and Operations Research
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Transportation Science
Hi-index | 0.00 |
We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a neighborhood solution, we must compute an optimal time schedule for each route. We show that this subproblem can be efficiently solved by dynamic programming, which is incorporated in the local search algorithm. The neighborhood of our local search consists of slight modifications of the standard neighborhoods called 2- opt^*, cross exchange and Or-opt. We propose an algorithm that evaluates solutions in these neighborhoods more efficiently than the ones computing the dynamic programming from scratch by utilizing the information from the past dynamic programming recursion used to evaluate the current solution. We further propose a filtering method that restricts the search space in the neighborhoods to avoid many solutions having no prospect of improvement. We then develop an iterated local search algorithm that incorporates all the above ingredients. Finally we report computational results of our iterated local search algorithm compared against existing methods, and confirm the effectiveness of the restriction of the neighborhoods and the benefits of the proposed generalization.