Variant of partially mapped crossover for the travelling salesman problems Report as inadecuate




Variant of partially mapped crossover for the travelling salesman problems - Download this document for free, or read online. Document in PDF available to download.

Hadush Mebrahtu ;International Journal of Combinatorial Optimization Problems and Informatics 2012, 3 1

Author: Kusum Deep

Source: http://www.redalyc.org/articulo.oa?id=265224466006


Teaser



International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Deep, Kusum; Mebrahtu, Hadush Variant of partially mapped crossover for the Travelling Salesman problems International Journal of Combinatorial Optimization Problems and Informatics, vol.
3, núm.
1, eneroabril, 2012, pp.
47-69 International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: http:--www.redalyc.org-articulo.oa?id=265224466006 How to cite Complete issue More information about this article Journals homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative © International Journal of Combinatorial Optimization Problems and Informatics, Vol.
3, No.
1, Jan-April 2012, pp.
47-69.
ISSN: 2007-1558. Variant of partially mapped crossover for the Travelling Salesman problems Kusum Deep, Hadush Mebrahtu Department of Mathematics, Indian Institute of Technology, Roorkee, India kusumfma@iitr.ernet.in, hhadumk@gmail.com Abstract.
In this paper a variant of partially mapped crossover (VPMX) is designed using cut point positions and is tested for its performance with the existing partially mapped crossover (PMX).In order to test the performance ,two mutation operators are used.
These mutation operators are inverted displacement and inversion mutations.
Partially mapped crossover (PMX) with inversion and with inverted displacement and a variant of partially mapped crossover (VPMX) with inversion and with inverted displacement are programmed in C and implemented on a set of ten benchmark problems taken from the Travelling salesman problem library (TSPLIB).
The results indicate that the designed variant of PMX is superior by showing a better performance in eight instances i...





Related documents