메뉴 건너뛰기




Volumn 13, Issue , 2013, Pages 63-73

An ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem

Author keywords

Ant colony optimization; Combinatorial optimization problems; Min max objective; Multi Depot Vehicle Routing Problem

Indexed keywords

ALGORITHM'S PERFORMANCE; COMBINATORIAL OPTIMIZATION PROBLEMS; MIN-MAX; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; NONDETERMINISTIC POLYNOMIAL; STATISTICAL EVALUATION; TIME-CRITICAL APPLICATIONS; VEHICLE ROUTING PROBLEMS;

EID: 84889888857     PISSN: 22106502     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.swevo.2013.05.005     Document Type: Article
Times cited : (115)

References (46)
  • 7
    • 0039780231 scopus 로고
    • Multi-Terminal Vehicle-Dispatch Algorithm
    • B.E. Gillett, and J.G. Johnson Multi-Terminal Vehicle-Dispatch Algorithm Omega 4 1976 711 718
    • (1976) Omega , vol.4 , pp. 711-718
    • Gillett, B.E.1    Johnson, J.G.2
  • 8
    • 0007615505 scopus 로고
    • The multiple terminal delivery problem with probabilistic demands
    • F. Tillman The multiple terminal delivery problem with probabilistic demands Transportation Science 3 1969 192 204
    • (1969) Transportation Science , vol.3 , pp. 192-204
    • Tillman, F.1
  • 9
    • 0000474250 scopus 로고
    • A new heuristic for the multidepot vehicle routing problem that improves upon best-known solutions
    • I.M. Chao, B. Golden, and E. Wasil A new heuristic for the multidepot vehicle routing problem that improves upon best-known solutions American Journal of Mathematical and Management Sciences 13 3 1993 371 406
    • (1993) American Journal of Mathematical and Management Sciences , vol.13 , Issue.3 , pp. 371-406
    • Chao, I.M.1    Golden, B.2    Wasil, E.3
  • 10
    • 0024067262 scopus 로고
    • Solving a family of multi-depot vehicle routing and location-routing problems
    • G. Laporte, Y. Nobert, and S. Taillefer Solving a family of multi-depot vehicle routing and location-routing problems Transportation Science 22 3 1988 161 172 (Pubitemid 18654114)
    • (1988) Transportation Science , vol.22 , Issue.3 , pp. 161-172
    • Laporte, G.1    Nobert, Y.2    Taillefer, S.3
  • 11
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • J.F. Cordeau, M. Gendreau, and G. Laporte A Tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 12
    • 27644546617 scopus 로고    scopus 로고
    • Multi-depot vehicle routing problem: A one-stage approach
    • DOI 10.1109/TASE.2005.853472
    • A. Lim, and F. Wang Multiple-depot vehicle routing problem: a one-stage approach IEEE Transactions on Automation Science and Engineering 2 4 2005 397 402 (Pubitemid 41560394)
    • (2005) IEEE Transactions on Automation Science and Engineering , vol.2 , Issue.4 , pp. 397-402
    • Lim, A.1    Wang, F.2
  • 13
    • 0031146838 scopus 로고    scopus 로고
    • An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
    • B.L. Golden, G. Laporte, and E.D. Taillard An adaptive memory heuristic for a class of vehicle routing problems with minmax objective Computers & Operations Research 24 5 1997 445 452
    • (1997) Computers & Operations Research , vol.24 , Issue.5 , pp. 445-452
    • Golden, B.L.1    Laporte, G.2    Taillard, E.D.3
  • 14
    • 33749681871 scopus 로고    scopus 로고
    • Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola
    • DOI 10.1016/j.cor.2005.07.012, PII S030505480500239X
    • V. De Angelis, M. Mecoli, C. Nikoi, and G. Storchi Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola Computers & Operations Research 34 2007 1601 1615 (Pubitemid 44556984)
    • (2007) Computers and Operations Research , vol.34 , Issue.6 SPEC. ISS. , pp. 1601-1615
    • De Angelis, V.1    Mecoli, M.2    Nikoi, C.3    Storchi, G.4
  • 18
    • 80051718076 scopus 로고    scopus 로고
    • Solving min-max vehicle routing problem
    • C. Ren Solving min-max vehicle routing problem Journal of Software 6 9 2011 1851 1856
    • (2011) Journal of Software , vol.6 , Issue.9 , pp. 1851-1856
    • Ren, C.1
  • 19
  • 21
    • 0030759617 scopus 로고    scopus 로고
    • Ant colonies for the travelling salesman problem
    • DOI 10.1016/S0303-2647(97)01708-5, PII S0303264797017085
    • M. Dorigo, and L.M. Gambardella Ant colonies for the travelling salesman problem BioSystems 43 1997 73 81 (Pubitemid 27332279)
    • (1997) BioSystems , vol.43 , Issue.2 , pp. 73-81
    • Dorigo, M.1    Gambardella, L.M.2
  • 22
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • PII S1089778X97033031
    • M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the travelling salesman problem IEEE Transactions on Evolutionary Computation 1 1 1997 53 66 (Pubitemid 127771018)
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 26
    • 84855279197 scopus 로고    scopus 로고
    • The urban bus routing problem in the Tunisian case by the hybrid ant colony algorithm
    • J. Euchi, and R. Mraihi The urban bus routing problem in the Tunisian case by the hybrid ant colony algorithm Swarm and Evolutionary Computation 2 2012 15 24
    • (2012) Swarm and Evolutionary Computation , vol.2 , pp. 15-24
    • Euchi, J.1    Mraihi, R.2
  • 28
    • 9344232811 scopus 로고    scopus 로고
    • Ant colony optimization techniques for the vehicle routing problem
    • John E. Bell, and Patrick R. McMullen Ant colony optimization techniques for the vehicle routing problem Advanced Engineering Informatics 18 2004 41 48
    • (2004) Advanced Engineering Informatics , vol.18 , pp. 41-48
    • Bell, J.E.1    McMullen, P.R.2
  • 30
    • 0012887442 scopus 로고    scopus 로고
    • Swarm intelligence: A whole new way to think about business
    • E. Bonabeau, and C. Meyer Swarm intelligence: a whole new way to think about business Harvard Business Review R0105G 2001 105 114
    • (2001) Harvard Business Review , vol.105 , pp. 105-114
    • Bonabeau, E.1    Meyer, C.2
  • 31
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problem
    • DOI 10.1016/S0305-0548(03)00014-5
    • M. Reimann, K. Doerner, and R. Hartl D-ants: savings based ants divide and conquer the vehicle routing problem Computers & Operations Research 31 4 2004 563 591 (Pubitemid 38098444)
    • (2004) Computers and Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 33
    • 70349871709 scopus 로고    scopus 로고
    • Memetic algorithm with extended neighborhood search for capacitated arc routing problems
    • K. Tang, Y. Mei, and X. Yao Memetic algorithm with extended neighborhood search for capacitated arc routing problems IEEE Transactions on Evolutionary Computation 13 5 2009 1151 1166
    • (2009) IEEE Transactions on Evolutionary Computation , vol.13 , Issue.5 , pp. 1151-1166
    • Tang, K.1    Mei, Y.2    Yao, X.3
  • 36
    • 77956552949 scopus 로고    scopus 로고
    • Finding equitable convex partitions of points in a polygon efficiently
    • 1-19
    • J. Carlsson, B. Armbruster, and Y. Ye Finding equitable convex partitions of points in a polygon efficiently ACM Transactions on Algorithms 6 4 2010 1-19
    • (2010) ACM Transactions on Algorithms , vol.6 , Issue.4
    • Carlsson, J.1    Armbruster, B.2    Ye, Y.3
  • 41
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the TSP
    • S. Lin, and B.W. Kernighan An effective heuristic algorithm for the TSP Operations Research 21 1973 498 516
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 43
    • 79960535211 scopus 로고    scopus 로고
    • A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
    • J. Derrac, S. García, D. Molina, and F. Herrera A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms Swarm and Evolutionary Computation 1 1 2011 3 18
    • (2011) Swarm and Evolutionary Computation , vol.1 , Issue.1 , pp. 3-18
    • Derrac, J.1    García, S.2    Molina, D.3    Herrera, F.4
  • 44
    • 84889879739 scopus 로고    scopus 로고
    • CONCORDE TSP Solver
    • CONCORDE TSP Solver, 〈http://www.tsp.gatech.edu/ concorde.htmlâŒ.
  • 45
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • DOI 10.1287/trsc.1030.0056
    • O. Braysy, and M. Gendreau Vehicle routing problem with time windows, Part I: route construction and local search algorithms Transportation Science 39 1 2005 104 118 (Pubitemid 40466664)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Braysy, O.1    Gendreau, M.2


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