2026-05-30T08:37:49Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/362632026-02-03T11:34:30Zcom_10630_2254col_10630_37953

00925njm 22002777a 4500 dc Arellano Arriaga, Nancy Aracely author Molina-Luque, Julián author Schaeffer, Satu-Elisa author Álvarez-Socarrás, Ada-Margarita author Martínez-Salazar, Iris-Abril author 2019 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. 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 https://hdl.handle.net/10630/36263 https://doi.org/10.1007/s10732-019-09405-0 Heurística Optimización combinatoria Algoritmos genéticos A bi-objective study of the minimum latency problem