TY - JOUR
T1 - Omnichannel logistics network design with integrated customer preference for deliveries and returns
AU - Guerrero-Lorente, Javier
AU - Gabor, Adriana F.
AU - Ponce-Cueto, Eva
N1 - Funding Information:
We thank Guillaume Crognier from École Polytechnique Paris, France, for his help with the computational experiments and insightful comments on the paper and to dr. Edgar Blanco for many insightful discussions on the topic. This publication is based upon work supported by the Khalifa University of Science and Technology under Award No. RC2 DSO and Grant 874000218, and United Arab Emirates University under Grant 31B065.
Funding Information:
We thank Guillaume Crognier from École Polytechnique Paris, France, for his help with the computational experiments and insightful comments on the paper and to dr. Edgar Blanco for many insightful discussions on the topic. This publication is based upon work supported by the Khalifa University of Science and Technology under Award No. RC2 DSO and Grant 874000218 , and United Arab Emirates University under Grant 31B065 .
Publisher Copyright:
© 2020 Elsevier Ltd
PY - 2020/6
Y1 - 2020/6
N2 - This paper proposes a mixed integer program (MIP) for the network design problem of a parcel carrier that manages online orders from omnichannel retailers. The network includes several types of facilities, such as city distribution centers, intermediary depots, parcel offices, as well as collect channel points, such as automated parcel stations (APS), stores or kiosks. The model formulation takes into account the influence of these collection points on consumer choice and the maximum distance customers are willing to walk to reach them. Realistic transportation costs are also considered, including detailed long haul costs and delivery costs in an area. The transportation costs inside an area are estimated via the Continuous Approximation proposed by Newell (1971) and Newell (1973), which results in a simpler problem than a location-routing problem, however, at the cost of losing linearity. For a special case of the problem, we propose a heuristic that, in our experimental setting, is on average 42.5 faster than the overall MIP and gives solutions within 1.02% of the optimum. Finally, we use the model to discuss the network design of a Spanish parcel carrier operating in Madrid.
AB - This paper proposes a mixed integer program (MIP) for the network design problem of a parcel carrier that manages online orders from omnichannel retailers. The network includes several types of facilities, such as city distribution centers, intermediary depots, parcel offices, as well as collect channel points, such as automated parcel stations (APS), stores or kiosks. The model formulation takes into account the influence of these collection points on consumer choice and the maximum distance customers are willing to walk to reach them. Realistic transportation costs are also considered, including detailed long haul costs and delivery costs in an area. The transportation costs inside an area are estimated via the Continuous Approximation proposed by Newell (1971) and Newell (1973), which results in a simpler problem than a location-routing problem, however, at the cost of losing linearity. For a special case of the problem, we propose a heuristic that, in our experimental setting, is on average 42.5 faster than the overall MIP and gives solutions within 1.02% of the optimum. Finally, we use the model to discuss the network design of a Spanish parcel carrier operating in Madrid.
KW - Customer preference
KW - E-commerce
KW - Network design
KW - Omnichannel logistics
KW - Returns
UR - https://www.scopus.com/pages/publications/85083901152
U2 - 10.1016/j.cie.2020.106433
DO - 10.1016/j.cie.2020.106433
M3 - Article
AN - SCOPUS:85083901152
SN - 0360-8352
VL - 144
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
M1 - 106433
ER -