RT Journal Article
T1 Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises
A1 López Sánchez, Ana Dolores
A1 Molina, Julián
A1 Laguna, Manuel
A1 Hernández-Díaz, Alfredo G.
K1 Frequency
K1 Local search
K1 Multi-start algorithm
K1 Periodic vehicle routing problem
K1 Proximate optimality principle
K1 Service choice
AB In this paper, a new solution method is implemented to solve a bi-objective variant of the vehicle routing problem that appears in industry and environmental enterprises. The solution involves designing a set of routes for each day in a period, in which the service frequency is a decision variable. The proposed algorithm, a muti-start multiobjective local search algorithm (MSMLS), minimizes total emissions produced by all vehicles and maximizes the service quality measured as the number of times that a customer is visited by a vehicle in order to be served. The MSMLS is a neighbourhood-based metaheuristic that obtains high-quality solutions and that is capable of achieving better performance than other competitive algorithms. Furthermore, the proposed algorithm is able to perform rapid movements thanks to the easy representation of the solutions.
PB Willey
YR 2020
FD 2020-07-20
LK https://hdl.handle.net/10433/22548
UL https://hdl.handle.net/10433/22548
LA en
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 8, 2026