메뉴 건너뛰기




Volumn , Issue , 2001, Pages 103-107

A single-phase method based on evolution calculation for vehicle routing problem

Author keywords

Evolution Calculation; Time Windows; Vehicle Routing Problem

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

EID: 1442270957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIMA.2001.970451     Document Type: Conference Paper
Times cited : (4)

References (7)
  • 1
  • 3
    • 0002167931 scopus 로고
    • An adaptive clustering method using a geometric shape for vehicle routing problems with time windows
    • Thangiah, S. R., An adaptive clustering method using a geometric shape for vehicle routing problems with time windows, Proceedings of ICGA 6, pp. 536-543, 1995.
    • (1995) Proceedings of ICGA 6 , pp. 536-543
    • Thangiah, S.R.1
  • 4
    • 0001080956 scopus 로고
    • Improvement heuristics for the vehicle routing problem based on simulated annealing
    • Van Breedam, A., Improvement heuristics for the vehicle routing problem based on simulated annealing, European Journal of Operational Research, 86, pp. 480-490, 1995.
    • (1995) European Journal of Operational Research , vol.86 , pp. 480-490
    • Van Breedam, A.1
  • 5
    • 84908780328 scopus 로고
    • Computer solutions of the traveling salesman problem
    • Lin, S., Computer solutions of the traveling salesman problem, Bell System Technical Journal, 44, 2245-2269, 1965.
    • (1965) Bell System Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1


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