RT journal article
T1 The p-median problem with upgrading of transportation costs and minimum travel time allocation
A1 Espejo Miranda, Inmaculada
A1 Marín, Alfredo
A2 Estadística e Investigación Operativa
K1 Bi-network
K1 Integer programming
K1 p-median
K1 Upgrading
AB In this paper, we analyse the upgrading of arcs in the p-median problem on a bi-network. Both travel times and transportation costs are associated with each arc. Our goal consists of simultaneously finding p medians, allocating each node to the median of minimum travel time and distributing a known budget among the arcs of the network to reduce their transportation cost, in order to minimise the total transportation cost of the system. The problem is motivated by the warehouse-to-locker structure of the distribution networks of many ecommerce businesses. We formulate it in two different ways as an integer programming problem, derive some properties of any optimal solution, develop valid inequalities and present computational results.
PB Elsevier
SN 0305-0548
YR 2023
FD 2023-07-14
LK http://hdl.handle.net/10498/31350
UL http://hdl.handle.net/10498/31350
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026