Multi-parent extension of sequential constructive crossover for the travelling salesman problem

Zakir Hussain Ahmed

International Journal of Operational Research, 2011, vol. 11, issue 3, 331-342

Abstract: Crossover operator plays a vital role in genetic algorithms. This paper proposes the multi-parent sequential constructive crossover (MPSCX), which generalises the two-parent sequential constructive crossover (SCX) to a multi-parent crossover for the travelling salesman problem (TSP). Experimental results on five TSPLIB instances show that MPSCX significantly improves SCX by up to 4.60% in average tour value with maximum 4.01% away from the exact optimal solution. Finally, the efficiency of the MPSCX is compared as against multi-parent partially mapped crossover (MPPMX). Experimental results show that the MPSCX is better than the MPPMX.

Keywords: TSP; travelling salesman problem; NP complete; heuristics; GAs; genetic algorithms; multi-parent crossover; SCX; sequential constructive crossover; selection survivor; mutation; crossover operator. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=41347 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:11:y:2011:i:3:p:331-342

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().