Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems

International Journal of Production Research

Volumn 48, Issue 24, 2010, Pages 7219-7242

  Le Anh, Tuan ^a   De Koster, Rene B M ^b   Yu, Yugang ^b  

^a ELECTRIC POWER UNIVERSITY   (Viet Nam)

^b ERASMUS UNIVERSITY   (Netherlands)

Author keywords

dispatching; dynamic scheduling; material handling; vehicle based internal transport

Indexed keywords

CALCULATION TIME; COLUMN GENERATION; DISPATCHING; DISPATCHING RULES; DYNAMIC ASSIGNMENT; DYNAMIC SCHEDULING; FACILITY LAYOUT; IMPROVING PERFORMANCE; IN-VEHICLE; LOOK-AHEAD; MATERIAL HANDLING; PERFORMANCE EVALUATION; REAL TIME SCHEDULING; REAL-TIME SETTINGS; ROLLING HORIZON; SCHEDULING METHODS; STATIC AND DYNAMIC; STATIC PROBLEMS; VEHICLE-BASED INTERNAL TRANSPORT; WORK DISTRIBUTION;

MATERIALS HANDLING; MATERIALS HANDLING EQUIPMENT; PLANT LAYOUT; VEHICLES;

SCHEDULING;

EID: 78349280778     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540903443279     Document Type: Article

References (41)

1. Ahuja, K., Magnanti, T. L., and Orlin, J. B., 1993. Network flows: theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall.
2. Asef-Vaziri, A., Hall, N. G., and George, R., 2008. The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path. Computers & Operations Research, 35(5), 1546-1561.
3. Bent, R. and Van Hentenryck, P., 2006. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875-893.
4. Bilge, U. and Ulusoy, G., 1995. A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Operations Research, 43(6), 1058-1070.
5. Bronmo, G., Christiansen, M., and Nygreen, B., 2007. Ship routing and scheduling with flexible cargo sizes. Journal of the Operational Research Society, 58(9), 1167-1177.
6. Chen, Z. L. and Xu, H., 2006. Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science, 40(1), 74-88.
7. De Koster, R. (M.) B. M., Le-Anh, T., and Van der Meer, J. R., 2004. Testing and classifying vehicle dispatching rules in three real-world settings. Journal of Operations Management, 22(4), 369-386.
8. De Koster, R. (M.) B. M. and Yu, M., 2008. Minimizing makespan and throughput times at Aalsmeer flower auction. Journal of the Operational Research Society, 59(9), 1182-1190.
9. De Koster, R. (M.) B. M., Le-Duc, T., and Yu, Y., 2008. Optimal storage rack design for a 3-dimensional compact AS/RS. International Journal of Production Research, 46(6), 1495-1514.
10. Desaulniers, G., Lavigne, J., and Soumis, F., 1998. Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research, 111(3), 479-494.
11. Desrochers, M. and Soumis, F., 1988. A generalized permanent labeling algorithm for the shortestpath problem with time windows. Infor, 26(3), 191-212.
12. Dumas, Y., Desrosiers, J., and Soumis, F., 1991. The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7-22.
13. Egbelu, P. J. and Tanchoco, J. M. A., 1984. Characterization of automated guided vehicle dispatching rules. International Journal of Production Research, 22(3), 359-374.
14. Fleischmann, B., Gnutzmann, S., and Sandvoss, E., 2004. Dynamic vehicle routing based on online traffic information. Transportation Science, 38(4), 420-433.
15. Hsu, J. C., 1996. Multiple comparisons: theory and methods. London: Chapman & Hall.
16. Ichoua, S., Gendreau, N., and Potvin, J. Y., 2000. Diversion issues in real-time vehicle dispatching. Transportation Science, 34(4), 426-438.
17. Jang, J., Suh, J., and Ferreira, P. M., 2001. An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines. International Journal of Production Research, 39(17), 3901-3921.
18. Kim, B. I., et al., 2007. Effectiveness of vehicle reassignment in a large-scale overhead hoist transport system. International Journal of Production Research, 45(4), 789-802.
19. Kim, K. H. and Bae, J. W., 2004. A look-ahead dispatching method for automated guided vehicles in automated port container terminals. Transportation Science, 38(2), 224-234.
20. Kindervater, G. A. P. and Savelsbergh, M. W. P., 1992. Local search in physical distribution management. Discussion paper no. 77. Erasmus University Rotterdam, the Netherlands.
21. Krishnamurthy, N. N., Batta, R., and Karwan, M. H., 1993. Developing conflict-free routes for automated guided vehicles. Operations Research, 41(6), 1077-1090.
22. Laporte, G., et al., 2000. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operations Research, 7 (4-5), 285-300.
23. Le-Anh, T. and De Koster, R. (M.) B. M., 2006. A review of design and control of automated guided vehicle systems. European Journal of Operational Research, 171(1), 1-23.
24. Mes, M., Van der Heijden, M., and Van Harten, A., 2007. Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. European Journal of Operational Research, 181(1), 59-75.
25. Morihiro, Y., Miyamoto, T., and Kumagai, S., 2007. An initial assignment method for tasks assignment and routing problem of autonomous distributed AGVs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 90(11), 2465-2471.
26. Ohlmann, J. W. and Thomas, B. W., 2007. A compressed-annealing heuristic for the traveling salesman problem with time windows. Informs Journal on Computing, 19(1), 80-90.
27. Pisinger, D. and Ropke, S., 2007. A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435.
28. Powell, W. B., 1996. A stochastic formulation of the dnamic assignment problem, with an application to truckload motor carriers. Transportation Science, 30(3), 195-219.
29. Psaraftis, H. N., 1988. Dynamic vehicle routing problems. In: B. L. Golden and A. A. Assad, eds. Vehicle routing: methods and studies. Amsterdam: Elsevier Science, 233-248.
30. Ropke, S., Cordeau, J. F., and Laporte, G., 2007. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258-272.
31. Savelsbergh, M. W. P., 1995. The general pickup and delivery problem. Transportation Science, 29(1), 17-29.
32. Savelsbergh, M. W. P. and Sol, M., 1998. Drive: dynamic routing of independent vehicles. Operations Research, 46(4), 474-490.
33. Singh, S. P. and Tiwari, M. K., 2002. Intelligent agent framework to determine the optimal conflictfree path for an automated guided vehicles system. International Journal of Production Research, 40(16), 4195-4223.
34. Thomas, B. W., 2002. Anticipatory route selection problems. Thesis (PhD). University of Michigan.
35. Tompkins, J. A., et al., 2003. Facilities planning. New York: John Wiley and Sons.
36. Van der Meer, J. R., 2000. Operational control of internal transport system. Thesis (PhD). Erasmus University, Rotterdam, the Netherlands.
37. Vis, I. F. A., De Koster, R. (M.) B. M., and Savelsbergh, M. W. P., 2005. Minimum vehicle fleet size under time-window constraints at a container terminal. Transportation Science, 39(2), 249-260.
38. Xiang, Z. H., Chu, C. B., and Chen, H. X., 2006. A fast heuristic for solving a large-scale static diala-ride problem under complex constraints. European Journal of Operational Research, 174(2), 1117-1139.
39. Yang, J., Jaillet, P., and Mahmassani, H., 2004. Real-time multivehicle truckload pickup and delivery problems. Transportation Science, 38(2), 135-148.
40. Yu, Y. and De Koster, R. (M.) B. M., 2009a. Designing an optimal turnover-based storage rack for a 3D compact automated storage and retrieval system. International Journal of Production Research, 47(6), 1551-1571.
41. Yu, Y. and De Koster, R. (M.) B. M., 2009b. Optimal zone boundaries for two class-based compact three-dimensional automated storage and retrieval systems. IIE Transactions, 41(3), 194-208.