RT Journal Article
T1 A bi-objective study of the minimum latency problem
A1 Arellano Arriaga, Nancy Aracely
A1 Molina-Luque, Julián
A1 Schaeffer, Satu-Elisa
A1 Álvarez-Socarrás, Ada-Margarita
A1 Martínez-Salazar, Iris-Abril
K1 Heurística
K1 Optimización combinatoria
K1 Algoritmos genéticos
AB We study a bi-objective problem called the Minimum Latency-Distance Problem (mldp) that aims to minimise travel time and latency of a single-vehicle tour designed to serve a set of client requests. This tour is a Hamiltonian cycle for which we aim to simultaneously minimise the total travel time of the vehicle and the total waiting time (i.e., latency) of the clients along the tour. This problem is relevant in contexts where both client satisfaction and company profit are prioritise. We propose two heuristic methods for approximating Pareto fronts for mldp: SMSA that is based on a classic multi-objective algorithm and EiLS that is based on a novel evolutionary algorithm with intelligent local search. We report computational experiments on a set of artificially generated problem instances using an exact method and the two proposed heuristics, comparing the obtained fronts in terms of various quality metrics.
PB Springer
YR 2019
FD 2019
LK https://hdl.handle.net/10630/36263
UL https://hdl.handle.net/10630/36263
LA eng
NO Arellano-Arriaga, N.A., Molina, J., Schaeffer, S.E. et al. A bi-objective study of the minimum latency problem. J Heuristics 25, 431–454 (2019). https://doi.org/10.1007/s10732-019-09405-0
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 21 ene 2026