Abstract
This paper presents a new metaheuristic approach, i.e., the GIDS (Generic Intensification and Diversification Search), as well as its performance for solving the FSMVRP (Fleet Size and Mix Vehicle Routing Problem). The GIDS integrates the use of some recently developed generic search methods such as TA (Threshold Accepting) and GDA (Great Deluge Algorithm), and the meta-strategies of intensification and diversification for intelligent search. The GIDS includes three components: (1) MIC, multiple initialization constructor; (2) GSI, generic search for intensification; (3) PSD, perturbation search for diversification. A bank of twenty FSMVRP benchmark instances was tested by several different implementations of GIDS. All programs were coded in UNIX C and implemented on a SPARC 10 SUN workstation. Results are very encouraging. We have updated the best-known solutions for two of the twenty benchmark instances; the average deviation from the twenty best solutions is merely 0.598%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6:126–140, 1994.
I. Charon and O. Hudry. The Noising Method: A New Method for Combinatorial Optimization. Operations Research Letters, 14:133–137, 1993.
G. Clarke and J.W. Wright. Scheduling of Vehicles From a Central Depot to a Number of Delivery Points. Operations Research, 12:568–589, 1964.
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.
M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics, 26:29–41, 1996.
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.
G. Dueck. New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics, 104:86–92, 1993.
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.
M.L. Fisher. Vehicle Routing. In: Network Routing, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, pages 1–33, Elsevier, 1995.
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.
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.
F. Glover. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research, 13:533–549, 1986.
F. Glover. Genetic Algorithms and Scatter Search: Unsuspected Potentials. Statistics and Computing, 4:131–140, 1994.
F. Glover. Tabu Thresholding: Improved Search by Non-Monotonic Trajectories, ORSA Journal on Computing, 7:426–442, 1995.
F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
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.
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.
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.
A.F. Han and G.C. Chen. Applications of Noising Method and Flip-flop Method to Travelling Salesman Problem (in Chinese). Working Paper, D, National Chiao Tung University, Taiwan, 1996.
A.F. Han and Y.J. 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.
J.J. Hopfield and D.W. Tank. Neural Computation of Decisions in Optimization Problems. Biological Cybernetics, 52141–152, 1985.
S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671–680, 1983.
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.
N. Mladenović and P. Hansen. Variable Neighborhood Search. Computers and Operations Research, 24:1097–1100, 1997.
I.H. Osman and J.P. Kelly. Metaheuristics: An Overview. In: Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 1–21, Kluwer, 1996.
I.H. Osman and S. Salhi. Local Search Strategies for the Vehicle Fleet Mix Problem. In: Modern Heuristic Search Methods, V.J. Ray ward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, pages 131–153, Wiley, 1996.
C.R. Reeves (editor). Modern Heuristics Techniques for Combinatorial Problems, Wiley, 1993.
S. Salhi and G.K. Rand. Incorporating Vehicle Routing into the Vehicle Fleet Composition Problem. European Journal of Operational Research, 66:313–330, 1993.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Han, A.FW., Cho, YJ. (2002). A Gids Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_18
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive