The use of dynamic programming in genetic algorithms for permutation problems
DOI10.1016/0377-2217(94)00301-7zbMATH Open0912.90242OpenAlexW2067677003MaRDI QIDQ1268271FDOQ1268271
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
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
dynamic programminggenetic algorithmsingle machine schedulingtraveling salesmanoptimal linear arrangement
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Dynamic Programming Approach to Sequencing Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A dynamic programming method for single machine scheduling
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A decomposition algorithm for the single machine total tardiness problem
- Optimal Linear Ordering
- Solution of large-scale symmetric travelling salesman problems
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Title not available (Why is that?)
- Evolution algorithms in combinatorial optimization
- Single Machine Scheduling with Precedence Constraints of Dimension 2
- On estimating the number of order ideals in partial orders, with some applications
Cited In (13)
- Hybridizations of evolutionary algorithms with large neighborhood search
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- Multiprogramming genetic algorithm for optimization problems with permutation property
- On complexity of optimal recombination for flowshop scheduling problems
- Title not available (Why is that?)
- The robust set covering problem with interval data
- Hybrid genetic algorithm for optimization problems with permutation property
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- A memetic algorithm for multi-objective dynamic location problems
- Evolutionary algorithms and dynamic programming
- Title not available (Why is that?)
- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
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)
