IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v51y2017i4p1177-1195.html
   My bibliography  Save this article

Relay Network Design with Capacity and Link-Imbalance Considerations: A Lagrangean Decomposition Algorithm and Analysis

Author

Listed:
  • Panitan Kewcharoenwong

    (School of Manufacturing Systems and Mechanical Engineering, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani 12121, Thailand)

  • Halit Üster

    (Department of Engineering Management, Information, and Systems, Lyle School of Engineering, Southern Methodist University, Dallas, Texas 75275)

Abstract

High driver turnover and driver shortage are costly problems in the truckload trucking industry. Extended on-the-road times and low quality of life with irregular schedules and low get-home rates for drivers are commonly attributed as the main culprits in both academic and industry literature. The use of a relay network on which the truckloads switch drivers during their transportation can potentially help reduce drivers’ away-from-home times and regularize their schedule without sacrificing the mileage accumulation on which their pay is determined. Relay network design involves the determination of the relay point (RP) locations, their interconnections, assignment of non-RP nodes to RPs, and the routes for truckloads. Recognizing the importance of considering operational realities such as empty mileage and driver availability along with limited resources, we introduce link capacity constraints and the concept of link imbalance in strategic relay network design. The use of link imbalance is motivated by the need to improve operational efficiency via increased ability to return drivers to their home bases and reduce empty backhauls. To solve our mixed-integer programming design model, we develop an efficient Lagrangean decomposition algorithm that can provide solutions to large-size problems with small optimality gaps within reasonable runtimes. We also present computational experiments on the algorithmic performance, trade-offs between imbalance and cost components, effects of capacity, and the relationship between link- and node-imbalance concepts.

Suggested Citation

  • Panitan Kewcharoenwong & Halit Üster, 2017. "Relay Network Design with Capacity and Link-Imbalance Considerations: A Lagrangean Decomposition Algorithm and Analysis," Transportation Science, INFORMS, vol. 51(4), pages 1177-1195, November.
    • Handle: RePEc:inm:ortrsc:v:51:y:2017:i:4:p:1177-1195
    DOI: 10.1287/trsc.2016.0704
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2016.0704
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2016.0704?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
    ---><---

    References listed on IDEAS

    as
    1. Vergara, Hector A. & Root, Sarah, 2013. "Mixed fleet dispatching in truckload relay network design optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 32-49.
    2. Don Taylor, G. & Whicker, Gary L. & Grant DuCote, W., 2009. "Design and analysis of delivery 'pipelines' in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 255-269, January.
    3. Don Taylor, G. & DuCote, W. Grant & Whicker, Gary L., 2006. "Regional fleet design in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(3), pages 167-190, May.
    4. Taylor, G. Don & Whicker, Gary L. & Usher, John S., 2001. "Multi-zone dispatching in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(5), pages 375-390, November.
    5. Ali, Tarab H. & Radhakrishnan, Sridhar & Pulat, Simin & Gaddipati, Nagaiah C., 2002. "Relay network design in freight transportation systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 38(6), pages 405-422, November.
    6. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2009. "The design of single allocation incomplete hub networks," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 936-951, December.
    7. Taylor, G. D. & Meinert, T. S. & Killian, R. C. & Whicker, G. L., 1999. "Development and analysis of alternative dispatching methods in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 35(3), pages 191-205, September.
    8. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    9. Halit Üster & Homarjun Agrahari, 2010. "An integrated load-planning problem with intermediate consolidated truckload assignments," IISE Transactions, Taylor & Francis Journals, vol. 42(7), pages 490-513.
    10. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    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. Amin Ziaeifar & Halit Üster, 2023. "Relay network design with direct shipment and multi-relay assignment," Annals of Operations Research, Springer, vol. 328(2), pages 1585-1614, September.
    2. Kewcharoenwong, Panitan & Li, Qiaofeng & Üster, Halit, 2023. "Lagrangean relaxation algorithms for fixed-charge capacitated relay network design," Omega, Elsevier, vol. 121(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. Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Regenerator Location Problem and survivable extensions: A hub covering location perspective," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 32-55.
    2. Vergara, Hector A. & Root, Sarah, 2013. "Mixed fleet dispatching in truckload relay network design optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 32-49.
    3. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    4. Lei, Xinyue & Chen, Junlan & Zhu, Zhenjun & Guo, Xiucheng & Liu, Pei & Jiang, Xiaohong, 2022. "How to locate urban–rural transit hubs from the viewpoint of county integration?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    5. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    6. Ivan Contreras & Elena Fernández, 2014. "Hub Location as the Minimization of a Supermodular Set Function," Operations Research, INFORMS, vol. 62(3), pages 557-570, June.
    7. J. Fabian Meier & Uwe Clausen, 2018. "Solving Single Allocation Hub Location Problems on Euclidean Data," Transportation Science, INFORMS, vol. 52(5), pages 1141-1155, October.
    8. Mohammadreza Hamidi & Mohammadreza Gholamian & Kamran Shahanaghi, 2014. "Developing prevention reliability in hub location models," Journal of Risk and Reliability, , vol. 228(4), pages 337-346, August.
    9. Amin Ziaeifar & Halit Üster, 2023. "Relay network design with direct shipment and multi-relay assignment," Annals of Operations Research, Springer, vol. 328(2), pages 1585-1614, September.
    10. El Mehdi Ibnoulouafi & Mustapha Oudani & Tarik Aouam & Mounir Ghogho, 2022. "Intermodal Green p-Hub Median Problem with Incomplete Hub-Network," Sustainability, MDPI, vol. 14(18), pages 1-29, September.
    11. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.
    12. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    13. Ghaffarinasab, Nader & Kara, Bahar Y. & Campbell, James F., 2022. "The stratified p-hub center and p-hub maximal covering problems," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 120-148.
    14. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    15. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    16. Trung Hieu Tran & Jesse R. O’Hanley & M. Paola Scaparra, 2017. "Reliable Hub Network Design: Formulation and Solution Techniques," Transportation Science, INFORMS, vol. 51(1), pages 358-375, February.
    17. Erdoğan, Güneş & Battarra, Maria & Rodríguez-Chía, Antonio M., 2022. "The hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1035-1047.
    18. G. Guastaroba & M. G. Speranza & D. Vigo, 2016. "Intermediate Facilities in Freight Transportation Planning: A Survey," Transportation Science, INFORMS, vol. 50(3), pages 763-789, August.
    19. Jayaswal, Sachin & Vidyarthi, Navneet, 2023. "Multiple allocation hub location with service level constraints for two shipment classes," European Journal of Operational Research, Elsevier, vol. 309(2), pages 634-655.
    20. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.

    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:inm:ortrsc:v:51:y:2017:i:4:p:1177-1195. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.