A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals

International Journal of Computer Aided Engineering and Technology

Volumn 2, Issue 4, 2010, Pages 340-355

  Caris, An ^a   Janssens, Gerrit K ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

container transport; DA; deterministic annealing; full truckload; intermodal transportation; local search operators; metaheuristics; PDP; pickup and delivery problem; post optimisation; pre and end haulage

Indexed keywords

EID: 79956335683     PISSN: 17572657     EISSN: 17572665     Source Type: Journal    
DOI: 10.1504/IJCAET.2010.035390     Document Type: Article

References (16)

1. Bräysy, O., Dullaert, W., Hasle, G., Mester, D. and Gendreau, M. (2008) ‘An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows’, Transportation Science, Vol. 42, No. 3, pp.371–386.
2. Caris, A. and Janssens, G.K. (2009) ‘A local search heuristic for the pre- and end-haulage of intermodal container terminals’, Computers and Operations Research, Vol. 36, No. 10, pp.2763-2772.
3. Caris, A., Macharis, C. and Janssens, G.K. (2008) ‘Planning problems in intermodal freight transport: accomplishments and prospects’, Transportation Planning and Technology, Vol. 31, No. 3, pp.277-302.
4. Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P. and Vigo, D. (2007) ‘Vehicle routing’, in Barnhart, C. and Laporte, G. (Eds.): Transportation, Vol. 14, Chapter 6, pp.367-428, Handbooks in operations research and management science, North-Holland.
5. Currie, R.H. and Salhi, S. (2003) ‘Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows’, Journal of the Operational Research Society, Vol. 54, pp.390-400.
6. Currie, R.H. and Salhi, S. (2004) ‘A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows’, Journal of Mathematical Modelling and Algorithms, Vol. 3, pp.225-243.
7. Dueck, G. and Scheuer, T. (1990) ‘Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing’, Journal of Computational Physics, Vol. 90, pp.161-175.
8. Dumas, Y., Desrosiers, J. and Soumis, F. (1991) ‘The pickup and delivery problem with time windows’, European Journal of Operational Research, Vol. 54, pp.7-22.
9. Gronalt, M., Hartl, R.F. and Reimann, M. (2003) ‘New savings based algorithms for time constrained pickup and delivery of full truckloads’, European Journal of Operational Research, Vol. 151, pp.520-535.
10. Imai, A., Nishimura, E. and Current, J. (2007) ‘A Lagrangian relaxation-based heuristic for the vehicle routing with full container load’, European Journal of Operational Research, Vol. 176, No. 1, pp.87-105.
11. Macharis, C. and Bontekoning, Y.M. (2004) ‘Opportunities for OR in intermodal freight transport research: a review’, European Journal of Operational Research, Vol. 153, pp.400-416.
12. Osman, I.H. and Wassan, N.A. (2002) ‘A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls’, Journal of Scheduling, Vol. 5, pp.263-285.
13. Parragh, S.N., Doerner, K.F. and Hartl, R.F. (2008) ‘A survey on pickup and delivery problems, part I: transportation between customers and depot’, Journal für Betriebswirtschaft, Vol. 58, pp.21-51.
14. Savelsbergh, M.W.P. and Sol, M. (1995) ‘The general pickup and delivery problem’, Transportation Science, Vol. 29, No. 1, pp.17-29.
15. Tarantilis, C.D., Kiranoudis, C.T. and Vassiliadis, V.S. (2004) ‘A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem’, European Journal of Operational Research, Vol. 152, pp.148-158.
16. Wang, X. and Regan, A.C. (2002) ‘Local truckload pickup and delivery with hard time window constraints’, Transportation Research Part B, Vol. 36, pp.97-112.