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

DOI10.1504/IJOR.2011.041347zbMath1254.90183OpenAlexW1985022578MaRDI QIDQ1758842

Zakir Hussain Ahmed

Publication date: 16 November 2012

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2011.041347

zbMATH Keywords

TSPgenetic algorithmstravelling salesman problemNP completemutationsequential constructive crossovermulti-parent crossoverGAsSCXselection survivor

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

A multi-parent genetic algorithm for the quadratic assignment problem ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems

Uses Software

• TSPLIB

This page was built for publication: Multi-parent extension of sequential constructive crossover for the travelling salesman problem