메뉴 건너뛰기
Soft Computing
Volumn 13, Issue 1, 2009, Pages 95-101
A new grouping genetic algorithm approach to the multiple traveling salesperson problem
Author keywords

Constrained optimization; Grouping genetic algorithm; Heuristic; Multiple traveling salesperson problem
Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS;
EID: 50349103500     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-008-0312-1     Document Type: Article
Times cited : (112)
References (12)
  • 1
    • 27744588516 scopus 로고    scopus 로고
    • The multiple traveling salesman problem: An overview of formulations and solution procedures
    • Bektas T (2006) The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega 34:209-219
    • (2006) Omega , vol.34 , pp. 209-219
    • Bektas, T.1
  • 2
    • 34547323441 scopus 로고    scopus 로고
    • A grouping genetic algorithm for the multiple traveling salesperson problem
    • Brown EC, Ragsdale CT, Carter AE (2007) A grouping genetic algorithm for the multiple traveling salesperson problem. Int J Inf Technol Dec Mak 6:333-347
    • (2007) Int J Inf Technol Dec Mak , vol.6 , pp. 333-347
    • Brown, E.C.1    Ragsdale, C.T.2    Carter, A.E.3
  • 3
    • 0036889378 scopus 로고    scopus 로고
    • Scheduling pre-printed newspaper advertising inserts using genetic algorithms
    • Carter AE, Ragsdale CT (2002) Scheduling pre-printed newspaper advertising inserts using genetic algorithms. Omega 30:415-421
    • (2002) Omega , vol.30 , pp. 415-421
    • Carter, A.E.1    Ragsdale, C.T.2
  • 4
    • 33749144475 scopus 로고    scopus 로고
    • A new approach to solving the multiple traveling salesperson problem using genetic algorithms
    • Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur J Oper Res 175:245-257
    • (2006) Eur J Oper Res , vol.175 , pp. 245-257
    • Carter, A.E.1    Ragsdale, C.T.2
  • 5
    • 0030247388 scopus 로고    scopus 로고
    • Genetic algorithms and traveling salesperson problem
    • Chatterjee S, Carrera C, Lynch L (1996) Genetic algorithms and traveling salesperson problem. Eur J Oper Res 93:490-510
    • (1996) Eur J Oper Res , vol.93 , pp. 490-510
    • Chatterjee, S.1    Carrera, C.2    Lynch, L.3
  • 9
    • 0030215149 scopus 로고    scopus 로고
    • A genetic algorithm for service level based vehicle scheduling
    • Malmborg C (1996) A genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93:121-134
    • (1996) Eur J Oper Res , vol.93 , pp. 121-134
    • Malmborg, C.1
  • 10
    • 0035929097 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines
    • Park YB (2001) A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. Int J Prod Econ 73:175-188
    • (2001) Int J Prod Econ , vol.73 , pp. 175-188
    • Park, Y.B.1
  • 11
    • 34547158649 scopus 로고    scopus 로고
    • Two heuristics for the one-dimensional bin-packing problem
    • Singh A, Gupta AK (2007) Two heuristics for the one-dimensional bin-packing problem. OR Spectr 29:765-781
    • (2007) OR Spectr , vol.29 , pp. 765-781
    • Singh, A.1    Gupta, A.K.2
  • 12
    • 0033741404 scopus 로고    scopus 로고
    • A multiple traveling salesman problem model for hot rolling schedule in Shanghai Baoshan Iron & Steel Complex
    • Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling schedule in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124:267-282
    • (2000) Eur J Oper Res , vol.124 , pp. 267-282
    • Tang, L.1    Liu, J.2    Rong, A.3    Yang, Z.4

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