Bi-objective optimization of drayage operations in the service area of intermodal terminals

Transportation Research Part E: Logistics and Transportation Review

Volumn 65, Issue 1, 2014, Pages 50-69

  Braekers, Kris ^a   Caris, An ^a,b   Janssens, Gerrit K ^a  

^a HASSELT UNIVERSITY   (Belgium)

^b RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

Author keywords

Bi objective; Deterministic annealing; Drayage operations; Traveling salesman problem; Vehicle routing

Indexed keywords

ALGORITHM; CARGO; HEURISTICS; OPTIMIZATION; PLANNING METHOD; TRANSPORT PROCESS; TRANSPORTATION PLANNING; TRAVEL BEHAVIOR;

EID: 84898544408     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2013.12.012     Document Type: Article

References (75)

1. Bent R., Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transport. Sci. 2004, 38(4):515-530.
2. Bent R., Van Hentenryck P. A two-phase hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 2006, 33(4):875-893.
3. Blum C., Puchinger J., Raidl G.R., Roli A. Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 2011, 11(6):4135-4151.
4. Bontekoning Y.M., Macharis C., Trip J.J. Is a new applied transportation research field emerging? A review of intermodal rail-truck freight transport literature. Transport. Res. Part A: Pol Practice 2004, 38(1):1-34.
5. Braekers, K., 2012. Optmization of Empty Container Movements in Intermodal Transport. Phd Thesis, Hasselt University.
6. Braekers, K., Caris, A., Janssens, G.K., 2011. A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations. In: The State of the Art in the European Quantitative Oriented Transportation and Logistics Research - 14th Euro Working Group on Transportation & 26th Mini Euro Conference & 1st European Scientific Conference on Air Transport, volume 20 of Procedia - Social and Behavioral Sciences. Poznan, Poland, pp. 344-353.
7. Braekers K., Janssens G.K., Caris A. Challenges in managing empty container movements at multiple planning levels. Transport Rev. 2011, 31(6):681-708.
8. Braekers K., Caris A., Janssens G.K. Integrated planning of loaded and empty container movements. OR Spectrum 2013, 35(2):457-478.
9. Bräysy O., Gendreau M. Tabu search heuristics for the vehicle routing problem with time windows. TOP 2002, 10(2):211-237.
10. Bräysy O., Gendreau M. Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transport. Sci. 2005, 39(1):104-118.
11. Bräysy O., Berger J., Barkaoui M., Dullaert W. A threshold accepting metaheuristic for the vehicle routing problem with time windows. Central Eur. J. Oper. Res. 2003, 11(4):369-387.
12. Bräysy, O., Hotokka, P., Dullaert, W., Nagata, Y., 2008. An adaptive diversification heuristic for the fleet size and mix vehicle routing problem with time windows. In: Proceedings of the EU/MEeting 2008: Metaheuristics for Logistics and Vehicle Routing. Troyes, France.
13. Bräysy O., Dullaert W., Hasle G., Mester D., Gendreau M. An effective multistart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows. Transport. Sci. 2008, 42(3):371-386.
14. Caris A., Janssens G.K. A local search heuristic for the pre- and end-haulage of intermodal container terminals. Comput. Oper. Res. 2009, 36(10):2763-2772.
15. Caris A., Janssens G.K. A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals. Int. J. Comput. Aided Eng. Technol. 2010, 2(4):340-355.
16. Caseau Y., Laburthe F. Heuristics for large constrained vehicle routing problems. J. Heuristics 1999, 5(3):281-303.
17. Chao I.M. A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 2002, 29(1):33-51.
18. Cheung R.K., Shi N., Powell W.B., Simao H.P. An attribute-decision model for cross-border drayage problem. Transport. Res. Part E: Logistics Transpor. Rev. 2008, 44(2):217-234.
19. Corberan A., Fernandez E., Laguna M., Marti R. Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 2002, 53(4):427-435.
20. Cordeau J.-F., Laporte G. Tabu search heuristics for the vehicle routing problem. Operations Research/Computer Science Interfaces Series 2005, vol. 30:145-163. Kluwer Academic Publishers, Boston. R. Sharda, S. Voß, C. Rego, B. Alidaee (Eds.).
21. Cordeau J.-F., Laporte G., Potvin J.-Y., Savelsbergh M.W.P. Transportation on demand. Handbooks in Operations Research and Management Science 2007, vol. 14:429-466. Elsevier. C. Barnhart, G. Laporte (Eds.).
22. Cordeau J.-F., Laporte G., Savelsbergh M.W.P., Vigo D. Vehicle routing. Handbooks in Operations Research and Management Science 2007, vol. 14:367-428. Elsevier. C. Barnhart, G. Laporte (Eds.).
23. Cordeau J.-F., Laporte G., Ropke S. Recent models and algorithms for one-to-one pickup and delivery problems. Operations Research/Computer Science Interfaces Series 2008, vol. 43:327-357. Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
24. Crainic T.G., Gendreau M., Dejax P. Dynamic and stochastic models for the allocation of empty containers. Oper. Res. 1993, 41(1):102-126.
25. Dueck G., Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 1990, 90(1):161-175.
26. Ehrgott M. Multicriteria Optimization 2005, Springer, Berlin. 2nd edition.
27. Ehrgott M., Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum 2000, 22(4):425-460.
28. Ehrgott M., Gandibleux X. Multiobjective combinatorial optimization. International Series in Operations Research and Management 2002, vol. 52:369-444. Kluwer Academic Publishers, Boston, MA. M. Ehrgott, X. Gandibleux (Eds.).
29. Ehrgott M., Gandibleux X. Approximative solution methods for multiobjective combinatorial optimization. TOP 2004, 12(1):1-90.
30. Erera A.L., Smilowitz K. Intermodal drayage routing and scheduling. Automation and Control Engineering Series 2008, 171-188. CRC Press, Boca Raton, FL. P. Ioannou (Ed.).
31. Escudero A., Muñuzuri J.M., Arango C., Onieva L. A satellite navigation system to improve the management of intermodal drayage. Adv. Eng. Infor. 2011, 25(3):427-434.
32. Francis P., Zhang G., Smilowitz K. Improved modeling and solution methods for the multi-resource routing problem. Eur. J. Oper. Res. 2007, 180(3):1045-1059.
33. Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems 2004, vol. 535. Springer, Berlin. X. Gandibleux, M. Sevaux, K. Srensen, V. T'kindt (Eds.).
34. Garcia-Najera A., Bullinaria J.A. An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 2011, 38(1):287-300.
35. Gendreau, M., Tarantilis, C.D., 2010. Solving Large-Scale Vehicle Routing Problems with Time Windows: the state-of-the-art. Technical Report CIRRELT-2010-04, CIRRELT, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Montréal, Canada.
36. Gendreau M., Potvin J.-Y., Bräysy O., Hasle G., Løkketangen A. Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. Operations Research/Computer Science Interfaces Series 2008, vol. 43:143-169. Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
37. Ghoseiri K., Ghannadpour S.F. Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 2010, 10(4):1096-1107.
38. Giuliano G., O'brien T. Reducing port-related truck emissions: the terminal gate appointment system at the ports of Los Angeles and Long Beach. Transpor. Res. Part D: Transport Environ. 2007, 12(7):460-473.
39. Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 1986, 13(5):533-549.
40. Glover F. Tabu search - part I. ORSA J. Comput. 1989, 1(3):190-206.
41. Glover F. Tabu search - part II. ORSA J. Comput. 1990, 2(1):4-32.
42. Homberger J., Gehring H. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 2005, 162(1):220-238.
43. Huth T., Mattfeld D.C. Integration of vehicle routing and resource allocation in a dynamic logistics network. Transport. Res. Part C: Emerging Technol. 2009, 17(2):149-162.
44. Ileri Y., Bazaraa M., Gifford T., Nemhauser G., Sokol J., Wikum E. An optimization approach for planning daily drayage operations. Central Eur. J. Oper. Res. 2006, 14(2):141-156.
45. Imai A., Nishimura E., Current J. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur. J. Oper. Res. 2007, 176(1):87-105.
46. Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 2002, 137(1):50-71.
47. Jaszkiewicz A. On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study. Eur. J. Oper. Res. 2004, 158(2):418-433.
48. Jozefowiez N., Semet F., Talbi E.-G. Multi-objective vehicle routing problems. Eur. J. Oper. Res. 2008, 189(2):293-309.
49. Jula H., Dessouky M., Ioannou P., Chassiakos A. Container movement by trucks in metropolitan networks: modeling and optimization. Transport. Res. Part E: Logistics Transport. Rev. 2005, 41(3):235-259.
50. Knowles, J.D., Thiele, L., Zitzler, E., 2006. A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. Technical Report TIK-Report No. 214, Computer Engineering and Networks Laboratory, ETH Zurich, Zurich.
51. Máhr T., Srour J., de Weerdt M., Zuidwijk R. Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty. Transport. Res. Part C: Emerging Technol. 2010, 18(1):99-119.
52. Mes M., van der Heijden M., van Harten A. Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. Eur. J. Oper. Res. 2007, 181(1):59-75.
53. Mes M., van der Heijden M., Schuur P. Look-ahead strategies for dynamic pickup and delivery problems. OR Spectrum 2010, 32(2):395-421.
54. Namboothiri R., Erera A.L. Planning local container drayage operations given a port access appointment system. Transport. Res. Part E: Logistics Transport. Rev. 2008, 44(2):185-202.
55. Nikolakopoulos A., Sarimveis H. A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem. Eur. J. Oper. Res. 2007, 177(3):1911-1929.
56. Ombuki B., Ross B.J., Hanshar F. Multi-objective genetic algorithms for vehicle routing problems with time windows. Appl. Intell. 2006, 24(1):17-30.
57. Pacheco J., Marti R. Multi-objective genetic algorithms for vehicle routing problems with time windows. J. Oper. Res. Soc. 2006, 57(1):29-37.
58. Parragh S.N., Doerner K.F., Hartl R.F., Gandibleux X. A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks 2009, 54(4):227-242.
59. Potvin J.-Y., Rousseau J.-M. An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 1995, 46(12):1433-1446.
60. Smilowitz K. Multi-resource routing with flexible tasks: an application in drayage operations. IIE Transactions 2006, 38(7):568-577.
61. Tan K.C., Chew Y.H., Lee L.H. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. 2006, 172(3):855-885.
62. Tan K.C., Chew Y.H., Lee L.H. A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 2006, 34(1):115151.
63. Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 2004, 152(1):148-158.
64. T'kindt V., Billaut J.-C. Multicriteria scheduling problems: a survey. RAIRO Oper. Res. 2001, 35(2):143-163.
65. Toth P., Vigo D. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications 2002, SIAM, Philadelphia.
66. Verma M., Verter V., Zufferey N. A bi-objective model for planning and managing rail-truck intermodal transportation of hazardous materials. Transport. Res. Part E: Logistics Transport. Rev. 2012, 48(1):132-149.
67. Wang X., Regan A.C. Local truckload pickup and delivery with hard time window constraints. Transport. Res. Part B: Methodological 2002, 36(2):97-112.
68. Yang J., Jaillet P., Mahmassani H. Real-time multivehicle truckload pickup and delivery problems. Transport. Sci. 2004, 38(2):135-148.
69. Zhang R., Yun W.Y., Moon I.K. A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transport. Res. Part E: Logistics Transport. Rev. 2009, 45(6):904-914.
70. Zhang R., Yun W.Y., Kopfer H. Heuristic-based truck scheduling for inland container transportation. OR Spectrum 2010, 32(3):787-808.
71. Zhang G., Smilowitz K., Erera A.L. Dynamic planning for urban drayage operations. Transport. Res. Part E: Logistics Transport. Rev. 2011, 47(5):764-777.
72. Zitzler E., Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evolut. Comput. 1999, 3(4):257-271.
73. Zitzler E., Thiele L., Laumanns M., Fonseca C.M., Grunert da Fonseca V. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evolut. Comput. 2003, 7(2):117-132.
74. Zitzler E., Laumanns M., Bleuler S. A tutorial on evolutionary multiobjective optimization. Lecture Notes in Economics and Mathematical Systems 2004, vol. 535:3-38. Springer, Berlin. X. Gandibleux, M. Sevaux, K. Sörensen, V. T'kindt (Eds.).
75. Zitzler E., Knowles J., Thiele L. Quality assessment of Pareto set approximations. Lecture Notes in Computer Science 2008, vol. 5252:373-404. Springer, Berlin. J. Branke, K. Deb, K. Miettinen, R. Slowinski (Eds.).