IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v42y2020i1d10.1007_s00291-020-00577-x.html
   My bibliography  Save this article

A column generation-based decomposition and aggregation approach for combining orders in inland transportation of containers

Author

Listed:
  • Xinan Yang

    (University of Essex)

  • Hajem A. Daham

    (Al-Muthanna University)

Abstract

A significant portion of the total cost of the intermodal transportation is generated from the inland transportation of containers. In this paper, we design a mixed integer linear programming (MILP) model for combining orders in the inland, haulage transportation of containers. The pickup and delivery process of both 20 and 40 foot containers from the terminals to the customer locations and vice versa are optimized using heterogeneous fleet consisting of both 20 ft and 40 ft trucks/chasses. Important operational constraints such as the time window at order receivers, the payload weight of containers and the regulation of the working hours are considered. Based on an assignment problem structure, this MILP solves efficiently to optimality for problems with up to 120 orders. To deal with larger instances, a decomposition and aggregation heuristic is designed. The basic idea of this approach is to decompose order locations geographically into fan-shaped subareas based on the angle of the order location to the port baseline, and solve the sub problems using the proposed MILP model. To balance the fleet size amongst all subgroups, column generation is used to iteratively adjust the number of allocated trucks according to the shadow-price of each truck type. Based on decomposed solutions, orders that are “fully” combined with others are removed and an aggregation phase follows to enable wider combination choices across subgroups. The decomposition and aggregation solution process is tested to be both efficient and cost-saving.

Suggested Citation

  • Xinan Yang & Hajem A. Daham, 2020. "A column generation-based decomposition and aggregation approach for combining orders in inland transportation of containers," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 261-296, March.
    • Handle: RePEc:spr:orspec:v:42:y:2020:i:1:d:10.1007_s00291-020-00577-x
    DOI: 10.1007/s00291-020-00577-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-020-00577-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-020-00577-x?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. 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. 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.
    4. Morlok, Edward K. & Spasovic, Lazar N., 1994. "Redesigning Rail-Truck Intermodal Drayage Operations for Enhanced Service and Cost Performance," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 34(1).
    5. L. R. Ford, Jr. & D. R. Fulkerson, 1958. "A Suggested Computation for Maximal Multi-Commodity Network Flows," Management Science, INFORMS, vol. 5(1), pages 97-101, October.
    6. 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.
    7. Gronalt, Manfred & Hartl, Richard F. & Reimann, Marc, 2003. "New savings based algorithms for time constrained pickup and delivery of full truckloads," European Journal of Operational Research, Elsevier, vol. 151(3), pages 520-535, December.
    8. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    9. Rob Konings, 2005. "Foldable Containers to Reduce the Costs of Empty Transport? A Cost–Benefit Analysis from a Chain and Multi-Actor Perspective," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 7(3), pages 223-249, September.
    10. Marco E. Lübbecke & Uwe T. Zimmermann, 2003. "Engine Routing and Scheduling at Industrial In-Plant Railroads," Transportation Science, INFORMS, vol. 37(2), pages 183-197, May.
    11. 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.
    12. 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.
    13. Kris Braekers & Gerrit Janssens & An Caris, 2011. "Challenges in Managing Empty Container Movements at Multiple Planning Levels," Transport Reviews, Taylor & Francis Journals, vol. 31(6), pages 681-708.
    14. Theo E. Notteboom * & Jean-Paul Rodrigue, 2005. "Port regionalization: towards a new phase in port development," Maritime Policy & Management, Taylor & Francis Journals, vol. 32(3), pages 297-313, July.
    15. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    16. Carlos F. Daganzo, 1984. "The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application," Transportation Science, INFORMS, vol. 18(4), pages 331-350, November.
    17. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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).

    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. 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).
    2. 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).
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Moghaddam, Mahboobeh & Pearce, Robin H. & Mokhtar, Hamid & Prato, Carlo G., 2020. "A generalised model for container drayage operations with heterogeneous fleet, multi-container sizes and two modes of operation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 139(C).
    8. Samaneh Shiri & Nathan Huynh & Daniel Smith & Frank Harder, 2022. "Impact of Second-Tier Container Port Facilities on Drayage Operation," Logistics, MDPI, vol. 6(4), pages 1-21, September.
    9. 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).
    10. 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.
    11. 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.
    12. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    13. 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).
    14. 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.
    15. 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.
    16. 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).
    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. Fan, Tijun & Pan, Qianlan & Pan, Fei & Zhou, Wei & Chen, Jingyi, 2020. "Intelligent logistics integration of internal and external transportation with separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    19. 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.
    20. 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.

    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:spr:orspec:v:42:y:2020:i:1:d:10.1007_s00291-020-00577-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.