EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

2682. Last-Mile Logistics: Comparing Alternative Formulations of a Bi-Objective Vehicle Routing Problem Based on K-Sum Minimization

Invited abstract in session WA-37: Multiobjective Combinatorial Optimization, stream Multiobjective Optimization.

Wednesday, 8:30-10:00
Room: 33 (building: 306)

Authors (first author is the speaker)

1. Filippo Ranza
Department of Information Engineering, University of Brescia
2. Renata Mansini
Department of Information Engineering, University of Brescia
3. Justo Puerto
Estadistica e I.O., Universidad de Sevilla
4. Roberto Zanotti
Department of Clinical and Experimental Sciences, University of Brescia

Abstract

In this work, we introduce a bi-objective Vehicle Routing Problem that minimizes both the routing cost and the impact on citizens evaluated in terms of pollution, noise, and safety (social impact). To measure the latter we consider the number of traversals multiplied by the population living on each street. Formulated on a multi-graph, the problem considers different paths between each pair of nodes. The two objective functions are solved lexicographically. First, the routing cost is minimized, then the social impact is optimized by allowing a predefined degradation of the routing cost. Several K-Sum compact formulations as described in [1] and [2] in addition to a non compact one are tested and compared. A comprehensive sensitivity analysis is also conducted on multiple realistic instances, considering different k values.
References
[1] Ogryczak, Wlodzimierz, and Arie Tamir. “Minimizing the sum of the k largest functions in linear time.” Information Processing Letters 85.3 (2003): 117-122.
[2] Blanco, Victor, Justo Puerto, and Safae El Haj Ben Ali. “Revisiting several problems and algorithms in continuous location with ℓ τ norms.” Computational Optimization and Applications 58.3 (2014): 563-595.

Keywords

Status: accepted

Back to the list of papers