The use of dynamic programming in genetic algorithms for permutation problems

DOI10.1016/0377-2217(94)00301-7zbMath0912.90242OpenAlexW2067677003MaRDI QIDQ1268271

Toshihide Ibaraki, Mutsunori Yagiura

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 programmingtraveling salesmangenetic algorithmsingle machine schedulingoptimal 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)

Related Items (9)

Hybrid genetic algorithm for optimization problems with permutation property ⋮ Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder ⋮ On complexity of optimal recombination for flowshop scheduling problems ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ The robust set covering problem with interval data ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem ⋮ A memetic algorithm for multi-objective dynamic location problems

Cites Work

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

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