메뉴 건너뛰기
OR Spectrum
Volumn 38, Issue 1, 2016, Pages 175-187
An improved formulation for the multi-depot open vehicle routing problem
Author keywords

Delivery of goods; Mathematical model; Multi depot open vehicle routing problem
Indexed keywords

EID: 84954365332     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-015-0408-9     Document Type: Article
Times cited : (59)
References (16)
  • 1
    • 2342542416 scopus 로고    scopus 로고
    • A tabu search algorithm for the open vehicle routing problem
    • Brandão J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157(3):552–564
    • (2004) Eur J Oper Res , vol.157 , Issue.3 , pp. 552-564
    • Brandão, J.1
  • 2
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.F.1    Gendreau, M.2    Laporte, G.3
  • 3
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91
    • (1959) Manag Sci , vol.6 , pp. 80-91
    • Dantzig, G.B.1    Ramser, J.H.2
  • 4
    • 0002279446 scopus 로고
    • Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints
    • Desrochers M, Laporte G (1991) Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Oper Res Lett 10(1):27–36
    • (1991) Oper Res Lett , vol.10 , Issue.1 , pp. 27-36
    • Desrochers, M.1    Laporte, G.2
  • 5
    • 0004108743 scopus 로고    scopus 로고
    • Logic-based methods for optimization: combining optimization and constraint satisfaction
    • Wiley, New York
    • Hooker J (2011) Logic-based methods for optimization: combining optimization and constraint satisfaction, vol 2. Wiley, New York
    • (2011) vol 2
    • Hooker, J.1
  • 6
    • 2942531043 scopus 로고    scopus 로고
    • A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
    • Kara I, Laporte G, Bektas T (2004) A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Oper Res 158(3):793–795
    • (2004) Eur J Oper Res , vol.158 , Issue.3 , pp. 793-795
    • Kara, I.1    Laporte, G.2    Bektas, T.3
  • 7
    • 36248969139 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the capacitated open vehicle routing problem
    • Letchford A, Lysgaard J, Eglese R (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. J Oper Res Soc 58(12):1642–1651
    • (2007) J Oper Res Soc , vol.58 , Issue.12 , pp. 1642-1651
    • Letchford, A.1    Lysgaard, J.2    Eglese, R.3
  • 8
    • 33847667936 scopus 로고    scopus 로고
    • The open vehicle routing problem: algorithms, large-scale test problems, and computational results
    • Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34(10):2918–2930
    • (2007) Comput Oper Res , vol.34 , Issue.10 , pp. 2918-2930
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 9
    • 85027957945 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the multi-depot open vehicle routing problem
    • Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectr 36(2):401–421
    • (2014) OR Spectr , vol.36 , Issue.2 , pp. 401-421
    • Liu, R.1    Jiang, Z.2    Geng, N.3
  • 10
    • 84945708767 scopus 로고
    • Integer programming formulation of traveling salesman problems
    • Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329
    • (1960) J ACM , vol.7 , Issue.4 , pp. 326-329
    • Miller, C.E.1    Tucker, A.W.2    Zemlin, R.A.3
  • 11
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403–2435
    • (2007) Comput Oper Res , vol.34 , Issue.8 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 12
    • 70349292687 scopus 로고    scopus 로고
    • A hybrid evolution strategy for the open vehicle routing problem
    • Repoussis PP, Tarantilis CD, Bräysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37(3):443–455
    • (2010) Comput Oper Res , vol.37 , Issue.3 , pp. 443-455
    • Repoussis, P.P.1    Tarantilis, C.D.2    Bräysy, O.3    Ioannou, G.4
  • 13
    • 34748916432 scopus 로고    scopus 로고
    • Integrating multi-product production and distribution in newspaper logistics
    • Russell R, Chiang WC, Zepeda D (2008) Integrating multi-product production and distribution in newspaper logistics. Comput Oper Res 35(5):1576–1588
    • (2008) Comput Oper Res , vol.35 , Issue.5 , pp. 1576-1588
    • Russell, R.1    Chiang, W.C.2    Zepeda, D.3
  • 14
    • 0033733928 scopus 로고    scopus 로고
    • A heuristic method for the open vehicle routing problem
    • Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51(5):564–573
    • (2000) J Oper Res Soc , vol.51 , Issue.5 , pp. 564-573
    • Sariklis, D.1    Powell, S.2
  • 15
    • 0019574225 scopus 로고
    • Formulation and structure of more complex/realistic routing and scheduling problems
    • Schrage L (1981) Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11(2):229–232
    • (1981) Networks , vol.11 , Issue.2 , pp. 229-232
    • Schrage, L.1

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