The vehicle routing problem
A Constraint Programming Framework for Local Search Methods
Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
Journal of Heuristics
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Beam-ACO for the travelling salesman problem with time windows
Computers and Operations Research
A scatter search algorithm for solving vehicle routing problem with loading cost
Expert Systems with Applications: An International Journal
Hybrid local search techniques for the resource-constrained project scheduling problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Urban pickup and delivery problem considering time-dependent fuzzy velocity
Computers and Industrial Engineering
The capacitated vehicle routing problem with stochastic demands and time windows
Computers and Operations Research
Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
A modified ant colony system for solving the travelling salesman problem with time windows
Mathematical and Computer Modelling: An International Journal
A General VNS heuristic for the traveling salesman problem with time windows
Discrete Optimization
The Delivery Man Problem with time windows
Discrete Optimization
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Vehicle routing problem with stochastic travel times including soft time windows and service costs
Computers and Operations Research
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Hi-index | 0.00 |
This article describes a generalized insertion heuristic for the Traveling Salesman Problem with Time Windows in which the objective is the minimization of travel times. The algorithm gradually builds a route by inserting at each step a vertex in its neighbourhood on the current route, and performing a local reoptimization. This is done while checking the feasibility of the remaining part of the route. Backtracking is sometimes necessary. Once a feasible route has been determined, an attempt is made to improve it by applying a post-optimization phase based on the successive removal and reinsertion of all vertices. Tests performed on 375 instances indicate that the proposed heuristic compares very well with alternative methods and very often produces optimal or near-optimal solutions.