EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1782. A mixed integer formulation and an NSGA-II for the Bi-objective Cumulative Capacitated Vehicle Routing Problem with Priority Indexes

Invited abstract in session MD-29: Vehicle Routing II, stream Combinatorial Optimization.

Monday, 14:30-16:00
Room: 157 (building: 208)

Authors (first author is the speaker)

1. Karina Corona-Gutiérrez
Facultad de Ingeniería, Universidad Panamericana
2. Samuel Nucamendi-Guillén
Facultad de Ingeniería, Universidad Panamericana
3. Iris Martínez-Salazar
Graduate Program in Systems Engineering, Universidad Autónoma de Nuevo León
4. Marcos Moreno-Vega
Ingeniería Informática y de Sistemas, Universidad de La Laguna

Abstract

We propose a new mixed integer formulation and an efficient metaheuristic for the Bi-objective Cumulative Capacitated Vehicle Routing Problem considering Priority Indexes (BCCVRP-Pr), a variant of the classical Capacitated Vehicle Routing Problem in which customers are served according to a certain level of preferences by a fixed fleet of heterogeneous vehicles. In this problem, two objectives are minimized: the total latency and the total tardiness of the system. The proposed mathematical formulation (a multilevel network approach) showed its effectiveness by outperforming the previous models presented in the literature, reporting efficient Pareto Fronts for instances up to 25 nodes. Regarding the metaheuristic, we developed a Non-Dominated Sorting Genetic Algorithm (NSGA-II) capable of dealing with larger instances (up to 100 nodes). To evaluate and compare the performance of the metaheuristic procedure against the results obtained by the proposed exact model, we used four performance metrics: the quantity of non-dominated points, the hypervolume, the coverage of two sets, and the elapsed computational time. According to the results, the algorithm showed a compelling performance by providing high-quality Pareto fronts at competitive computational times. Our research provides valuable insights into solving the Cumulative Capacitated Vehicle Routing Problem with priority indexes, suitable for practical applications in industries that require prioritizing customer service.

Keywords

Status: accepted

Back to the list of papers