A hierarchical approach to vehicle routing and scheduling with sequential services using the genetic algorithm

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 20, Issue 1-2, 2013, Pages 99-113

  Kim, K C ^a   Sun, J U ^b   Lee, S W ^c  

^a OREGON STATE UNIVERSITY   (United States)

^b Hankuk University of Foreign Studies   (South Korea)

^c Pusan National University   (South Korea)

Author keywords

Delivery and installation; Electronics industry; Genetic algorithm; Synchronization of vehicles; Vehicle routing problem

Indexed keywords

CUSTOMER SATISFACTION; ELECTRONICS INDUSTRY; GENETIC ALGORITHMS; INTEGER PROGRAMMING; MATERIALS HANDLING; NONLINEAR PROGRAMMING; SCHEDULING; VEHICLE ROUTING; VEHICLES;

COMPETITIVE MARKETS; COMPUTATIONAL RESULTS; HIERARCHICAL APPROACH; MATERIAL HANDLING; MIXED-INTEGER NONLINEAR PROGRAMMING; PERFORMANCE COMPARISON; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEMS;

ROUTING ALGORITHMS;

EID: 84879180958     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (30)

1. Bodin, L. D., Golden, B. L., Assad, A. A., Ball, M. (1983), Routing and scheduling of vehicles and crews, the state of the art, Comput Opns Res 10: 63-212.
2. Bräysy, O., Gendreau, M. (2005), Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Transport Sci 39: 104-118.
3. Campos, V., Mota, E. (2000), Heuristic procedures for the Capacitated Vehicle Routing Problem, Comput Optim Appl 16: 265-277.
4. Chien, S., Spasovic, L. (2002), Optimization of grid bus transit systems with elastic demand, J Adv Transport 36: 63- 91.
5. Chu, P. C., Beasley, J. E. (1998), Constraint handling in genetic algorithms: the set partitioning problem, J Heuristics 4: 323-357.
6. Claassen, G. D. H., Hendriks Th. H. B. (2007), An application of Special Ordered Sets to a periodic milk collection problem, Eur J Opl Res 180: 754-769.
7. Falkenauer, E. (1996), A hybrid grouping genetic algorithm for bin packing, J Heuristics 2: 5-30.
8. Freisleben, B., Merz, P. (1996), A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems, Proc. 1996 IEEE International Conference Evolutionary Computation. 616-621.
9. Gen, M., Cheng, R. (1999), Genetic algorithms and engineering optimization, John Wiley & Sons, Inc.
10. Goldberg, D. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, New York: Addison Wesley.
11. Golden, B. L., Wasil, E. A. (1987), Computerized Vehicle Routing in the Soft Drink Industry, Opns Res 35: 6-17.
12. Holland, J. (1975), Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press.
13. Ji, P. (2007), The vehicle routing problem: the case of the Hong Kong postal service, Transport Plan Tech 30: 167-182.
14. Jung, S., Haghani, A. (2000), Genetic algorithm for a pickup and delivery problem with time windows, Transport Res Rec 1733: 1-7.
15. Kolen, A., Rinnooy, Kan. A., Trienekens, H. (1987), Vehicle routing with time windows, Opns Res 35: 266-273.
16. Laporte, G., Nobert, Y., Desrochers, M. (1985), Optimal routing under capacity and distance restrictions, Opns Res 33: 1050-1073.
17. List, G., Mirchandani, P. (1991), An Integrated Network/Planner Multiobjective Model for Routing and Scheduling for Hazardous Materials and Wastes, Transport Sci 25: 146-156.
18. Marian, R., Luong, L., Abhary, K. (2006), A genetic algorithm for the optimisation of assembly sequences, Comput Indust Eng 50: 503-527.
19. Martens, J. (2004), Two genetic algorithms to solve a layout problem in the fashion industry, Eur J Opl Res 154: 304- 322.
20. Miller, C. E., Tucker, A. W., Zemlin, R. A. (1960), Integer programming formulations and traveling salesman problems, J ACM 7: 326-329.
21. Ozdemir, H. T., Mohan, C. K. (2001), Flight graph based genetic algorithm for crew scheduling in airlines, Inf Sci 133: 165-173.
22. Pisinger, D., Ropke, S. (2007), A general heuristic for vehicle routing problems, Comput Opns Res 34: 2403-2435.
23. Potvin, J. Y., Rousseau, J. M. (1995), Exchange heuristic for routeing problems with time windows, J Opl Res Soc 46: 1433-1446.
24. Prins, C. (2004), A simple and effective evolutionary algorithm for the vehicle routing problem, Comput Opns Res 31 (12): 1985-2002.
25. Prive, J., Renaud, J., Boctor, F. (2006), Solving a vehicle-routing problem arising in soft-drink distribution, J Opl Res Soc 57: 1045-1052.
26. Reeves, C. R. (1994), A genetic algorithm for flowshop sequencing, Comput Opns Res 22: 5-13.
27. Ripplinger, D. (2005), Rural school vehicle routing problem, Transport Res Rec 1922: 105-110.
28. Toth, P., Vigo, D. (2002), Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Appl Math 123: 487-512.
29. Yun, Y. (2006), Hybrid genetic algorithm with adaptive local search scheme, Comput Ind Eng 51(1): 128-141.
30. Zografos, K. G., Androutsopoulos, K. N. (2004), A heuristic algorithm for solving hazardous materials distribution problems, Eur J Opl Res 152: 507-519.