Advanced search
Publication Cover
INFOR: Information Systems and Operational Research Volume 54, 2016 - Issue 1
Submit an article Journal homepage
153
Views
6
CrossRef citations to date
0
Altmetric
Articles

Optimization of the drayage problem using exact methods

Line Blander ReinhardtDepartment of Management Engineering, Technical University of Denmark, Lyngby, DenmarkCorrespondence[email protected]
,
David PisingerDepartment of Management Engineering, Technical University of Denmark, Lyngby, Denmark
,
Simon SpoorendonkDepartment of Management Engineering, Technical University of Denmark, Lyngby, Denmark
&
Mikkel M. SigurdMaersk line, Copenhagen K, Denmark
Pages 33-51 | Received 09 Jul 2015, Accepted 20 Jan 2016, Published online: 29 Mar 2016

References

  • Braekers K, Caris A, Janssens GK. 2011. A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations. Procedia Soc Behav Sci. 20: 344–353.
  • Braekers K, Caris A, Janssens GK. 2013. Integrated planning of loaded and empty container movements. OR Spectr. 35:457–478.
  • Caris A, Janssens GK. 2009. A local search heuristic for the pre- and end-haulage of intermodal container terminals. Comput Oper Res. 36:2763–2772.
  • Imai A, Nishimura E, Current J. 2007. A lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur J Operat Res. 176:87–105.
  • Jula H, Dessouky M, Ioannou P, Chassiakos A. 2005. Container movement by trucks in metropolitan networks: modeling and optimization. Transport Res E. 41:235–259.
  • Mingozzi A, Giorgi S, Baldacci R. 1999. Exact method for the vehicle routing problem with backhauls. Transpo Sci. 33:315–329.
  • Nossack J, Pesch E. 2013. A truck scheduling problem arising in intermodal container transportation. Eur J Oper Res. 230:666–680.
  • Osman IH, Wassan NA. 2002. A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. J Schedul. 5:263–285.
  • Reinhardt LB, Spoorendonk S, Pisinger D. 2012. Solving vehicle routing with full container load and time windows. In: Hao H, Xiaoning S, Robert S, Stefan V, editors. Computational logistics, volume LNCS 7555; September 24–26; Shanghai, China. Berlin Heidelberg: Springer; p. 120–128.
  • Schönberger J, Buer T, Kopfer H. 2013. A model for the coordination of 20-foot and 40-foot container movements in the hinterland of a container terminal. In: Dario P, Stefan V, Rune MJ, editors. Computational Logistics, LNCS, Vol. 8197; September 25–27; Copenhagen, Denmark. Berlin Heidelberg: Springer; p. 113–127.
  • Toth P, Vigo D. 1997. An exact algorithm for the vehicle routing problem with backhauls. Transpo Sci. 31:372–385.
  • Vidovic M, Radivojevic G, Rakovic B. 2011. Vehicle routing in containers pickup up and delivery processes. Procedia Soc Behav Sci. 20:335–343.
  • Wang WF, Yu7n WY. 2013. Scheduling for inland container truck and train transportation. Int J Prod Econ. 143:349–356.
  • Wang X, Regan AC. 2002. Local truckload pickup and delivery with hard time window constraints. Transp Res B. 36:97–112.
  • Zhang G, Smilowitz K, Erera A. 2011. Dynamic planning for urban drayage operations. Transp Res E. 47:764–777.
  • Zhang R, Yun WY, Kopfer H. 2010. Heuristic-based truck scheduling for inland container transportation. OR Spectr. 32:787–808.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.