Discrete set handling

DOI10.1007/978-3-540-92151-6_7MaRDI QIDQ3649627zbMATH OpenOpenAlexFDO

Authors Ivan Zelinka

Publication date 4 December 2009

Published in Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92151-6_7

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
• Discrete/Binary approach
• Differential evolution for permutation-based combinatorial problems
• Scheduling flow shops using differential evolution algorithm
• Design and applications of discrete evolutionary algorithm based on encoding transformation

Cites work

• A method for solving traveling-salesman problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Analytic programming -- a comparative study
• Benchmarks for basic scheduling problems
• CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
• Credit classification using grammatical evolution
• Genetic programming III. Darwinian invention and problem solving
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1962066 (Why is no real title available?)
• scientific article; zbMATH DE number 4114383 (Why is no real title available?)
• scientific article; zbMATH DE number 1887346 (Why is no real title available?)
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• The traveling-salesman problem

This page was built for publication: Discrete set handling

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