Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/119962
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: The Packing While Traveling Problem
Author: Polyakovskiy, S.
Neumann, F.
Citation: European Journal of Operational Research, 2017; 258(2):424-439
Publisher: Elsevier
Issue Date: 2017
ISSN: 0377-2217
1872-6860
Statement of
Responsibility: 
S. Polyakovskiy, F. Neumann
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.
Keywords: Combinatorial optimization; non-linear knapsack problem; linearization technique; piecewise approximation; hybrid optimization
Rights: © 2016 Elsevier B.V. All rights reserved.
RMID: 0030045581
DOI: 10.1016/j.ejor.2016.09.035
Grant ID: http://purl.org/au-research/grants/arc/DP130104395
Appears in Collections: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.