메뉴 건너뛰기
European Journal of Operational Research
Volumn 89, Issue 1, 1996, Pages 108-126
Heuristic algorithm for the asymmetric capacitated vehicle routing problem
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TRANSPORTATION ROUTES;
EID: 0042128680     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00223-8     Document Type: Article
Times cited : (69)
References (18)
  • 3
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke J. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.2
  • 4
    • 0001208905 scopus 로고
    • The Vehicle Routing Problem
    • N. Christofides A. Mingozzi P. Toth The Vehicle Routing Problem N. Christofides A. Mingozzi P. Toth C. Sandi Combinatorial Optimization 1979 Wiley Chichester
    • (1979)
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 5
    • 34250247769 scopus 로고
    • Exact algorithms for the Vehicle Routing Problem based on spanning tree and shortest path relaxations
    • N. Christofies A. Mingozzi P. Toth Exact algorithms for the Vehicle Routing Problem based on spanning tree and shortest path relaxations Mathematical Programming 20 1981 255 282
    • (1981) Mathematical Programming , vol.20 , pp. 255-282
    • Christofies, N.1    Mingozzi, A.2    Toth, P.3
  • 6
    • 0027610023 scopus 로고
    • Polyhedral study of the Capacitated Vehicle Routing Problem
    • G. Cournuejols F. Harche Polyhedral study of the Capacitated Vehicle Routing Problem Mathematical Programming 60 1993 21 52
    • (1993) Mathematical Programming , vol.60 , pp. 21-52
    • Cournuejols, G.1    Harche, F.2
  • 7
    • 0024626213 scopus 로고
    • An additive bounding procedure for combinatorial optimization problems
    • M. Fischetti P. Toth An additive bounding procedure for combinatorial optimization problems Operations Research 37 1989 319 328
    • (1989) Operations Research , vol.37 , pp. 319-328
    • Fischetti, M.1    Toth, P.2
  • 8
    • 0026705963 scopus 로고
    • An additive bounding procedure for the Asymmetric Travelling Salesman Problem
    • M. Fischetti P. Toth An additive bounding procedure for the Asymmetric Travelling Salesman Problem Mathematical Programming 53 1992 173 197
    • (1992) Mathematical Programming , vol.53 , pp. 173-197
    • Fischetti, M.1    Toth, P.2
  • 9
    • 0028508261 scopus 로고
    • A branch and bound algorithm for the Capacitated Vehicle Routing Problem on directed graphs
    • M. Fischetti P. Toth D. Vigo A branch and bound algorithm for the Capacitated Vehicle Routing Problem on directed graphs Operations Research 42 1994 846 859
    • (1994) Operations Research , vol.42 , pp. 846-859
    • Fischetti, M.1    Toth, P.2    Vigo, D.3
  • 10
    • 0019574134 scopus 로고
    • A generalized assignment heuristic for vehicle routing
    • M.L. Fisher R. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 1981 109 124
    • (1981) Networks , vol.11 , pp. 109-124
    • Fisher, M.L.1    Jaikumar, R.2
  • 11
    • 0028461566 scopus 로고
    • Optimal solution of Vehicle Routing Problems using minimum k-trees
    • M.L. Fisher Optimal solution of Vehicle Routing Problems using minimum k-trees Operations Research 42 1994 626 642
    • (1994) Operations Research , vol.42 , pp. 626-642
    • Fisher, M.L.1
  • 12
    • 0022678438 scopus 로고
    • An exact algorithm for the Asymmetrical Capacitated Vehicle Routing Problem
    • G. Laporte H. Mercure Y. Nobert An exact algorithm for the Asymmetrical Capacitated Vehicle Routing Problem Networks 16 1986 33 46
    • (1986) Networks , vol.16 , pp. 33-46
    • Laporte, G.1    Mercure, H.2    Nobert, Y.3
  • 13
    • 0026874435 scopus 로고
    • The Vehicle Routing Problem: An overview of exact and approximate algorithms
    • G. Laporte The Vehicle Routing Problem: An overview of exact and approximate algorithms European Journal of Operational Research 59 1992 345 358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 14
    • 84908780328 scopus 로고
    • Computer solutions to the Travelling Salesman Problem
    • S. Lin Computer solutions to the Travelling Salesman Problem Bell System Technical Journal 44 1965 2245 2269
    • (1965) Bell System Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 15
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the Travelling Salesman Problem
    • S. Lin B.W. Kernighan An effective heuristic algorithm for the Travelling Salesman Problem Operations Research 21 1973 498 516
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 16
    • 0004229857 scopus 로고
    • Knapsack Problems: Algorithms and Computer Implementations
    • S. Martello P. Toth Knapsack Problems: Algorithms and Computer Implementations 1990 Wiley Chichester
    • (1990)
    • Martello, S.1    Toth, P.2
  • 17
    • 0023983080 scopus 로고
    • The savings algorithm for the Vehicle Routing Problem
    • H. Paessens The savings algorithm for the Vehicle Routing Problem European Journal of Operational Research 34 1988 336 344
    • (1988) European Journal of Operational Research , vol.34 , pp. 336-344
    • Paessens, H.1
  • 18
    • 0004063029 scopus 로고
    • Computer aided routing
    • M.W.P. Savelsbergh Computer aided routing Ph.D. Thesis 1988 Centrum voor Wiskunde en Informatica Amsterdam
    • (1988)
    • Savelsbergh, M.W.P.1

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