The use of dynamic programming in genetic algorithms for permutation problems

DOI10.1016/0377-2217(94)00301-7MaRDI QIDQ1268271zbMATH OpenOpenAlexFDO

Authors Mutsunori Yagiura, Toshihide Ibaraki

Publication date 18 October 1998

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)00301-7

zbMATH Keywords

dynamic programminggenetic algorithmsingle machine schedulingtraveling salesmanoptimal linear arrangement

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Multiprogramming genetic algorithm for optimization problems with permutation property
• scientific article; zbMATH DE number 1156604
• Hybrid genetic algorithm for optimization problems with permutation property
• Differential evolution for permutation-based combinatorial problems
• Genetic algorithms applied to problems of forbidden configurations
• A genetic algorithm for the generalised assignment problem
• A genetic algorithm for the generalised assignment problem
• Genetic search and the dynamic layout problem
• scientific article; zbMATH DE number 799253

Cites work

• scientific article; zbMATH DE number 4043771 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Dynamic Programming Approach to Sequencing Problems
• A decomposition algorithm for the single machine total tardiness problem
• A dynamic programming method for single machine scheduling
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Evolution algorithms in combinatorial optimization
• On estimating the number of order ideals in partial orders, with some applications
• Optimal Linear Ordering
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• Solution of large-scale symmetric travelling salesman problems
• Some simplified NP-complete graph problems

Cited in

(13)

• Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
• Hybridizations of evolutionary algorithms with large neighborhood search
• Multiprogramming genetic algorithm for optimization problems with permutation property
• On complexity of optimal recombination for flowshop scheduling problems
• The robust set covering problem with interval data
• Hybrid genetic algorithm for optimization problems with permutation property
• scientific article; zbMATH DE number 4016629 (Why is no real title available?)
• An effective genetic algorithm approach to multiobjective routing problems (MORPs)
• A memetic algorithm for multi-objective dynamic location problems
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
• Evolutionary algorithms and dynamic programming
• scientific article; zbMATH DE number 1156604 (Why is no real title available?)

This page was built for publication: The use of dynamic programming in genetic algorithms for permutation problems

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