IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v133y2011i1p351-359.html
   My bibliography  Save this article

Modeling and optimization of a container drayage problem with resource constraints

Author

Listed:
  • Zhang, Ruiyou
  • Yun, Won Young
  • Moon, Il Kyeong

Abstract

This paper investigates the problem faced by firms that transport containers by truck in an environment with resource constraints. The considered area is export-dominant. As a result, there are three types of container movements as inbound full, outbound full, and inbound empty movements. Both the time windows at the terminal and at the customers' places and the operation times are considered. Empty containers are also regarded as separate transportation resources besides trucks. The total operating time including waiting time of all the trucks in operation is minimized. The problem is first formulated as a directed graph and then mathematically modeled based on the graph. It falls into a multiple traveling salesman problem with time windows (m-TSPTW) with resource constraints. An algorithm based on reactive tabu search (RTS) is developed to solve the problem. A number of randomly generated examples indicate that the algorithm can be applied to the real world.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:133:y:2011:i:1:p:351-359
    as

    Download full text from publisher

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

    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. Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
    3. 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.
    4. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    5. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    6. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    7. Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
    8. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    9. 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.
    10. 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.
    11. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    12. 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.
    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. 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.
    3. 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.
    4. 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).
    5. 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).
    6. 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.
    7. 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.
    8. 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.
    9. 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).
    10. Zhang, Ruiyou & Zhao, Haishu & Moon, Ilkyeong, 2018. "Range-based truck-state transition modeling method for foldable container drayage services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 225-239.
    11. 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.
    12. Ma, Hong & Cheang, Brenda & Lim, Andrew & Zhang, Lei & Zhu, Yi, 2012. "An investigation into the vehicle routing problem with time windows and link capacity constraints," Omega, Elsevier, vol. 40(3), pages 336-347.
    13. 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.
    14. Xue, Ning & Bai, Ruibin & Qu, Rong & Aickelin, Uwe, 2021. "A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 292(2), pages 500-514.
    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. Jennifer A. Pazour & Lucas C. Neubert, 2013. "Routing and Scheduling of Cross-Town Drayage Operations at J.B. Hunt Transport," Interfaces, INFORMS, vol. 43(2), pages 117-129, April.
    17. 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.
    18. 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.
    19. 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).
    20. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.

    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:proeco:v:133:y:2011:i:1:p:351-359. 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/locate/ijpe .

    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.