ASERC -- a genetic sequencing operator for asymmetric permutation problems

DOI10.1007/3-540-45486-1_17MaRDI QIDQ2766726zbMATH OpenFDO

Authors Kay C. Wiese, Scott D. Goodwin, Sivakumar Nagarajan

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45486-1_17

zbMATH Keywords

combinatorial optimizationconstrained ordering problemsevolutionary computationgenetic algorithmsgenetic sequencing operatorssearchselection strategies

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
• Genetic algorithms and traveling salesman problems
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Genetic algorithm crossover operators for ordering applications
• Solving traveling salesman problems by genetic algorithms

Cited in

(1)

• scientific article; zbMATH DE number 4104743 (Why is no real title available?)

This page was built for publication: ASERC -- a genetic sequencing operator for asymmetric permutation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766726)