EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3228. Key performance indicators for consistent vehicle routing problem
Invited abstract in session MB-60: Vehicle routing II, stream Transportation.
Monday, 10:30-12:00Room: S09 (building: 101)
Authors (first author is the speaker)
| 1. | Guillermo Bianchi
|
| Ingeniería Industrial, Universidad Católica del Norte | |
| 2. | Hernán Lespay
|
| Departamento de Ingeniería Industrial, Universidad Católica del Norte |
Abstract
We proposed a mixed-integer linear programming (MILP) for the consistent vehicle routing problem with time windows (ConVRPTW), which is solved with a Tabu Search metaheuristic. This study is motivated by the necessity of increasing the service level of companies in the logistics area. The study considers a schedule of routes in multiple periods, where the set of clients and their demand fluctuates in the planning horizon. The objective is to minimize the length of routes fulfilling the requirements of service consistency. The solution is evaluated through Key Performance Indicators(KPIs) to analyze the balance between routes, design strategies to perform routing plans, and improve future benchmarks in the literature.
Keywords
- Vehicle Routing
- Logistics
- Metaheuristics
Status: accepted
Back to the list of papers