Abstract
Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are \(\mathcal {NP}\)-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the approximate MIP approach often leads to near optimal results within far less computation time than the exact approach.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D., Cook, W.J., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82–92 (2003)
Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621–636 (1989)
Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, pp. 1037–1044. IEEE, Cancun, June 20–23, 2013
Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research 138(3), 459–472 (2002)
Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)
Elhedhli, S.: Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6), 615–624 (2005)
Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multi-objective knapsack problems. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, p. 210. Springer, Heidelberg (2001)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
Hochbaum, D.S.: A nonlinear knapsack problem. Oper. Res. Lett. 17(3), 103–110 (1995)
Li, H.L.: A global approach for general 0–1 fractional programming. European Journal of Operational Research 73(3), 590–596 (1994)
Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Systems with Applications 41(4, Part 1), 1118–1138 (2014)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons (1990)
Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Arnold, D.V. (ed.) GECCO, pp. 477–484. ACM (2014)
Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3(4), 376–384 (1991)
Sherali, H., Adams, W.: A Reformulation Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. J Kluwer Academic Publishing, Boston (1999)
Tawarmalani, M., Ahmed, S., Sahinidis, N.: Global optimization of 0–1 hyperbolic programs. Journal of Global Optimization 24(4), 385–416 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Polyakovskiy, S., Neumann, F. (2015). Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. In: Michel, L. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2015. Lecture Notes in Computer Science(), vol 9075. Springer, Cham. https://doi.org/10.1007/978-3-319-18008-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-18008-3_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18007-6
Online ISBN: 978-3-319-18008-3
eBook Packages: Computer ScienceComputer Science (R0)