메뉴 건너뛰기





Volumn 14, Issue 7, 2004, Pages 631-637

Solving constrained traveling salesman problems by genetic algorithms

Author keywords

Constrained traveling salesman problem; Fixed end; Genetic algorithm; Hamiltonian path; Open route

Indexed keywords

PROBLEM SOLVING; TRAFFIC CONTROL; TRAVELING SALESMAN PROBLEM;

EID: 5644253415     PISSN: 10020071     EISSN: None     Source Type: Journal    
DOI: 10.1080/10020070412331344061     Document Type: Article
Times cited : (4)

References (7)
  • Reference 정보가 존재하지 않습니다.

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