메뉴 건너뛰기




Volumn 64, Issue 2, 2014, Pages 125-139

Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints

Author keywords

Adaptive large neighborhood search; Open pit mine; Periodic capacitated arc routing problem; Vehicle routing

Indexed keywords

COMPLEX NETWORKS; DUST; FLEET OPERATIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MINE TRUCKS; NETWORK ROUTING; OPTIMIZATION; REPAIR; VEHICLE ROUTING; AMPHIBIOUS VEHICLES;

EID: 84940038601     PISSN: 00281522     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.21562     Document Type: Article
Times cited : (16)

References (23)
  • 1
    • 77957088264 scopus 로고
    • Arc routing methods and applications
    • M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Elsevier
    • A. Assad and B.L. Golden, Arc routing methods and applications, in: M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Handbooks in operations research and management science, Elsevier, 1995, Volume 8, pp. 375-483.
    • (1995) Handbooks in Operations Research and Management Science , vol.8 , pp. 375-483
    • Assad, A.1    Golden, B.L.2
  • 3
    • 17444413779 scopus 로고    scopus 로고
    • Heuristics for the periodic capacitated arc routing problem
    • F. Chu, N. Labadi, and C. Prins, Heuristics for the periodic capacitated arc routing problem, J Intell Manuf 16(2005), 243-251.
    • (2005) J Intell Manuf , vol.16 , pp. 243-251
    • Chu, F.1    Labadi, N.2    Prins, C.3
  • 4
    • 25444507229 scopus 로고    scopus 로고
    • A scatter search for the periodic capacitated arc routing problem
    • F. Chu, N. Labadi, and C. Prins, A scatter search for the periodic capacitated arc routing problem, Eur J Oper Res 169(2006), 586-605.
    • (2006) Eur J Oper Res , vol.169 , pp. 586-605
    • Chu, F.1    Labadi, N.2    Prins, C.3
  • 6
    • 84859708266 scopus 로고    scopus 로고
    • The inventoryrouting problem with transshipment
    • L.C. Coelho, J.-F. Cordeau, and G. Laporte, The inventoryrouting problem with transshipment, Comput Oper Res 39(2102), 2537-2548.
    • (2102) Comput Oper Res , vol.39 , pp. 2537-2548
    • Coelho, L.C.1    Cordeau, J.-F.2    Laporte, G.3
  • 7
    • 4544340741 scopus 로고    scopus 로고
    • Aheuristic for the periodic rural postman problem
    • G. Ghiani, R. Musmanno, G. Paletta, and C. Triki, Aheuristic for the periodic rural postman problem, Comput Oper Res 32(2005), 219-228.
    • (2005) Comput Oper Res , vol.32 , pp. 219-228
    • Ghiani, G.1    Musmanno, R.2    Paletta, G.3    Triki, C.4
  • 8
    • 0020543990 scopus 로고
    • Computational experiments with algorithms for a class of routing problems
    • B.L. Golden, J.S. Dearmon, and E.K. Baker, Computational experiments with algorithms for a class of routing problems, Comput Oper Res 10(1983), 47-59.
    • (1983) Comput Oper Res , vol.10 , pp. 47-59
    • Golden, B.L.1    Dearmon, J.S.2    Baker, E.K.3
  • 9
    • 0019609540 scopus 로고
    • Capacitated arc routing problems
    • B.L. Golden and R.T. Wong, Capacitated arc routing problems, Networks 11(1981), 305-315.
    • (1981) Networks , vol.11 , pp. 305-315
    • Golden, B.L.1    Wong, R.T.2
  • 12
    • 13444304063 scopus 로고    scopus 로고
    • Evolutionary algorithms for periodic arc routing problems
    • P. Lacomme, C. Prins, andW. Ramdane-Chérif, Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res 165(2005), 535-553.
    • (2005) Eur J Oper Res , vol.165 , pp. 535-553
    • Lacomme, P.1    Prins, C.2    Ramdane-Chérif, W.3
  • 14
    • 33645138179 scopus 로고    scopus 로고
    • Road network monitoring: Algorithms and a case study
    • F. Marzolf, M. Trépanier, and A. Langevin, Road network monitoring: Algorithms and a case study, Comput Oper Res 33(2006), 3494-3507.
    • (2006) Comput Oper Res , vol.33 , pp. 3494-3507
    • Marzolf, F.1    Trépanier, M.2    Langevin, A.3
  • 15
    • 81955162997 scopus 로고    scopus 로고
    • A memetic algorithm for periodic capacitated arc routing problem
    • Y. Mei, K. Tang, and X. Yao, A memetic algorithm for periodic capacitated arc routing problem, IEEE Trans Syst Man Cybern B Cybern 41(2011), 1654-1667.
    • (2011) IEEE Trans Syst Man Cybern B Cybern , vol.41 , pp. 1654-1667
    • Mei, Y.1    Tang, K.2    Yao, X.3
  • 17
    • 84873414570 scopus 로고    scopus 로고
    • The periodic capacitated arc routing problem with irregular services
    • I.-M. Monroy, C.-A. Amaya, and A. Langevin, The periodic capacitated arc routing problem with irregular services, Discrete Appl Math 161(2013), 691-701.
    • (2013) Discrete Appl Math , vol.161 , pp. 691-701
    • Monroy, I.-M.1    Amaya, C.-A.2    Langevin, A.3
  • 18
    • 84946187231 scopus 로고    scopus 로고
    • section 13.2.2. unpaved roads, Technical report, U.S. Environmental Protection Agency
    • R. Neulicht and J. Shular, Emission factor documentation for ap-42. section 13.2.2. unpaved roads, Technical report, U.S. Environmental Protection Agency, 1998.
    • (1998) Emission Factor Documentation for Ap-42.
    • Neulicht, R.1    Shular, J.2
  • 20
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Sci 40(2006), 455- 472.
    • (2006) Transportation Sci , vol.40 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 21
  • 22
    • 84875926539 scopus 로고    scopus 로고
    • The synchronized arc and node routing problem: Application to road marking
    • M.-A. Salazar-Aguilar, A. Langevin, and G. Laporte, The synchronized arc and node routing problem: Application to road marking, Comput Oper Res 40(2013), 1708-1715.
    • (2013) Comput Oper Res , vol.40 , pp. 1708-1715
    • Salazar-Aguilar, M.-A.1    Langevin, A.2    Laporte, G.3
  • 23
    • 0041874837 scopus 로고    scopus 로고
    • A new local search algorithm providing high quality solutions to vehicle routing problems
    • University of Strathclyde, Glasgow, Scotland, UK
    • P. Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems, APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK, 1997.
    • (1997) APES Group, Dept of Computer Science
    • Shaw, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.