EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3249. A Branch and Price for the Min Max Multi-Trip Location Arc Routing Problem
Invited abstract in session TB-64: Arc Routing, stream VeRoLog - Vehicle Routing and Logistics.
Tuesday, 10:30-12:00Room: S16 (building: 101)
Authors (first author is the speaker)
| 1. | Teresa Corberán
|
| Estadística i Investigació Operativa, Universitat de València | |
| 2. | Isaac Plana
|
| Matemáticas para la Economía y la Empresa, University of Valencia | |
| 3. | Jose Maria Sanchis
|
| Matemática aplicada, Universidad Politécnica de Valencia |
Abstract
In this work, we address the Min Max Multi-Trip Location Arc Routing Problem (MM-MT-LARP). We consider a depot from which a set of P trucks, each one carrying a drone, must travel to P out of D available points, where the drone is launched. Each drone has a limited autonomy which allows it to fly a maximum time L before having to get back to the launching point to change its battery so that it can start another route. Once the drone has completed all its routes, the truck goes back to the depot. The goal of the MM-MT-LARP is to determine the launching point for each truck and find a set of drone routes for each truck, each one starting and ending at its launching point and with flight time not greater than L, in such a way that all the drones’ routes jointly traverse all the given edges and the largest total time of all the trucks (time of traveling to the launching point, flight time of the drone and time of traveling back to the depot) is minimized. In this talk, we present a route-based formulation for the problem and a branch-and-price algorithm to solve it, as well as some preliminary computational results on a set of instances with different characteristics.
Keywords
- Vehicle Routing
- Combinatorial Optimization
- Transportation
Status: accepted
Back to the list of papers