The Packing While Traveling Problem
| dc.contributor.author | Polyakovskiy, S. | |
| dc.contributor.author | Neumann, F. | |
| dc.date.issued | 2017 | |
| dc.description.abstract | This 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.statementofresponsibility | S. Polyakovskiy, F. Neumann | |
| dc.identifier.citation | European Journal of Operational Research, 2017; 258(2):424-439 | |
| dc.identifier.doi | 10.1016/j.ejor.2016.09.035 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.issn | 1872-6860 | |
| dc.identifier.orcid | Polyakovskiy, S. [0000-0001-9489-1972] | |
| dc.identifier.orcid | Neumann, F. [0000-0002-2721-3618] | |
| dc.identifier.uri | http://hdl.handle.net/2440/119962 | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.relation.grant | http://purl.org/au-research/grants/arc/DP130104395 | |
| dc.rights | © 2016 Elsevier B.V. All rights reserved. | |
| dc.source.uri | https://doi.org/10.1016/j.ejor.2016.09.035 | |
| dc.subject | Combinatorial optimization; non-linear knapsack problem; linearization technique; piecewise approximation; hybrid optimization | |
| dc.title | The Packing While Traveling Problem | |
| dc.type | Journal article | |
| pubs.publication-status | Published |