선택한 단어 수는 입니다.
최소 단어 이상 선택하여야 합니다.
최소 단어 이상 선택하여야 합니다.
선택한 단어 수는 30입니다.
최대 10 단어까지만 선택 가능합니다.
최대 10 단어까지만 선택 가능합니다.
제안 방법
- In this paper, an iterative insertion algorithm, and a hybrid meta heuristic combining simulated annealing and tabu search with 2-interchange and a simple move operator are proposed for the TSPTW. Computational tests performed on 97 benchmark problem sets consisting of 400 benchmark problem instances show that the proposed approach generates optimal or near-optimal solutions for all the problems in reasonable computing time.
- The constructive search heuristic is based on an iterative insertion algorithm and the improvement search heuristic is a hybrid meta heuristic combining simulated annealing and tabu search with the randomized selection of a move operator. The proposed approach has generated new best known heuristic values for various problem sets and matched the previous best known solutions for other problem sets. We could set new upper bounds for 17 benchmark problem sets for the TSPTW research community.
- (1995). The proposed approach produces optimal solutions for 25 problem sets out of 27 problem sets and obtains new best known heuristic values for the (150 customers, 60 time window) and (200 customers, 40 time window) problem sets. We observe that there is no significant difference in computation time among the instances with the same number of customers and different time windows, and the computation time grows linearly with respect to the number of customers.
이론/모형
- below. The basic framework of the proposed approach follows a typical simulated annealing (SA) algorithm. Our approach varies from others in using tabu list within SA and using random selection of move operators at each iteration.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.