Evolutionary operators for the Hamiltonian completion problem

DOI10.1007/S00500-020-05063-8MaRDI QIDQ2156924zbMATH OpenOpenAlexFDO

Authors Krunoslav Puljić, Robert Manger

Publication date 21 July 2022

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-020-05063-8

zbMATH Keywords

crossoverevolutionary algorithmevolutionary operatorHamiltonian completionmutationtraveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Comparison of eight evolutionary crossover operators for the vehicle routing problem
• Evolving test instances of the Hamiltonian completion problem
• Evolution algorithms in combinatorial optimization
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

Cites work

• (1,2)-Hamiltonian completion on a matching
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• A lower bound on the Hamiltonian path completion number of a line graph
• Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry
• Combinatorial algorithms on a class of graphs
• Combinatorial optimization. Theory and algorithms.
• Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
• Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
• Graphs, networks and algorithms.
• Hamiltonian completions of sparse random graphs
• scientific article; zbMATH DE number 4104744 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• scientific article; zbMATH DE number 1439412 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Introduction to evolutionary computing
• Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint)
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
• Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
• Setup coordination between two stages of a production system: a multi-objective evolutionary approach
• The approximability of the weighted Hamiltonian path completion problem on a tree
• The total interval number of a tree and the Hamiltonian completion number of its line graph
• The traveling salesman problem and its variations.
• The Turán number for spanning linear forests

Cited in

(1)

• Evolving test instances of the Hamiltonian completion problem

This page was built for publication: Evolutionary operators for the Hamiltonian completion problem

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