A backtracking adaptive threshold accepting algorithm for the vehicle routing problem
Systems Analysis Modelling Simulation
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
INFORMS Journal on Computing
A new modeling and solution approach for the set-partitioning problem
Computers and Operations Research
Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Heuristics for the variable sized bin-packing problem
Computers and Operations Research
A new hybrid ant colony optimization algorithm for the vehicle routing problem
Pattern Recognition Letters
Decomposition approach to solve dial-a-ride problems using ant computing and constraint programming
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
| Hi-index | 0.00 |
We develop a generic tabu search heuristic for solving the well-known vehicle routing problem. This algorithm explores the advantages of simple local search and improvement heuristics as well as a complex meta-heuristic. The solutions generated by these heuristics are selected and assembled by a set-partitioning model to produce superior solutions. Computational experience on standard benchmark problems is discussed and comparisons with other up-to-date heuristic methods are provided.