Campus Event Calendar
Event Entry
What and Who
Packing While Traveling
Dr. Sergey Polyakovskiy
University of Adelaide
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 28 May 2015
13:00
30 Minutes
E1 4
024
Saarbrücken
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 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.
Contact
Christina Fries
--email hidden
passcode not visible
logged in users only
Christina Fries, 05/06/2015 20:49 -- Created document.