메뉴 건너뛰기




Volumn 53, Issue 4, 2007, Pages 680-692

A vehicle routing problem solved by using a hybrid genetic algorithm

Author keywords

Double trips; Heterogeneous VRP; Hybrid genetic algorithm; Multiple depots

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

EID: 35348997117     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.031     Document Type: Article
Times cited : (75)

References (28)
  • 1
    • 33646079146 scopus 로고    scopus 로고
    • Alba, E., & Dorronsoro, B. (2004). Solving the vehicle routing problem by using cellular genetic algorithms. In Lecture notes in computer science (Vol. 3004, pp. 11-20).
  • 2
  • 3
    • 35348991813 scopus 로고    scopus 로고
    • Blanton, J. L., & Wainwright, R. L. (1993). Multiple vehicle routing with time and capacity constraints using genetic algorithms. In Proceedings of the fifth international conference on genetic algorithms (pp. 452-459), Los Altas, CA.
  • 4
    • 0003307112 scopus 로고
    • The state of the art in the routing and scheduling of vehicle and crews
    • Bodin L.D., Golden B., and Bender A. The state of the art in the routing and scheduling of vehicle and crews. Computers and Operations Research 10 (1983) 79-116
    • (1983) Computers and Operations Research , vol.10 , pp. 79-116
    • Bodin, L.D.1    Golden, B.2    Bender, A.3
  • 5
  • 8
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum K-trees
    • Fisher M.L. Optimal solution of vehicle routing problems using minimum K-trees. Operation Research 42 (1994) 626-642
    • (1994) Operation Research , vol.42 , pp. 626-642
    • Fisher, M.L.1
  • 9
    • 0001834106 scopus 로고    scopus 로고
    • A multiple ant colony system for vehicle routing problems with time windows
    • Corne D., Dorigo M., and Glover F. (Eds), McGraw-Hill, New York
    • Gambardella L.M., Taillard E., and Agazzi G. A multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York 63-76
    • (1999) New ideas in optimization , pp. 63-76
    • Gambardella, L.M.1    Taillard, E.2    Agazzi, G.3
  • 11
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 12
    • 0013075986 scopus 로고
    • A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem
    • Hiquebran D.T., Alfa A.S., Shapiro A., and Gittoes D.H. A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem. Engineering Optimization 22 (1994) 77-107
    • (1994) Engineering Optimization , vol.22 , pp. 77-107
    • Hiquebran, D.T.1    Alfa, A.S.2    Shapiro, A.3    Gittoes, D.H.4
  • 13
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 345-358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 14
    • 0019572333 scopus 로고
    • Complexity of vehicle routing and scheduling problems
    • Lenstra J.K., and Rinnooy K. Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
    • (1981) Networks , vol.11 , pp. 221-227
    • Lenstra, J.K.1    Rinnooy, K.2
  • 15
    • 0019563311 scopus 로고
    • Accelerating benders decomposition-algorithmic enhancement and model selection criteria
    • Magnanti T.L., and Wong R.T. Accelerating benders decomposition-algorithmic enhancement and model selection criteria. Operations Research 29 3 (1981) 464-484
    • (1981) Operations Research , vol.29 , Issue.3 , pp. 464-484
    • Magnanti, T.L.1    Wong, R.T.2
  • 18
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Operations Research 41 (1993) 421-451
    • (1993) Operations Research , vol.41 , pp. 421-451
    • Osman, I.H.1
  • 19
    • 20544477332 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows - Part II: Genetic search. INFORMS
    • Potvin J.Y., and Bengio S. The vehicle routing problem with time windows - Part II: Genetic search. INFORMS. Journal on Computing 8 (1996) 165-172
    • (1996) Journal on Computing , vol.8 , pp. 165-172
    • Potvin, J.Y.1    Bengio, S.2
  • 20
    • 0030190109 scopus 로고    scopus 로고
    • A hybrid approach to vehicle routing using neural networks and genetic algorithms
    • Potvin J.Y., Dube D., and Robillard C. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Applied Intelligence 6 (1996) 241-252
    • (1996) Applied Intelligence , vol.6 , pp. 241-252
    • Potvin, J.Y.1    Dube, D.2    Robillard, C.3
  • 21
    • 0030264108 scopus 로고    scopus 로고
    • A genetic algorithm for vehicle routing with backhauling
    • Potvin J.Y., Duhamel C., and Guertin F. A genetic algorithm for vehicle routing with backhauling. Applied Intelligence 6 (1996) 345-355
    • (1996) Applied Intelligence , vol.6 , pp. 345-355
    • Potvin, J.Y.1    Duhamel, C.2    Guertin, F.3
  • 22
    • 0001471728 scopus 로고    scopus 로고
    • A parallel tabu search algorithm using ejection chains for the vehicle routing problem
    • Osman I., and Kelly J. (Eds), Kluwer, Boston
    • Rego C., and Roucairol C. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman I., and Kelly J. (Eds). Meta-heuristics: Theory and applications (1996), Kluwer, Boston
    • (1996) Meta-heuristics: Theory and applications
    • Rego, C.1    Roucairol, C.2
  • 23
    • 0013079631 scopus 로고    scopus 로고
    • A genetic clustering method for the multi-depot vehicle routing problem
    • Smith G.D., Steel N.C., and Albrecht R.F. (Eds), Springer, New York
    • Salhi S., Thangiah S.R., and Rahman F. A genetic clustering method for the multi-depot vehicle routing problem. In: Smith G.D., Steel N.C., and Albrecht R.F. (Eds). ICANNGA '97 Vienna (1998), Springer, New York 234-237
    • (1998) ICANNGA '97 Vienna , pp. 234-237
    • Salhi, S.1    Thangiah, S.R.2    Rahman, F.3
  • 24
    • 35348934519 scopus 로고    scopus 로고
    • Schmitt, L. J. (1994). An empirical computational study of genetic algorithms to solve order-based problems: An emphasis on the TSP and the VRP with time constraints. Ph.D. dissertation. Fogelman College of Business and Economics, University of Memphis.
  • 25
  • 26
    • 0026628503 scopus 로고    scopus 로고
    • Thangiah, S. R., & Nygard, P.L. (1992). School bus routing using genetic algorithms. In Proceedings of the SPIE conference on applications of artificial intelligence X: Knowledge based systems (pp. 387-397), Orlando, FL.
  • 27
    • 0025377017 scopus 로고    scopus 로고
    • Thangiah, S. R., Nygard, P. L., & Juell, P. L., GIDEON. (1991). A genetic algorithm system for vehicle routing with time windows. In Proceedings of the seventh IEEE conference on artificial intelligence applications (pp. 322-328), Miami, FL.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.