Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/119962
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPolyakovskiy, S.-
dc.contributor.authorNeumann, F.-
dc.date.issued2017-
dc.identifier.citationEuropean Journal of Operational Research, 2017; 258(2):424-439-
dc.identifier.issn0377-2217-
dc.identifier.issn1872-6860-
dc.identifier.urihttp://hdl.handle.net/2440/119962-
dc.description.abstractThis paper introduces the Packing While Traveling Problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all the cities in a fixed order. Each selected item contributes its profit, but produces a transportation cost relative to its weight. The problem asks to find a subset of the items such that the total gain is maximized. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. We propose a pre-processing scheme that decreases the size of instances making them easier for computation. We provide lower and upper bounds based on mixed-integer programing (MIP) adopting the ideas of piecewise linear approximation. Furthermore, we introduce two exact approaches: one is based on MIP employing linearization technique, and another is a branch-infer-and-bound (BIB) hybrid approach that compounds the upper bound procedure with a constraint programing model strengthened with customized constraints. Our experimental results show the effectiveness of our exact and approximate solutions in terms of solution quality and computational time.-
dc.description.statementofresponsibilityS. Polyakovskiy, F. Neumann-
dc.language.isoen-
dc.publisherElsevier-
dc.rights© 2016 Elsevier B.V. All rights reserved.-
dc.subjectCombinatorial optimization; non-linear knapsack problem; linearization technique; piecewise approximation; hybrid optimization-
dc.titleThe Packing While Traveling Problem-
dc.typeJournal article-
dc.identifier.doi10.1016/j.ejor.2016.09.035-
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104395-
pubs.publication-statusPublished-
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]-
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]-
Appears in Collections:Aurora harvest 8
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.