최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기대한산업공학회지 = Journal of the Korean Institute of Industrial Engineers, v.33 no.1, 2007년, pp.86 - 98
This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a sim...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Calvo, R. W. (2000), A new heuristic for the traveling salesman problem with time windows, Transportation Science, 34(1), 113-124
Carlton, W. B. and Barnes, J. W. (1996), Solving the traveling salesman problem with time windows using tabu search, IIE Transactions, 28, 617-629
Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. M. (1995), An optimal algorithm for the traveling salesman problem with time windows, Operations Research, 43(2), 367-371
Gendreau, M., Hertz, A. and Laporte, G. (1992), New insertion and postoptimization procedures for the traveling salesman problem, Operations Research, 40(6), 1086-1094
Gendreau, M., Hertz, A. and Laporte, G. and Stan, M. (1998), A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research, 46(3), 330-335
Langevin, A., Desrochers, M., Desrosiers, J., Gelinas, S. and ?Soumis, F. (1993), A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows, Networks, 23, 631-640
Nanry, W. P. and Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B, 34, 107-121
Ohlmann, J. W. and Thomas, B. W. (2006), A compressed annealing approach to the traveling salesman problem with time windows, INFORMS Journal on Computing (to appear)
Or, I. (1976), Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Blood Banking.Ph.D. Dissertation, Dept. of Industrial Engineering and Management Sciences, Northwestern University
Potvin, J. Y. and Bengio, S. (1996), The vehicle routing problem with time windows. II. genetic search, INFORMS Journal on Computing, 8, 165-172
Savelsbergh, M. W. P. (1985), Local search in routing problems with time windows, Annals of Operations Research, 4, 285-305
Solomon, M. M. (1987), Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research, 35(2), 254-265
Taillard, E. D., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J. Y. (1997), A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science, 31(1),170-186
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.