Solving the traveling-salesman problem with time windows using tabu search.
Saved in:
| Title: | Solving the traveling-salesman problem with time windows using tabu search. |
|---|---|
| Authors: | Carlton, William B.1, Barnes, J. Wesley1 |
| Source: | IIE Transactions. Aug96, Vol. 28 Issue 8, p617-629. 13p. |
| Subjects: | Traveling salesman problem, Problem solving, Algorithms, Feasibility studies, Decision making |
| Abstract: | This paper presents a robust tabu search approach to the traveling-salesman problem with time windows. The approach uses a two-level tour hashing scheme within a reactive tabu search procedure to detect unique repeated solutions and to promote a more diverse search. Strong feasibility conditions restrict the neighborhood of candidate solutions. The search returns optimal, or near-optimal, solutions within a fraction of the time required by optimal methods. The algorithm's search neighborhood is not restricted to feasible solutions, and superior marginally infeasible solutions are reported to enhance the decision making process. The paper presents computational results for 145 problems from the literature. [ABSTRACT FROM AUTHOR] |
| Copyright of IIE Transactions is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
