Genetic-based scheduling to solve the parcel hub scheduling problem

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1607-1616

  McWilliams, Douglas L ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

Distribution; Genetic algorithm; Parcel; Sortation; Work load balancing

Indexed keywords

COMPUTATIONAL TIME; DISTRIBUTION; HUB SCHEDULING; INBOUND TRAILERS; LARGE SIZES; PARCEL; PARCEL DELIVERIES; SCHEDULING PROBLEMS; SIGNIFICANT IMPACTS; SORTATION; TIME SPANS; WORK LOAD BALANCING;

GENETIC ALGORITHMS; UNLOADING; VEHICLES;

FREIGHT TRANSPORTATION;

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

References (42)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
2. Bartholdi J., and Gue K. Reducing labor costs in an LTL crossdocking terminal. Operations Research 48 6 (2000) 823-832
3. Basset M., Pekny J., and Reklaitis G. Decomposition techniques for the solution of large-scale scheduling problems. American Institute of Chemical Engineering Journal 42 12 (1995) 3373
4. Benders J. Partitioning procedures for solving mixed variables programming problems. Numberische Mathematik 4 (1962) 238
5. Campbell J. Freight consolidation and routing with transportation economies of scale. Transportation Research B 24B (1990) 345-361
6. Cotta C., and Troya J. A hybrid genetic algorithm for the 0-1 multiple knapsack problem. Proceedings of the international conference on artificial neural networks and genetic algorithms (1997), Springer-Verlag, Berlin 250-254
7. Cunha C.B., and Silva M.R. A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. European Journal of Operational Research 179 3 (2007) 747-758
8. Daganzo C. The break-bulk role of terminals in many-to-many logistic networks. Operations Research 35 4 (1987) 543-555
9. Dantzig G. Linear programming and extensions (1963), Princeton University Press, Princeton, NJ
10. Davis L. Handbook of genetic algorithms (1991), Van Nostrand Reinhold Company, New York
11. De Jong, K. (1975). An analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation. Ann Arbor, MI: The University of Michigan.
12. Garey M., and Johnson D. Computers and intractability: A guide to the theory of NP-completeness (1979), Freeman and Co., San Francisco
13. Gilbert D. Parcel conveyors. Post Office Electrical Engineers' Journal 27 3 (1934) 179-186
14. Goldberg D. Genetic algorithms in search, optimization, and machine learning (1989), Addison-Wesley, Reading, MA
15. Goldman A.J. Optimal location for centers in a network. Transportation Science 3 4 (1969) 352-360
16. Goodison H. Parcel sorting systems and ancillary postal equipment. Post Office Electrical Engineers' Journal 74 3 (1981) 271-277
17. Gould L. Increase productivity by choosing the right sortation conveyor. Modern Materials Handling 46 7 (1991) 54-56
18. Grefenstette J. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics 16 (1986) 122-128
19. Gue, K. (1996). Freight terminal layout and operations, (Doctoral dissertation, Georgia Institute of Technology, 1995), Dissertation Abstract International, B 56/11, 6322-6432.
20. Hiley, A., & Julstrom, B. (2006). The quadratic multiple knapsack problem and three heuristic approaches to it. In Genetic and evolutionary computation conference (pp. 547-552).
21. Holland J. Adaptation in natural and artificial systems (1975), University of Michigan Press, Ann Arbor, MI
22. Hung M., and Fisk J. An algorithm for zero-one multiple knapsack problems. Naval Research Logistics Quarterly 24 (1978) 571-579
23. Khmelnitsky E., Kogan K., and Maimon O. A time-decomposition method for sequence-dependent setup scheduling under pressing demand conditions. IEEE Transactions on Analytical Control 45 (2000) 4
24. Krarup J., and Pruzan P. Reducibility of minimax to minimum 0-1 programming problems. European Journal of Operational Research 5 (1981) 125-132
25. Lai, J. (2006). Surrogate search: A simulation optimization methodology for large-scale systems. Dissertation. University of Pittsburgh.
26. Liepins G., and Hilliard M. Genetic algorithms: Foundations and applications. Annals of Operations Research 21 (1989) 31-59
27. Martello S., and Toth P. Solution of the zero-one multiple knapsack problem. European Journal of Operational Research 4 (1980) 276-283
28. Masel, D. (1998). Adapting the longest processing time heuristic (LPT) for output station assignment in a sortation facility. In 7th industrial engineering research conference. IIE.
29. Masel D., and Goldsmith D. Using a simulation model to evaluate the configuration of a sortation facility. Proceedings of the 1997 winter simulation conference (1997), IEEE, Atlanta, GA 1210-1213
30. McWilliams D., Stanfield M., and Geiger C. The parcel hub scheduling problem: A simulation-based solution approach. Computers and Industrial Engineering 49 (2005) 393-412
31. McWilliams D., Stanfield M., and Geiger C. Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers. Computers and Industrial Engineering 49 (2008) 709-720
32. Oh Y., Hwang H., Cha C., and Lee S. A dock-door assignment problem for the Korean mail distribution center. Computer and Industrial Engineering 51 (2006) 288-296
33. O'Kelly M. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 32 (1987) 393-404
34. Ovacik I.M., and Uzsoy R. Decomposition methods for complex factory scheduling problems (1997), Kluwer Academic Publishing
35. Peck, K. (1983). Operational analysis of freight terminals handling less than container load shipment. Ph.D. Dissertation. Champaign, IL: University of Illinois.
36. Pinedo M. Scheduling: Theory, algorithms, and systems (2002), Prentice-Hall, New Jersey
37. Robinson, A. (2002). Competition within the United States parcel delivery market. Available from http://www.postcom.org/public/articles/2003articles/parcel_competition.htm. Retrieved June 2, 2007.
38. Skorin-Kapov D., Skorin-Kapov J., and O'Kelly J. Tight linear programming relaxations of uncapacitated p-hub median problem. European Journal of Operational Research 94 (1996) 582-593
39. Tsui L., and Chang C. An optimal solution to dock door assignment problem. Computers and Industrial Engineering 23 (1992) 283-286
40. US Department of Transportation, Research and Innovative Technology Administration, Bureau of Transportation Statistics (2006). Freight in America: A new national picture, Washington, DC, January 2006.
41. Wolff R. Stochastic modeling and the theory of queues (1989), Prentice-Hall, New Jersey
42. Yoon, Y., Kim, Y., & Moon, B. (2005). An evolutionary lagrangian method for the 0/1 multiple knapsack problem. In Genetic and evolutionary computation conference (pp. 629-635).