New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Heuristic approaches to vehicle routing with backhauls and time windows
Computers and Operations Research
ACO algorithms for the quadratic assignment problem
New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
The vehicle routing problem
The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Savings Based Ant System For The Vehicle Routing Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A hybrid algorithm for the vehicle routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analyzing a unified ant system for the VRP and some of its variants
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns
Transportation Science
| Hi-index | 0.00 |
In this paper we present and analyze the application of an Ant System to the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). At the core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.