IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v217y2012i2p448-458.html
   My bibliography  Save this article

Two heuristic solution concepts for the vehicle selection problem in line haul transports

Author

Listed:
  • Zäpfel, Günther
  • Bögl, Michael

Abstract

In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.

Suggested Citation

  • Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
    • Handle: RePEc:eee:ejores:v:217:y:2012:i:2:p:448-458
    DOI: 10.1016/j.ejor.2011.09.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711008137
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.09.010?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. Cunha, Claudio B. & Silva, Marcos Roberto, 2007. "A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil," European Journal of Operational Research, Elsevier, vol. 179(3), pages 747-758, June.
    2. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    3. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    4. Liu, Jiyin & Li, Chung-Lun & Chan, Chun-Yan, 2003. "Mixed truck delivery systems with both hub-and-spoke and direct shipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 39(4), pages 325-339, July.
    5. Zapfel, Gunther & Wasner, Michael, 2002. "Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers," International Journal of Production Economics, Elsevier, vol. 78(2), pages 207-220, July.
    6. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    7. 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.
    8. van de Klundert, Joris & Otten, Bernhard, 2011. "Improving LTL truck load utilization on line," European Journal of Operational Research, Elsevier, vol. 210(2), pages 336-343, April.
    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. Omar Ben-Ayed, 2012. "Redesigning the inter-facility network of a parcel distribution company in a developing country," International Journal of Services, Economics and Management, Inderscience Enterprises Ltd, vol. 4(1), pages 27-42.
    2. Jiyoung Choi & Chungmok Lee & Sungsoo Park, 2018. "Dantzig–Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network," Annals of Operations Research, Springer, vol. 264(1), pages 57-87, May.
    3. 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.
    4. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    5. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    6. S Alumur & B Y Kara, 2009. "A hub covering network design problem for cargo applications in Turkey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1349-1359, October.
    7. Lin, Cheng-Chang, 2010. "The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services," International Journal of Production Economics, Elsevier, vol. 123(1), pages 20-30, January.
    8. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    9. 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.
    10. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    11. Martina Jakara & Nikolina Brnjac, 2023. "Foliated Transport Networks in Intermodal Freight Transport," Sustainability, MDPI, vol. 15(9), pages 1-13, April.
    12. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    13. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    14. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
    15. 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.
    16. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
    17. Mohammad S. Roni & Sandra D. Eksioglu & Kara G. Cafferty & Jacob J. Jacobson, 2017. "A multi-objective, hub-and-spoke model to design and manage biofuel supply chains," Annals of Operations Research, Springer, vol. 249(1), pages 351-380, February.
    18. Kulkarni, Onkar & Dahan, Mathieu & Montreuil, Benoit, 2022. "Resilient Hyperconnected Parcel Delivery Network Design Under Disruption Risks," International Journal of Production Economics, Elsevier, vol. 251(C).
    19. Wei Zhou & Jane Lin, 2019. "An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies," Networks and Spatial Economics, Springer, vol. 19(2), pages 409-443, June.
    20. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.

    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:ejores:v:217:y:2012:i:2:p:448-458. 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/eor .

    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.