Integrated GA-VRP solver for multi-depot system

Computers and Industrial Engineering

Volumn 53, Issue 2, 2007, Pages 233-240

  Bae, Suk Tae ^a   Hwang, Heung Suk ^a   Cho, Gyu Sung ^a   Goan, Meng Jong ^b  

^a Tongmyong University   (South Korea)

^b KAINAN UNIVERSITY   (Taiwan)

Author keywords

Facility design; GUI type program; Vehicle routing problem

Indexed keywords

GENETIC ALGORITHMS; GRAPHICAL USER INTERFACES; HEURISTIC METHODS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

DISTRIBUTION ROUTING PROBLEMS; FACILITY DESIGN; MULTI SUPPLY CENTER PROBLEMS;

VEHICLE ROUTING;

EID: 34548264637     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.014     Document Type: Article

References (13)

1. Clarke G., and Wright J.W. Scheduling of vehicles from central depot to a number of delivery. Operations Research 12 (1964) 568-581
2. Dantzig G.B., Fulkerson D.R., and Johnson S.M. Solution of a large scale traveling salesman problem. Operations Research 2 (1954) 393-410
3. Fisher M., Gereenfield A., and Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks 11 (1981) 109-124
4. Gillet B.E., and Miller L.R. A heuristic algorithm for the vehicle dispatching problem. Journal of Operations Research 22 (1974) 340-349
5. Grefenstette J., et al. Genetic algorithm for the traveling salesman problem. Proceedings of International Conference of Genetic Algorithm and Their Applications (1995) 160-165
6. Hwang H.Suk. Design of supply-chain logistics system considering service level. International journal of Computers and Industrial Engineering 43 (2002) 283-297
7. Kureichick V.M., and Melikhov A.N. Some new features in genetic solution of the traveling salesman problem. Proceedings of ACEEDC '96 (1996) 1-6
8. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research (1973) 498-516
9. Macro, D., & Luca, M. (1997). A cooperative learning approach to the traveling salesman problem, Libre de Bruxelles University.
10. Mark, H. N. (1997). The Traveling Salesman Problem a Review of Theory and Current Research. Working Paper, 1-26.
11. Michael, J., & Peter, S. (1995). Solving large-scale traveling salesman problems with parallel branch-and-cut, University zu Koln Germany.
12. Oliver, C. M., Steve, W. O. (1994). Combining Simulated Annealing with Local Search Heuristics, Oregon Graduate Institute of Science & Technology.
13. Sugal A.H. Genetic algorithm package (1995), University of Sunderland, England