Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem

Nedialko B. Dimitrov, Daniel Solow, Joseph Szmerekovsky and Jia Guo

European Journal of Operational Research, 2017, vol. 258, issue 3, 938-942

Abstract: The Multiple Knapsack Assignment Problem (MKAP) has been solved successfully using heuristics, but important special cases have not yet been dealt with. Motivated by an emergency relocation problem, an optimal polynomial algorithm and a high performing heuristic that take advantage of the special structure are provided for two special cases of the MKAP.

Keywords: Multiple Knapsack Assignment Problem; Vehicle Routing and Transportation Problem; Emergency Management; Optimization; Heuristics (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716307342
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:258:y:2017:i:3:p:938-942

DOI: 10.1016/j.ejor.2016.09.004

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().