Solving TSP by considering processing time: Meta-heuristics and fuzzy approaches |
| |
Authors: | S H Nasseri M H Khaviari |
| |
Institution: | (3) Department of Production Engineering and Management, Decision Support Systems Laboratory, Technical University of Crete, Chania, Greece; |
| |
Abstract: | In this paper, general properties of traveling salesman problem has been illustrated, then a model has been introduced to
minimize Make-span (time interval which all of jobs will be done) with considering sequence-dependence setup times and processing
time. Furthermore, fuzzy sets and its characteristics are applied to a Hard-solvable traveling salesman problem with considering
processing times. As it can be seen, traveling salesman problems are NP-hard, so solving problem in huge dimensions is uncontrollably
manageable and in other side these kinds of problems in real-world are unavoidable, so a local search can prove their importance.
(However this Meta-heuristic methods may not reveal exact optimal solution, but they yield a near-exact optimal solution in
undeniable reduced computational time). Here, some of most famous local searches have been explained in their common and normal
form, which are Genetic Algorithm (GA), Tabu Search (TS), Simulated Annealing (SA), Ant Colony System (ACO). In rest, a comprehensive
comparison through these methods has been shown. This normality in methods structure could help the article to hold no-side-taken
and acceptable judgments. In final, point methods analysis and parameter tuning are held. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|