Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

DOI10.1016/J.COR.2006.12.009MaRDI QIDQ2475838zbMATH OpenOpenAlexFDO

Authors F. Neumann

Publication date 11 March 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.12.009

zbMATH Keywords

combinatorial optimizationEulerian cyclesevolutionary computationsexpected optimization time

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Evolutionary computation in combinatorial optimization
• Evolutionary algorithms and matroid optimization problems
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• scientific article; zbMATH DE number 1696516
• scientific article; zbMATH DE number 6019547

Cites work

• scientific article; zbMATH DE number 1703887 (Why is no real title available?)
• scientific article; zbMATH DE number 50596 (Why is no real title available?)
• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• scientific article; zbMATH DE number 1391176 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• On the analysis of the \((1+1)\) evolutionary algorithm
• STACS 2005

Cited in

(19)

• Comparison of simple diversity mechanisms on plateau functions
• Evolutionary operators for the Hamiltonian completion problem
• Towards a runtime comparison of natural and artificial evolution
• Number of cycles in evolutionary operation
• scientific article; zbMATH DE number 1696516 (Why is no real title available?)
• scientific article; zbMATH DE number 6019547 (Why is no real title available?)
• Analysis of speedups in parallel evolutionary algorithms and (1 + ) EAs for combinatorial optimization
• scientific article; zbMATH DE number 1784942 (Why is no real title available?)
• Time complexity analysis of RLS and (1+1) EA for the edge coloring problem
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Runtime analysis for permutation-based evolutionary algorithms
• Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
• Evolutionary algorithms and dynamic programming
• Fourier analysis meets runtime analysis: precise runtimes on plateaus
• Experimental and theoretical analysis of local search optimising OBDD variable orderings
• Tight runtime bounds for evolutionary algorithms on sorting and crossing minimisation for layered graph drawings
• Plateaus can be harder in multi-objective optimization
• Analysis of evolutionary algorithms for the longest common subsequence problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

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