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

The assignment and loading transportation problem

Author

Listed:
  • Homsi, Gabriel
  • Jordan, Jeremy
  • Martello, Silvano
  • Monaci, Michele

Abstract

We consider a generalization of the multiple knapsack problem that combines assignment and loading. The problem can arise in military and emergency situations in which one is required to refurnish a unit with a number of different goods available at different locations. We present a mathematical model and study Lagrangian and surrogate relaxations. We propose heuristic and metaheuristic approaches which we use to develop two overall approximation algorithms: a self-contained polynomial-time heuristic and a more time consuming matheuristic approach that makes use of a MILP solver. Solution times and accuracy of lower and upper bounds are computationally evaluated on a real military data set and on sets of both realistic and randomly generated instances.

Suggested Citation

  • Homsi, Gabriel & Jordan, Jeremy & Martello, Silvano & Monaci, Michele, 2021. "The assignment and loading transportation problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 999-1007.
    • Handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:999-1007
    DOI: 10.1016/j.ejor.2019.07.039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719306034
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.07.039?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. Simon, Jay & Apte, Aruna & Regnier, Eva, 2017. "An application of the multiple knapsack problem: The self-sufficient marine," European Journal of Operational Research, Elsevier, vol. 256(3), pages 868-876.
    2. Diaz, Juan Esteban & Handl, Julia & Xu, Dong-Ling, 2018. "Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing system," European Journal of Operational Research, Elsevier, vol. 266(3), pages 976-989.
    3. Gralla, Erica & Goentzel, Jarrod, 2018. "Humanitarian transportation planning: Evaluation of practice-based heuristics and recommendations for improvement," European Journal of Operational Research, Elsevier, vol. 269(2), pages 436-450.
    4. de la Torre, Luis E. & Dolinskaya, Irina S. & Smilowitz, Karen R., 2012. "Disaster relief routing: Integrating research and practice," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 88-97.
    5. M. Dawande & J. Kalagnanam & P. Keskinocak & F.S. Salman & R. Ravi, 2000. "Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 171-186, June.
    6. Kataoka, Seiji & Yamada, Takeo, 2014. "Upper and lower bounding procedures for the multiple knapsack assignment problem," European Journal of Operational Research, Elsevier, vol. 237(2), pages 440-447.
    7. Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
    8. Geir Dahl & Njål Foldnes, 2006. "LP based heuristics for the multiple knapsack problem with assignment restrictions," Annals of Operations Research, Springer, vol. 146(1), pages 91-104, September.
    9. Dimitrov, Nedialko B. & Solow, Daniel & Szmerekovsky, Joseph & Guo, Jia, 2017. "Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 938-942.
    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. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    2. Stefka Fidanova & Krassimir Todorov Atanassov, 2021. "ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem," Mathematics, MDPI, vol. 9(13), pages 1-7, June.
    3. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    4. Rodríguez-Espíndola, Oscar & Ahmadi, Hossein & Gastélum-Chavira, Diego & Ahumada-Valenzuela, Omar & Chowdhury, Soumyadeb & Dey, Prasanta Kumar & Albores, Pavel, 2023. "Humanitarian logistics optimization models: An investigation of decision-maker involvement and directions to promote implementation," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    5. Mohammadmehdi Hakimifar & Burcu Balcik & Christian Fikar & Vera Hemmelmayr & Tina Wakolbinger, 2022. "Evaluation of field visit planning heuristics during rapid needs assessment in an uncertain post-disaster environment," Annals of Operations Research, Springer, vol. 319(1), pages 517-558, December.
    6. Balcik, Burcu & Yanıkoğlu, İhsan, 2020. "A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty," European Journal of Operational Research, Elsevier, vol. 282(1), pages 40-57.
    7. J. Álvaro Gómez-Pantoja & M. Angélica Salazar-Aguilar & José Luis González-Velarde, 2021. "The food bank resource allocation problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 266-286, April.
    8. Harwin De Vries & Luk N. Van Wassenhove, 2020. "Do Optimization Models for Humanitarian Operations Need a Paradigm Shift?," Production and Operations Management, Production and Operations Management Society, vol. 29(1), pages 55-61, January.
    9. Hans Kellerer & Joseph Y.‐T. Leung & Chung‐Lun Li, 2011. "Multiple subset sum with inclusive assignment set restrictions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(6), pages 546-563, September.
    10. Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
    11. Dilsu Binnaz Ozkapici & Mustafa Alp Ertem & Haluk Aygüneş, 2016. "Intermodal humanitarian logistics model based on maritime transportation in Istanbul," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 83(1), pages 345-364, August.
    12. Hu, Shao-Long & Han, Chuan-Feng & Meng, Ling-Peng, 2016. "Stochastic optimization for investment in facilities in emergency prevention," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 14-31.
    13. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    14. Elif Akçalı & Alper Üngör & Reha Uzsoy, 2005. "Short‐term capacity allocation problem with tool and setup constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 754-764, December.
    15. Xueqi Wu & Zhi‐Long Chen, 2022. "Fulfillment scheduling for buy‐online‐pickup‐in‐store orders," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2982-3003, July.
    16. Mancini, Simona & Triki, Chefi & Piya, Sujan, 2022. "Optimal selection of touristic packages based on user preferences during sports mega-events," European Journal of Operational Research, Elsevier, vol. 302(3), pages 819-830.
    17. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    18. HOSSAIN, Niamat Ullah Ibne & Amrani, Safae El & Jaradat, Raed & Marufuzzaman, Mohammad & Buchanan, Randy & Rinaudo, Christina & Hamilton, Michael, 2020. "Modeling and assessing interdependencies between critical infrastructures using Bayesian network: A case study of inland waterway port and surrounding supply chain network," Reliability Engineering and System Safety, Elsevier, vol. 198(C).
    19. Antonia Ilabaca & Germán Paredes-Belmar & Pamela P. Alvarez, 2022. "Optimization of Humanitarian Aid Distribution in Case of an Earthquake and Tsunami in the City of Iquique, Chile," Sustainability, MDPI, vol. 14(2), pages 1-16, January.
    20. Rennemo, Sigrid Johansen & Rø, Kristina Fougner & Hvattum, Lars Magnus & Tirado, Gregorio, 2014. "A three-stage stochastic facility routing model for disaster response planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 116-135.

    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:289:y:2021:i:3:p:999-1007. 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.