Location-routing problem with simultaneous home delivery and customer's pickup for city distribution of online shopping purchases

Sustainability (Switzerland)

Volumn 8, Issue 8, 2016, Pages

  Zhou, Lin ^a   Wang, Xu ^a   Ni, Lin ^a   Lin, Yun ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Genetic algorithm; Location routing problem; Simultaneous home delivery and customer's pickup

Indexed keywords

DISTRIBUTION SYSTEM; ELECTRONIC COMMERCE; GENETIC ALGORITHM; INTERNET; LOCATION DECISION; SERVICE PROVISION; SHOPPING ACTIVITY; SUPPLY CHAIN MANAGEMENT;

EID: 84983740462     PISSN: None     EISSN: 20711050     Source Type: Journal    
DOI: 10.3390/su8080828     Document Type: Article

References (52)

1. China's E-Commerce Report 2015. Available online: http://finance.ifeng.com/a/20160629/14541580_0. shtml (accessed on 29 June 2016). (In Chinese)
2. Gevaers, R.; Van de Voorde, E.; Vanelslander, T. Characteristics of innovations in last-mile logistics-Using best practices, case studies and making the link with green and sustainable logistics. In Proceedings of the European Transport Conference, Noordwijkerhout, The Netherlands, 5-7 October 2009.
3. Esper, T.L.; Jensen, T.D.; Turnipseed, F.L.; Burton, S. The last mile: An examination of effects of online retail delivery strategies on consumers. J. Bus. Logist. 2003, 24, 177-203.
4. Aized, T.; Srai, J.S. Hierarchical modelling of Last Mile logistic distribution system. Int. J. Adv. Manuf. Technol. 2014, 70, 1053-1061.
5. Wang, X.; Zhan, L.; Ruan, J.; Zhang, J. How to choose "Last Mile" delivery modes for E-fulfillment. Math. Probl. Eng. 2014, 2014, 417129.
6. Agatz, N.A.; Fleischmann, M.; Van Nunen, J.A. E-fulfillment and multi-channel distribution-A review. Eur. J. Oper. Res. 2008, 187, 339-356.
7. Gevaers, R.; Van de Voorde, E.; Vanelslander, T. Cost Modelling and Simulation of Last-mile Characteristics in an Innovative B2C Supply Chain Environment with Implications on Urban Areas and Cities. Procedia Soc. Behav. Sci. 2014, 125, 398-411.
8. Boyer, K.K.; Prud'homme, A.M.; Chung, W. The last mile challenge: Evaluating the effects of customer density and delivery window patterns. J. Bus. Logist. 2009, 30, 185-201.
9. Hayel, Y.; Quadri, D.; Jiménez, T.; Brotcorne, L. Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers. Ann. Oper. Res. 2016, 239, 451-469.
10. Lopes, R.B.; Ferreira, C.; Santos, B.S.; Barreto, S. A taxonomical analysis, current methods and objectives on location-routing problems. Int. Trans. Oper. Res. 2013, 20, 795-822.
11. Prodhon, C.; Prins, C. A survey of recent research on location-routing problems. Eur. J. Oper. Res. 2014, 238, 1-17.
12. Drexl, M.; Schneider, M. A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 2015, 241, 283-308.
13. Vincent, F.Y.; Lin, S.-Y. A simulated annealing heuristic for the open location-routing problem. Comput. Oper. Res. 2015, 62, 184-196.
14. Ponboon, S.; Qureshi, A.G.; Taniguchi, E. Branch-and-price algorithm for the location-routing problem with time windows. Transp. Res. E Logist. Transp. Rev. 2016, 86, 1-19.
15. Govindan, K.; Jafarian, A.; Khodaverdi, R.; Devika, K. Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 2014, 152, 9-28.
16. Wang, H.; Du, L.; Ma, S. Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transp. Res. E Logist. Transp. Rev. 2014, 69, 160-179.
17. Stenger, A.; Schneider, M.; Schwind, M.; Vigo, D. Location routing for small package shippers with subcontracting options. Int. J. Prod. Econ. 2012, 140, 702-712.
18. Karaoglan, I.; Altiparmak, F.; Kara, I.; Dengiz, B. The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega 2012, 40, 465-477.
19. Rieck, J.; Ehrenberg, C.; Zimmermann, J. Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery. Eur. J. Oper. Res. 2014, 236, 863-878.
20. Rahmani, Y.; Cherif-Khettaf, W.R.; Oulamara, A. A local search approach for the two-echelon multi-products location-routing problem with pickup and delivery. IFAC-PapersOnLine 2015, 48, 193-199.
21. Vincent, F.Y.; Lin, S.-W. Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Appl. Soft Comput. 2014, 24, 284-290.
22. Rahmani, Y.; Ramdane Cherif-Khettaf, W.; Oulamara, A. The two-echelon multi-products location-routing problem with pickup and delivery: Formulation and heuristic approaches. Int. J. Prod. Res. 2015, 54, 1-21.
23. Gianessi, P.; Alfandari, L.; Létocart, L.; Wolfler Calvo, R. The multicommodity-ring location routing problem. Transp. Sci. 2015, 50, 541-558.
24. Prodhon, C.; Prins, C. A memetic algorithm with population management (MA|PM) for the periodic location-routing problem. In Hybrid Metaheuristics; Springer: Berlin, Germany, 2008; pp. 43-57.
25. Klibi, W.; Lasalle, F.; Martel, A.; Ichoua, S. The stochastic multiperiod location transportation problem. Transp. Sci. 2010, 44, 221-237.
26. Guerrero, W.J.; Prodhon, C.; Velasco, N.; Amaya, C.A. Hybrid heuristic for the inventory location-routing problem with deterministic demand. Int. J. Prod. Econ. 2013, 146, 359-370.
27. Rath, S.; Gutjahr, W.J. A math-heuristic for the warehouse location-routing problem in disaster relief. Comput. Oper. Res. 2014, 42, 25-39.
28. Tang, J.; Ji, S.; Jiang, L. The Design of a sustainable location-routing-inventory model considering consumer environmental behavior. Sustainability 2016, 8, 211.
29. Contardo, C.; Hemmelmayr, V.; Crainic, T.G. Lower and upper bounds for the two-echelon capacitated location-routing problem. Comput. Oper. Res. 2012, 39, 3185-3199.
30. Nguyen, V.-P.; Prins, C.; Prodhon, C. Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 2012, 216, 113-126.
31. Nguyen, V.-P.; Prins, C.; Prodhon, C. A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng. Appl. Artif. Intell. 2012, 25, 56-71.
32. Ting, C.-J.; Chen, C.-H. A multiple ant colony optimization algorithm for the capacitated location routing problem. Int. J. Prod. Econ. 2013, 141, 34-44.
33. Ardjmand, E.; Weckman, G.; Park, N.; Taherkhani, P.; Singh, M. Applying genetic algorithm to a new location and routing model of hazardous materials. Int. J. Prod. Res. 2015, 53, 916-928.
34. Ardjmand, E.; Young, W.A.; Weckman, G.R.; Bajgiran, O.S.; Aminipour, B.; Park, N. Applying genetic algorithm to a new bi-objective stochastic model for transportation, location, and allocation of hazardous materials. Expert Syst. Appl. 2016, 51, 49-58.
35. Vincent, F.Y.; Lin, S.-W.; Lee, W.; Ting, C.-J. A simulated annealing heuristic for the capacitated location routing problem. Comput. Ind. Eng. 2010, 58, 288-299.
36. Duhamel, C.; Lacomme, P.; Prins, C.; Prodhon, C. A GRASP× ELS approach for the capacitated locationrouting problem. Comput. Oper. Res. 2010, 37, 1912-1923.
37. Escobar, J.W.; Linfati, R.; Toth, P. A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res. 2013, 40, 70-79.
38. Escobar, J.W.; Linfati, R.; Baldoquin, M.G.; Toth, P. A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem. Transp. Res. B Methodol. 2014, 67, 344-356.
39. Prins, C.; Prodhon, C.; Calvo, R.W. A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In Evolutionary Computation in Combinatorial Optimization, Proceedings of the 6th European Conference, EvoCOP 2006, Budapest, Hungary, 10-12 April 2006; Springer: Berlin, Germany, 2006; pp. 183-194.
40. Derbel, H.; Jarboui, B.; Hanafi, S.; Chabchoub, H. Genetic algorithm with iterated local search for solving a location-routing problem. Expert. Syst. Appl. 2012, 39, 2865-2871.
41. Montoya-Torres, J. R.; López Franco, J.; Nieto Isaza, S.; Felizzola Jiménez, H.; Herazo-Padilla, N. A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 2015, 79, 115-129.
42. Marinakis, Y.; Marinaki, M. A bilevel genetic algorithm for a real life location routing problem. Int. J. Logist. Res. Appl. 2008, 11, 49-65.
43. Lopes, R.B.; Ferreira, C.; Santos, B.S. A simple and effective evolutionary algorithm for the capacitated location-routing problem. Comput. Oper. Res. 2016, 70, 155-162.
44. Lin, S.; Kernighan, B.W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 1973, 21, 498-516.
45. Prins, C. A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 2004, 31, 1985-2002.
46. Vidal, T.; Crainic, T.G.; Gendreau, M.; Lahrichi, N.; Rei, W. A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 2012, 60, 611-624.
47. Ahmadizar, F.; Zeynivand, M.; Arkat, J. Two-level vehicle routing with cross-docking in a three-echelon supply chain: A genetic algorithm approach. Appl. Math. Model. 2015, 39, 7065-7081.
48. Toth, P.; Vigo, D. The granular tabu search and its application to the vehicle-routing problem. Inf. J. Comput. 2003, 15, 333-346.
49. Prins, C.; Prodhon, C.; Calvo, R.W. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 2006, 4, 221-238.
50. Prins, C.; Prodhon, C.; Ruiz, A.; Soriano, P.; Wolfler Calvo, R. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp. Sci. 2007, 41, 470-483.
51. Hemmelmayr, V.C.; Cordeau, J.-F.; Crainic, T.G. An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 2012, 39, 3215-3228.
52. Contardo, C.; Cordeau, J.-F.; Gendron, B. An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J. Comput. 2013, 26, 88-102.