1939. A multi-trip vehicle routing with release dates and interrelated periods
Invited abstract in session TB-56: Multi-Period Vehicle Routing Problems, stream Vehicle Routing and Logistics.
Tuesday, 10:30-12:00Room: Liberty 1.11
Authors (first author is the speaker)
| 1. | Leonor S.Pinto
|
| Dep. Matemática, Instituto Superior de Economia e Gestão & CEMAPRE, Universidade de Lisboa | |
| 2. | Raquel Bernardino
|
| ISEG, CEMAPRE, UL | |
| 3. | João Janela
|
| Matemática, Instituto Superior de Economia e Gestão & CEMAPRE | |
| 4. | Carlos Lúcio Martins
|
| CEMAPRE, Instituto Superior de Economia e Gestão, Universidade de Lisboa | |
| 5. | Cândida Mourão
|
| Dep. Matemática, ISEG - Lisbon School of Economics and Management & CEMAPRE, Universidade de Lisboa | |
| 6. | Filipe Rodrigues
|
| ISEG, University of Lisbon |
Abstract
A new vehicle routing problem (VRP) variant is presented, motivated by a car components distribution to repair centers (warehouses). The problem is named the multi-trip VRP with release dates and interrelated periods (MTVRP-RDIP). The routes may start at different pre-defined periods and may have different durations. Thus, two routes that start at different periods may be active at the same period, leading to the so-called interrelated periods. Moreover, the availability of a vehicle to start a route at a period depends on the existing vehicles but and on the active routes at that period. The clients are classified according to their importance and represent warehouses that require car components that are made available throughout the time horizon, leading to the release dates. Delays in satisfying client orders and not serving orders in the time horizon result in penalty costs that must be minimized. The objective to minimize also includes routing and vehicle utilization costs. Two metrics are defined to compute an order’s delay, each leading to a different model.
Computational results showed that only one model is suited to address the smallest instances. A rolling-horizon matheuristic that iteratively solves the better model was designed. The matheuristic provides feasible solutions for all test instances in an efficient manner that are, on average, better than the ones provided by the model in most of the compared key performance indicators.
Keywords
- Vehicle Routing
- Logistics
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers