Volume 2, Issue 4 (10-2012)
IJOCE 2012, 2(4): 607-619 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Rajabi Bahaabadi M, Shariat Mohaymany A, Babaei M. AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM. IJOCE 2012; 2 (4) :607-619
URL: http://ijoce.iust.ac.ir/article-1-115-en.html
URL: http://ijoce.iust.ac.ir/article-1-115-en.html
Abstract: (20592 Views)
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover operator is presented that has the capability of generating solutions based on a logical reasoning. In other words, the solution space is explored by the proposed method purposefully. Numerical results based on 26 benchmark instances demonstrate the efficiency of the proposed method compared with the previous meta-heuristic methods.
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
