A gids metaheuristic approach to the fleet size and mix vehicle routing problem

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 399-413

  Han, Anthony Fu Wha ^a   Cho, Yuh Jen ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888786500     PISSN: 1387666X     EISSN: None     Source Type: Journal    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (29)

1. B. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6:126-140, 1994.
2. I Charon, and, O Hudry. The Noising Method: A New Method for CombinatorialOptimization. Operations Research Letters, 14:133-137, 1993.
3. G. Clarke and JW Wright. Scheduling of Vehicles From a Central Depot to a Number of Delivery Points. Operations Research, 12:568-589, 1964.
4. M. Desrochers and T.W. Verhoog. A New Heuristic for the Fleet Size and Mix Vehicle Routing Problem. Computers and Operations Research, 18:263-274, 1991.
5. M. Dorigo, V. Maniezzo, and A. Colomi. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics, 26:29-41, 1996.
6. G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational PhysiCS, 90:161-175,1990.
7. G. Dueck. New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics, 104:86-92,1993.
8. T.A. Feo and M.G.C. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters, 8:67-71, 1989.
9. M.L. Fisher. Vehicle Routing. In: Network Routing, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, pages 1-33, Elsevier, 1995.
10. M. Gendreau, G. Laporte, C. Musaraganyi, and E.D. Taillard. A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Computers and Operations Research, 26:1153-1173, 1999.
11. F.G. Gheysens, B.L. Golden, and A. Assad. A New Heuristic for Determining Fleet Size and Composition. Mathematical Programming Studies, 26:233-236, 1986.
12. F. Glover. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research, 13:533-549, 1986.
13. F. Glover. Genetic Algorithms and Scatter Search: Unsuspected Potentials. Statistics and Computing, 4:131-140, 1994.
14. F. Glover. Tabu Thresholding: Improved Search by Non-Monotonic Trajectories, ORSA Journal on Computing, 7:426-442, 1995.
15. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
16. D.E. Goldberg and R. Lingle. Alleles, Loci and Travelling Salesman Problem. In: Proceedings of an International Conference on Genetic Algorithms and their Applications, J.J. Grefenstette, editor, pages 154-159, 1985.
17. B.L. Golden, A. Assad, L. Levy, and F. Gheysens. The Fleet Size and Mix Vehicle Routing Problem. Computers and Operations Research, 11:49-66, 1984.
18. J. Gu and X. Huang. Efficient Local Search with Search Space Smoothing: A Case Study of the Traveling Salesman Problem. IEEE Transactions on Systems, Man, and Cybernetics, 24:728-736, 1994.
19. A.F. Han and G.C. Chen. Applications of Noising Method and Flip-flop Method to Travelling Salesman Problem (in Chinese). Working Paper, Department of Transportation Engineering and Management, National Chiao Tung University, Taiwan, 1996.
20. A.F. Han and YJ Cho. Hybrid Heuristic Methods for Complicate Vehicle Routing Problems: Applications to FSMVRP (in Chinese). Report No. NSC-87-2211-E-009-024, Department of Transportation Engineering and Management, National Chiao Tung University, Taiwan, 1998.
21. J.J. Hopfield and D.W. Tank. Neural Computation of Decisions in Optimization Problems. Biological Cybernetics, 52141-152, 1985.
22. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671-680, 1983.
23. F. Liu and S. Shen. The Fleet Size and Mix Vehicle Routing Problem with Time Windows. Journal of the Operational Research Society, 50:721-732, 1999.
24. N. Mladenovic and P. Hansen. Variable Neighborhood Search. Computers and Operations Research, 24:1097-1100, 1997.
25. LH. Osman and J.P. Kelly. Metaheuristics: An Overview. In: Metaheuristics: Theory and Applications, LH. Osman and J.P. Kelly, editors, pages 1-21, Kluwer, 1996.
26. LH. Osman and S. Salhi. Local Search Strategies for the Vehicle Fleet Mix Problem. In: Modern Heuristic Search Methods, V.J. Rayward-Smith, LH. Osman, C.R. Reeves, and G.D. Smith, editors, pages 131-153, Wiley, 1996.
27. CR Reeves (editor). Modern Heuristics Techniques for Combinatorial Problems, Wiley, 1993.
28. S. Salhi and G.K. Rand. Incorporating Vehicle Routing into the Vehicle Fleet Composition Problem. European Journal of Operational Research, 66:313-330, 1993.
29. S. Tsubakitani and J.R. Evans. An Empirical Study of a New Metaheuristics for the Traveling Salesman Problem. European Journal of Operational Research, 104:113-128,1998.