The Packing While Traveling Problem

Date

2017

Authors

Polyakovskiy, S.
Neumann, F.

Editors

Advisors

Journal Title

Journal ISSN

Volume Title

Type:

Journal article

Citation

European Journal of Operational Research, 2017; 258(2):424-439

Statement of Responsibility

S. Polyakovskiy, F. Neumann

Conference Name

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.

School/Discipline

Dissertation Note

Provenance

Description

Access Status

Rights

© 2016 Elsevier B.V. All rights reserved.

License

Call number

Persistent link to this record