메뉴 건너뛰기




Volumn E81-A, Issue 6, 1998, Pages 1089-1096

Cooperative search based on pheromone communication for vehicle routing problems

Author keywords

Combinatorial optimization problem; Local search algorithm; MultIagent system; Traveling salesman problem; Vehicle routing problem

Indexed keywords

BIOCOMMUNICATIONS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; OPTIMIZATION;

EID: 0032094089     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (11)

References (7)
  • 2
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research 41, pp.421-451, 1993.
    • (1993) Annals of Operations Research , vol.41 , pp. 421-451
    • Osman, I.H.1
  • 4
    • 85148633156 scopus 로고
    • Ant-Q: A reinforcement learning approach to the traveling salesman problem
    • L.M. Gambardella and M. Dorigo, Ant-Q: A reinforcement learning approach to the traveling salesman problem, Proc. ML95, pp.252-260, 1995.
    • (1995) Proc. ML , vol.95 , pp. 252-260
    • Gambardella, L.M.1    Dorigo, M.2
  • 5
    • 0000253432 scopus 로고
    • An investigation of some properties of an "Ant algorithm"
    • A. Colorni, M. Dorigo, and V. Maniezzo, An investigation of some properties of an "Ant algorithm", Parallel Problem Solving from Nature, 2. Elsevier Science Publishers B. V, pp.509-520, 1992.
    • (1992) Parallel Problem Solving from Nature , vol.2 , pp. 509-520
    • Colorni, A.1    Dorigo, M.2    Maniezzo, V.3


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