메뉴 건너뛰기




Volumn , Issue , 2006, Pages 349-354

Speeding up sequential simulated annealing by parallelization

Author keywords

Bicriterion optimization; Parallel simulated annealing; Vehicle routing problem with time windows

Indexed keywords

BICRITERION OPTIMIZATION; COMPUTATION TIME; NP-HARD; NUMBER OF VEHICLES; PARALLEL PROCESS; PARALLEL SIMULATED ANNEALING; PARALLELIZATIONS; QUALITY OF SOLUTION; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

EID: 45749110882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PARELEC.2006.74     Document Type: Conference Paper
Times cited : (5)

References (6)
  • 6
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon, M.M., Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research 35, (1987), 254-265, see also http://w.cba.neu.edu /~msolomon/problems.htm.
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1


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