EURO 2025 Leeds
Abstract Submission

1846. The latency location-or-routing problem

Invited abstract in session MA-15: Applications to Logistics and Supply Chain Management, stream Combinatorial Optimization.

Monday, 8:30-10:00
Room: Esther Simpson 1.08

Authors (first author is the speaker)

1. Alan Osorio-Mora
RPTU Kaiserslautern-Landau
2. Eduardo Álvarez-Miranda
School of Business and Economics, Universidad de Talca
3. Francisco Saldanha-da-Gama
Sheffield University Management School

Abstract

The latency location-or-routing problem (LloRP) is a variant of the location-or-routing problem (LoRP) and an extension of the latency location routing problem (LLRP). The LLoRP consists of selecting a set of depots to open to serve a set of customers. The latter can be served as part of routes also to be decided. Nevertheless, direct allocation service is allowed for customers lying within a certain coverage range from an open depot. A set of homogeneous capacitated vehicles is available. The goal of the problem is to minimize the latency, i.e., the sum of the waiting times of the customers.
Two mixed-integer-linear-programming formulations are developed for the problem. Extensive computational experiments are conducted over instances with up to 100 customers.
The impact over the waiting times of the customers from considering a hybrid transportation system (vehicles and direct allocation) instead of a vehicle-based one (LLRP) is highlighted. The tradeoff between latency and two design parameters related to the coverage range and direct allocation, is analyzed. Furthermore, the effect that the maximum number of depots to open and the capacity of the vehicles has on the latency and on the structure of the solutions is analyzed. Finally, a tradeoff between LLoRP and LoRP is considered within a bi-objective modeling framework that is tackled using the e-constrained method. The structural differences between the optimal solutions of both problems are analyzed.

Keywords

Status: accepted

Back to the list of papers