Location arc routing problem with inventory constraints

Computers and Operations Research

Volumn 76, Issue , 2016, Pages 84-94

  Riquelme Rodríguez, Juan Pablo ^a,d   Gamache, Michel ^a,b   Langevin, André ^a,c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b GERAD   (Canada)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^d UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Adaptive large neighborhood search; Location arc routing problem; Periodic capacitated arc routing problem

Indexed keywords

LOCATION; OPEN PIT MINING; OPTIMIZATION; TRANSPORTATION;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; DUST SUPPRESSION; EXCHANGE ALGORITHMS; INVENTORY CONSTRAINTS; ROUTING COSTS; TIME HORIZONS;

NETWORK ROUTING;

EID: 84977597138     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2016.06.012     Document Type: Article

References (28)

1. [1] Amaya, A., Langevin, A., Trépanier, M., The capacitated arc routing problem with refill points. Oper Res Lett 35:1 (2007), 45–53.
2. [2] Chu, F., Labadi, N., Prins, C., Heuristics for the periodic capacitated arc routing problem. J Intell Manuf 16:2 (2005), 243–251.
3. [3] Chu, F., Labadi, N., Prins, C., A scatter search for the periodic capacitated arc routing problem. Eur J Oper Res 169:2 (2006), 586–605.
4. [4] Coelho, L.C., Cordeau, J.-F., Laporte, G., Consistency in multi-vehicle inventory-routing. Transp Res Part C: Emerg Technol 24:0 (2012), 270–287.
5. [5] Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput Oper Res 39:11 (2012), 2537–2548.
6. [6] Del Pia, A., Filippi, C., A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int Trans Oper Res 13:2 (2006), 125–141.
7. [7] Ghiani, G., Laporte, G., Eulerian location problems. Networks 34:4 (1999), 291–302.
8. [8] Ghiani, G., Laporte, G., Location-arc routing problems. OPSEARCH 38:2 (2001), 151–159.
9. [9] Golden, B.L., Wong, R.T., Capacitated arc routing problems. Networks 11:3 (1981), 305–315.
10. [10] Kansou A, Yassine A. Ant colony system for the periodic capacitated arc routing problem. In: The international network optimization conference; 2009.
11. [11] Lacomme, P., Prins, C., Ramdane-Chrif, W., Evolutionary algorithms for periodic arc routing problems. Eur J Oper Res 165:2 (2005), 535–553.
12. [12] Lacomme P, Prins C, Ramdane-Chérif W. Evolutionary algorithms for multiperiod arc routing problems. In: Proceedings of the 9th international conference on information processing and management of uncertainty in knowledge-based systems (IPMU 2002); 2002. p. 845–52.
13. [13] Levy, L., Bodin, L., The arc oriented location routing problem. INFOR 27:1 (1989), 74–94.
14. [14] Li J-Q, Mirchandani P, Knights P. Water truck routing and location of refilling stations in open pit mines. In: Proceedings of 2008 Australian mining technology conference. Sunshine Coast, Australia: The Australian Institute of Mining and Metallurgy; 2008. p. 141–56.
15. [15] 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 20:6 (2013), 795–822.
16. [16] Lopes, R.-B., Plastria, F., Ferreira, C., Santos, B.-S., Location-arc routing problem: heuristic approaches and test instances. Comput Oper Res 43:0 (2014), 309–317.
17. [17] Marzolf, F., Trépanier, M., Langevin, A., Road network monitoring: algorithms and a case study. Comput Oper Res 33:12 (2006), 3494–3507.
18. [18] Molina-Martínez, J.M., Martínez-Alvarez, V., González-Real, M.M., Baille, A., A simulation model for predicting hourly pan evaporation from meteorological data. J Hydrol 318:14 (2006), 250–261.
19. [19] Monroy, I.-M., Amaya, C.-A., Langevin, A., The periodic capacitated arc routing problem with irregular services. Discrete Appl Math 161:4–5 (2013), 691–701.
20. [20] Neulicht R, Shular J. Emission factor documentation for ap-42. section 13.2.2. unpaved roads. Technical report, U.S. Environmental Protection Agency; 1998.
21. [21] Prodhon, C., A hybrid evolutionary algorithm for the periodic location-routing problem. Eur J Oper Res 210:2 (2011), 204–212.
22. [22] Prodhon C, Prins C. A memetic algorithm with population management (MA–PM) for the periodic location-routing problem. In: Lecture notes in computer science, vol. 5296, book section 4. Berlin, Heidelberg: Springer; 2008. p. 43–57.
23. [23] Riquelme-Rodríguez, J.-P., Gamache, M., Langevin, A., Periodic capacitated arc-routing problem with inventory constraints. J Oper Res Soc 65 (2013), 1840–1852.
24. [24] Riquelme-Rodríguez, J.-P., Gamache, M., Langevin, A., Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. Networks 64:2 (2014), 125–139.
25. [25] Ropke, S., Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40:4 (2006), 455–472.
26. [26] Salazar-Aguilar, M.-A., Langevin, A., Laporte, G., Synchronized arc routing for snow plowing operations. Comput Oper Res 39:7 (2012), 1432–1440.
27. [27] Salazar-Aguilar, M.-A., Langevin, A., Laporte, G., The synchronized arc and node routing problem: application to road marking. Comput Oper Res 40:7 (2013), 1708–1715.
28. [28] Thompson, R.-J., Visser, A.-T., The functional design of surface mine haul roads. J S Afr Inst Min Metal 100:3 (2000), 169–180.