Urban distribution is regard as a time- and labor-consuming logistics activity which is critical to the residents’ daily life and municipal administration. To address this challenging practical problem, a novel multi-objective location-routing problem with simultaneous pickup and delivery is proposed. The problem seeks to minimize distribution operation cost and maximize service level by constructing a more effective logistics network. In the problem formulation, two types of delivery service modes and a fuzzy satisfaction function are use to describe the characteristics of urban distribution in real world application. To solve this specific problem, a hybrid heuristic algorithm combining tabu search and efficient procedures is presented. Through evaluating the effects of time window and service mode, and comparing heuristics performance on solving problem instances, the experimental results demonstrate the validity of the proposed model formulation and heuristic approach.
ZhouL., WangX., NiL. and LinY., Location-routing problem with simultaneous home delivery and customer’s pickup for city distribution of online shopping purchases, Sustainability8(8) (2016), 828–908.
2.
WangX., ZhanL., RuanJ. and ZhangJ., How to choose “Last Mile” delivery modes for E-fulfillment, Mathematical Problems in Engineering2014 (2014), 417129, 1–10.
3.
LinJ.-R. and LeiH.-C., Distribution systems design with two-level routing considerations, Annals of Operations Research172(1) (2009), 329–347.
4.
PonboonS., QureshiA.G. and TaniguchiE., Branch-and-price algorithm for the location-routing problem with time windows, Transportation Research Part E: Logistics and Transportation Review86(2) (2016), 1–9.
5.
GovindanK., JafarianA., KhodaverdiR. and DevikaK., Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food, International Journal of Production Economics152(6) (2014), 9–28.
6.
KaraoglanI., AltiparmakF., KaraI. and DengizB., The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach, Omega40(4) (2012), 465–477.
7.
YuV.F. and LinS.-W., Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery, Applied Soft Computing24(6) (2014), 284–290.
8.
GuerreroW.J., ProdhonC., VelascoN. and AmayaC.A., Hybrid heuristic for the inventory location-routing problem with deterministic demand, International Journal of Production Economics146(1) (2013), 359–370.
9.
TangJ., JiS. and JiangL., The Design of a sustainable location-routing-inventory model considering consumer environmental beavihor, Sustainability8(3) (2016), 211–231.
10.
RahmaniY., Cherif-KhettafW. and OulamaraA., The two-echelon multi-products location-routing problem with pickup and delivery: Formulation and heuristic approaches, International Journal of Production Research54(4) (2015), 999–1019.
11.
ContardoC., HemmelmayrV. and CrainicT.-G., Lower and upper bounds for the two-echelon capacitated location-routing problem, Computers & Operations Research39(12) (2012), 3185–3199.
12.
NguyenV.-P., PrinsC. and ProdhonC., Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking, European Journal of Operational Research216(1) (2012), 113–126.
13.
LaporteG., NobertY. and ArpinD., An exact algorithm for solving a capacitated location-routing problem, Annals of Operations Research6(9), 293–310.
14.
BergerR.-T., CoullardC.-R. and DaskinM.-S., Location-routing problems with distance constraints, Transportation Science41(1) (2007), 29–43.
15.
MinH., Consolidation terminal location-allocation and consolidated routing problems, Journal of Business Logistics17(2) (1996), 235–263.
16.
SchwardtM. and DethloffJ., Solving a continuous location-routing problem by use of a self-organizing map, International Journal of Physical Distribution and Logistics Management35(6) (2005), 390–408.
17.
HansenP.-H., HegedahlB., HjortkjaerS. and ObelB., A heuristic solution to the warehouse location-routing problem, European Journal of Operational Research76(1) (1994), 111–127.
18.
WuT.-U., LowC. and BaiJ.-W., Heuristic solutions to multi-depot location-routing problems, Computers and Operations Research29(10) (2002), 1393–1415.
19.
NagyG. and SalhiS., Nested heuristic methods for the location-routing problem, Journal of the Operational Research Society47(9) (1996), 1166–1174.
20.
LinC.-K.-Y., ChowC.-K. and ChenA., A location-routing-loading problem for bill delivery services, Computers & Industrial Engineering43(1) (2002), 5–25.
21.
ArdjmandE., WeckmanG.-R., ParkN. and SinghM., Applying genetic algorithm to a new location and routing model of hazardous materials, International Journal of Production Research53(3) (2014), 916–928.
22.
YuV.-F., LinS.-W., LeeW. and TingC.-J., A simulated annealing heuristic for the capacitated location-routing problem, Computers & Industrial Engineering58(2) (2010), 288–299.
23.
TuzunD. and BurkeL.-I., A two-phase tabu search approach to the location routing problem, European Journal of Operational Research116(1) (1999), 87–99.
24.
TingC.-J. and ChenC.-H., A multiple any colony optimization algorithm for the capacitated location routing problem, International Journal of Production Economics141(1) (2013), 34–44.
25.
EscobarJ.-W., LinfatiR., BaldoquinM.-G. and TothP., A Granular variable neighborhood search for the capacitated location-routing problem, Transportation Research Part B: Methodological67(9) (2014), 344–356.
26.
MinH., JayaramanV. and SrivastavaR., Combined location-routing problems: A synthesis and future research directions, European Journal of Operational Research108(1) (1998), 1–15.
27.
NagyG. and SalhiS., Location-routing: Issues, models and methods, European Journal of Operational Research177(2) (2007), 649–672.
28.
ProdhonC. and PrinsC., A survey of recent research on location-routing problems, European Journal of Operational Research238(1) (2014), 1–17.
29.
KaraoglanI., AltiparmakF., KaraI. and DengizB., A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, European Journal of Operational Research13(3), 318–332.
30.
KritikosM.-N. and IoannouG., The heterogeneous fleet vehicle routing problem with overloads and time window, International Journal of Production Economics144(1) (2013), 68–75.
31.
LoannouG., KritikosM. and PrastacosG., A greedy look-ahead heuristic for the vehicle routing problem with time windows, Journal of the Operational Research Society52(5) (2001), 523–537.
32.
ChengR., GenM. and TozawaT., Vehicle routing problem with fuzzy due-time using genetic algorithms, Japan Society for Fuzzy Theory and Systems7(5) (1995), 1050–1061.
33.
SrinivasN. and DebK., Multiobjective optimization using nondominated sorting in genetic algorithms, IEEE Transactions on Evolutionary Computation2(3) (1994), 221–248.
34.
DethloffJ., Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pickup, OR Spektrum23(1) (2001), 79–96.
35.
SalhiS. and NagyG., A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the Operational Research55(10) (1999), 1034–1042.
36.
LinC.-K.Y. and KwokR.C.W., Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, European Journal of Operational Research175(3) (2006), 1833–1849.
37.
YilmazA.E. and AktasS., Ridit and exponential type scores for estimating the kappa statistic, Kuwait Journal of Science45(1) (2018), 89–99.
38.
KalaivaniN., El-MaghrabiA.I., SaravanakumarD. and Sai Sundara KrishnanG., Operation-compact spaces, regular spaces and normal spaces with –open sets in topological spaces, Journal of Interdisciplinary Mathematics20(2) (2017), 427–441.
39.
Zhao-BingC., Guan-NanL., Xing-YangL. and Xin-YuL., The structure form layout and installation design about car-based photonics mast, Journal of Discrete Mathematical Sciences & Cryptography20(1) (2017), 231–238.
40.
ImamM.H., TasadduqI.A., AhmadA. and AldosariF., Obtaining ABET student outcome satisfaction from course learning outcome data using fuzzy logic, Eurasia Journal of Mathematics Science and Technology Education13(7) (2017), 3069–3081.
41.
GaoW., FarahaniM.R., AslamA. and HosamaniS., Distance learning techniques for ontology similarity measuring and ontology mapping, Cluster Computing-The Journal of Networks Software Tools and Applications20(2SI) (2017), 959–968.
42.
SiL. and QiaoH., Performance of Financial Expenditure in China’s basic science and math education: Panel Data Analysis Based on CCR Model and BBC Model, Eurasia Journal of Mathematics Science and Technology Education13(8) (2017), 5217–5224.
43.
BortolanM.C. and RiveroF., Non-autonomous perturbations of a non-classical non-autonomous parabolic equation with subcritical nonlinearity, Applied Mathematics and Nonlinear Sciences2 (2017), 31–60.
