IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v56y2013icp108-118.html
   My bibliography  Save this article

An heuristic search for the routing of heterogeneous trucks with single and double container loads

Author

Listed:
  • Lai, Michela
  • Crainic, Teodor Gabriel
  • Di Francesco, Massimo
  • Zuddas, Paola

Abstract

This paper addresses a new routing problem, where container loads must be shipped from a port to importers and from exporters to the port by trucks carrying one or two containers, without separating trucks and containers during customer service. We describe the problem, formulate an optimization model and propose a metaheuristic. It determines the initial solution by a variant of the Clarke-and-Wright algorithm and improves it by a sequence of local search phases. The comparison of the performance of the solutions yielded by the metaheuristic and that of a carrier’s decisions show the validity and interest of the proposed method.

Suggested Citation

  • Lai, Michela & Crainic, Teodor Gabriel & Di Francesco, Massimo & Zuddas, Paola, 2013. "An heuristic search for the routing of heterogeneous trucks with single and double container loads," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 108-118.
  • Handle: RePEc:eee:transe:v:56:y:2013:i:c:p:108-118
    DOI: 10.1016/j.tre.2013.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554513001154
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2013.06.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Namboothiri, Rajeev & Erera, Alan L., 2008. "Planning local container drayage operations given a port access appointment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(2), pages 185-202, March.
    2. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    3. Zhang, Ruiyou & Yun, Won Young & Moon, Ilkyeong, 2009. "A reactive tabu search algorithm for the multi-depot container truck transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 904-914, November.
    4. Cheung, Raymond K. & Shi, Ning & Powell, Warren B. & Simao, Hugo P., 2008. "An attribute-decision model for cross-border drayage problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(2), pages 217-234, March.
    5. Jula, Hossein & Dessouky, Maged & Ioannou, Petros & Chassiakos, Anastasios, 2005. "Container movement by trucks in metropolitan networks: modeling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(3), pages 235-259, May.
    6. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    7. Subrata Mitra, 2005. "An Algorithm For The Generalized Vehicle Routing Problem With Backhauling," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(02), pages 153-169.
    8. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    9. S Mitra, 2008. "A parallel clustering technique for the vehicle routing problem with split deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1532-1546, November.
    10. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nossack, Jenny & Pesch, Erwin, 2013. "A truck scheduling problem arising in intermodal container transportation," European Journal of Operational Research, Elsevier, vol. 230(3), pages 666-680.
    2. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    3. Benantar, A. & Abourraja, M.N. & Boukachour, J. & Boudebous, D. & Duvallet, C., 2020. "On the integration of container availability constraints into daily drayage operations arising in France: Modelling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    4. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    5. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    6. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
    7. Yujian Song & Yuting Zhang & Wanli Wang & Ming Xue, 2023. "A Branch and Price Algorithm for the Drop-and-Pickup Container Drayage Problem with Empty Container Constraints," Sustainability, MDPI, vol. 15(7), pages 1-28, March.
    8. Bustos-Coral, Daniel & Costa, Alysson M., 2022. "Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    9. Zhang, Ruiyou & Yun, Won Young & Moon, Il Kyeong, 2011. "Modeling and optimization of a container drayage problem with resource constraints," International Journal of Production Economics, Elsevier, vol. 133(1), pages 351-359, September.
    10. Funke, Julia & Kopfer, Herbert, 2016. "A model for a multi-size inland container transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 70-85.
    11. Chen, Rui & Meng, Qiang & Jia, Peng, 2022. "Container port drayage operations and management: Past and future," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    12. Xuhui Yu & Yin Feng & Cong He & Chang Liu, 2024. "Modeling and Optimization of Container Drayage Problem with Empty Container Constraints across Multiple Inland Depots," Sustainability, MDPI, vol. 16(12), pages 1-32, June.
    13. Wang, Naiyu & Meng, Qiang & Zhang, Canrong, 2023. "A branch-price-and-cut algorithm for the local container drayage problem with controllable vehicle interference," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    14. Caballini, Claudia & Sacone, Simona & Saeednia, Mahnam, 2016. "Cooperation among truck carriers in seaport containerized transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 38-56.
    15. Hajem A. Daham & Xinan Yang & Michaela K. Warnes, 2017. "An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(6), pages 678-694, June.
    16. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    17. Shiri, Samaneh & Huynh, Nathan, 2016. "Optimization of drayage operations with time-window constraints," International Journal of Production Economics, Elsevier, vol. 176(C), pages 7-20.
    18. Chen, Rui & Jia, Shuai & Meng, Qiang, 2023. "Dynamic container drayage booking and routing decision support approach for E-commerce platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    19. Chen, Rui & Chen, Shukai & Cui, Haipeng & Meng, Qiang, 2021. "The container drayage problem for heterogeneous trucks with multiple loads: A revisit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    20. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:56:y:2013:i:c:p:108-118. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.