EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1875. A Set Partitioning Model for MinMax Vehicle Routing
Invited abstract in session MC-58: Column Generation for Vehicle Routing, stream VeRoLog - Vehicle Routing and Logistics.
Monday, 12:30-14:00Room: S07 (building: 101)
Authors (first author is the speaker)
| 1. | Jens Lysgaard
|
| Department of Economics and Business Economics, Aarhus University | |
| 2. | Sune Lauth Gadegaard
|
| Department of Economics and Business Economics, Aarhus University |
Abstract
This paper proposes a new approach to modeling of vehicle routing problems with a MinMax objective. At the core of the approach, a Set Partitioning model is formulated and used for minimizing infeasibility of the considered vehicle routing problem for a given upper bound on the objective value. Generally, the optimal value of the MinMax objective is obtained as the smallest upper bound for which the Set Partitioning model obtains a total infeasibility of zero. Computational experience shows very promising results.
Keywords
- Vehicle Routing
Status: accepted
Back to the list of papers