메뉴 건너뛰기




Volumn , Issue , 2014, Pages 184-192

Ant colony optimization algorithm for Multi-Depot Vehicle Routing Problem with Time Windows

Author keywords

Ant colony optimization; Multi Depot Vehicle Routing Problem with Time Windows; Nature inspired algorithm

Indexed keywords

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NETWORK ROUTING; ROUTING ALGORITHMS; SALES; SIMULATED ANNEALING; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

EID: 84911874217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 1
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • G.B. Dantzig, J. H. Ramser, The Truck Dispatching Problem. Management Science, 6(1), 80-91, 1959.
    • (1959) Management Science , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.B.1    Ramser, J.H.2
  • 3
    • 84908022413 scopus 로고    scopus 로고
    • University of Malaga, Spain, Accessed 18 December 2013
    • NEO Web: Networking and Emerging Optimization. University of Malaga, Spain. http://neo.lcc.uma.es/vrp/vrp-instances/multiple-depot-vrp-with-time-windows-instances/ Accessed 18 December 2013.
    • Networking and Emerging Optimization
  • 5
    • 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(3), 345-358, 1992.
    • (1992) European Journal of Operational Research , vol.59 , Issue.3 , pp. 345-358
    • Laporte, G.1
  • 6
    • 0039780231 scopus 로고
    • Multi-terminal vehicle-dispatch algorithm
    • B.E. Gillett, J.G. Johnson, Multi-terminal Vehicle-dispatch Algorithm. Omega, 4(6), 711-718, 1976.
    • (1976) Omega , vol.4 , Issue.6 , pp. 711-718
    • Gillett, B.E.1    Johnson, J.G.2
  • 7
    • 0000474250 scopus 로고
    • A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions
    • M.I. Chao, B.L. Golden, E. Wasil, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-known Solutions. American Journal of Mathematical and Management Sciences, 13(3-4), 371-406, 1993.
    • (1993) American Journal of Mathematical and Management Sciences , vol.13 , Issue.3-4 , pp. 371-406
    • Chao, M.I.1    Golden, B.L.2    Wasil, E.3
  • 8
    • 0030109346 scopus 로고    scopus 로고
    • A tabu search heuristic for the multi-depot vehicle routing problem
    • J. Renaud, G. Laporte, F.F. Boctor, A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem. Computers & Operations Research, 23(3), 229-235, 1996.
    • (1996) Computers & Operations Research , vol.23 , Issue.3 , pp. 229-235
    • Renaud, J.1    Laporte, G.2    Boctor, F.F.3
  • 9
    • 14844361815 scopus 로고    scopus 로고
    • A variable neighborhood search for the multi depot vehicle routing problem with time windows
    • M. Polacek, R.F. Hartl, K. Doerner, AVariable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. Journal of Heuristics, 10, 613-627, 2004.
    • (2004) Journal of Heuristics , vol.10 , pp. 613-627
    • Polacek, M.1    Hartl, R.F.2    Doerner, K.3
  • 10
    • 84875452823 scopus 로고    scopus 로고
    • An approach to solve the Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) in static and dynamic scenarios
    • T. Timmermann, R. Schumann, An approach to solve the Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) in static and dynamic scenarios. In Workshop Planen, Scheduling und Konfigurieren, Entwerfen, 2008.
    • (2008) Workshop Planen, Scheduling und Konfigurieren, Entwerfen
    • Timmermann, T.1    Schumann, R.2
  • 11
    • 2442505839 scopus 로고    scopus 로고
    • An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
    • J.F. Cordeau, G. Laporte, A. Mercier, An Improved Tabu Search Algorithm for the Handling of Route Duration Constraints in Vehicle Routing Problems with Time Windows. The Journal of the Operational Research Society, 55, 542-546, 2004.
    • (2004) The Journal of the Operational Research Society , vol.55 , pp. 542-546
    • Cordeau, J.F.1    Laporte, G.2    Mercier, A.3
  • 12
    • 84866177726 scopus 로고    scopus 로고
    • A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows
    • T. Vidal, et at., A Hybrid Genetic Algorithm with Adaptive Diversity Management for a Large Class of Vehicle Routing Problems with Time Windows. Computers & Operations Research, 40(1), 2013. 191
    • (2013) Computers & Operations Research , vol.40 , Issue.1 , pp. 191
    • Vidal, T.1
  • 14
    • 78149273283 scopus 로고    scopus 로고
    • Ant colony algorithm for multiple-depot vehicle routing problem with shortest finish time
    • Jianhua Ma, Jie Yuan, Ant Colony Algorithm for Multiple-Depot Vehicle Routing Problem with Shortest Finish Time. Communications in Computer and Information Science, 113, 114-123, 2010.
    • (2010) Communications in Computer and Information Science , vol.113 , pp. 114-123
    • Jianhua, M.A.1    Yuan, J.2
  • 16
    • 63849122990 scopus 로고    scopus 로고
    • Combination of multiple ant colony system and simulated annealing for the multidepot vehicle-routing problem with time windows
    • Ching-Jung Ting, Chia-Ho Chen, Combination of Multiple Ant Colony System and Simulated Annealing for the Multidepot Vehicle-Routing Problem with Time Windows. Transportation Research Record: Journal of the Transportation Research Board, 2089, 85-92, 2008.
    • (2008) Transportation Research Record: Journal of the Transportation Research Board , vol.2089 , pp. 85-92
    • Ting, C.-J.1    Chen, C.-H.2
  • 17
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke, J.W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4), 568-581, 1964.
    • (1964) Operations Research , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 19
    • 81255157199 scopus 로고    scopus 로고
    • A tool for decision making in k-out-of-n system maintenance
    • Zurich: Trans Tech Publication
    • Z. Vintr, D. Vališ, A Tool for Decision Making in k-out-of-n System Maintenance. In Applied Mechanics and Materials, vol. 110-116, Zurich: Trans Tech Publication, 5257-5264, 2012.
    • (2012) Applied Mechanics and Materials , vol.110-116 , pp. 5257-5264
    • Vintr, Z.1    Vališ, D.2
  • 21
    • 84855800273 scopus 로고    scopus 로고
    • On approaches for non-direct determination of system deterioration
    • D. Vališ, M. Koucký, L. Žák, On approaches for non-direct determination of system deterioration. Maintenance and Reliability, 14(1), 33-41, 2012.
    • (2012) Maintenance and Reliability , vol.14 , Issue.1 , pp. 33-41
    • Vališ, D.1    Koucký, M.2    Žák, L.3


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