Periodic capacitated arc-routing problem with inventory constraints

Journal of the Operational Research Society

Volumn 65, Issue 12, 2014, Pages 1840-1852

  Riquelme Rodríguez, Juan Pablo ^a,c   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)

Author keywords

inventory; linear programming; periodic arc routing problem; vehicle routing

Indexed keywords

LINEAR PROGRAMMING; OPEN PIT MINING; VEHICLE ROUTING;

ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; DUST SUPPRESSION; INVENTORY; INVENTORY CONSTRAINTS; INVENTORY DECISIONS; INVENTORY LEVELS; ROUTING DECISIONS;

NETWORK ROUTING;

EID: 84925938293     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2013.159     Document Type: Article

References (16)

1. Belenguer J-M (2007). Departamento de Estadistica e Investigacion Operativa, Universidad de Valencia, http://www.uv.es/belengue/carp. html, accessed 6 July 2012.
2. Cecala A et al (2012). Dust Control Handbook for Industrial Minerals Mining and Processing. (No. RI 9689)National Institute for Occupational Safety and Health. Pittsburgh, PA.
3. Spokane, WA. Chu F, Labadi N and Prins C (2003). Lower bounds for the periodic capacitated arc routing problem. In: 2nd International Workshop on Freight Transportation and Logistics (Odysseus 2003), Palermo, Italy.
4. Chu F, Labadi N and Prins C (2005). Heuristics for the periodic capacitated arc routing problem. Journal of Intelligent Manufacturing 16(2): 243-251.
5. Chu F, Labadi N and Prins C (2006). A scatter search for the periodic capacitated arc routing problem. European Journal of Operational Research 169(2): 586-605.
6. Ghiani G, Musmanno R, Paletta G and Triki C (2005). A heuristic for the periodic rural postman problem. Computers and Operations Research 32(2): 219-228.
7. Golden BL, Dearmon JS and Baker EK (1983). Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10(1): 47-59.
8. Kansou A and Yassine A (2009). Ant colony system for the periodic capacitated arc routing problem. Proceedings of the 2009 International Network Optimization Conference, pp 1-7.
9. Lacomme P, Prins C and Ramdane-Chérif W (2002). Evolutionary algorithms for multiperiod arc routing problems. Proceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based systems (IPMU 2002), ESIA University of Savoie, pp 845-852.
10. Lacomme P, Prins C and Ramdane-Chérif W (2005). Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research 165(2): 535-553.
11. Li J-Q, Mirchandani PB and Knights P (2008). Water truck routing and location of refilling stations in open pit mines. Proceedings of 2008 Australian Mining Technology Conference, Sunshine Coast, Australia, pp 141-156.
12. Marzolf F, Trépanier M and Langevin A (2006). Road network monitoring: Algorithms and a case study. Computers and Operations Research 33(12): 3494-3507.
13. Mei Y, Tang K and Yao X (2011). A memetic algorithm for periodic capacitated arc routing problem. IEEE Transactions on Systems, Man, and Cybernetics Part B-Cybernetics 41(6): 1654-1667.
14. Molina Martínez JM, Martínez Alvarez V, González-Real MM and Baille A (2006). A simulation model for predicting hourly pan evaporation from meteorological data. Journal of Hydrology 318(14): 250-261.
15. Monroy IM, Amaya Guio C and Langevin A (2013). The periodic capacitated arc routing problem with irregular services. Discrete Applied Mathematics 161(4-5): 691-701.
16. Neulicht R and Shular J (1998). Emission factor documentation for AP-42. Section 13.2.2. Unpaved roads. (O.o.A.Q.P.a.Standars, Trans.) Environmental Protection Agency: USA: p 138.