The use of dynamic programming in genetic algorithms for permutation problems

Article Abstract:

A genetic algorithm variant called genetic DP which uses dynamic programming is proposed to obtain new generation solutions in the genetic algorithms. Genetic DP has been applied to the single machine scheduling, optimal linear arrangement and traveling salesman problems to test its effectiveness. Genetic DP provides better solutions than multi-start local search and genetic local search algorithm when a sufficiently long time is allocated.

Usage, Dynamic programming

---

A tabu search approach to the constraint satisfaction problem as a general problem solver

Article Abstract:

A tabu search-based algorithm for the constraint satisfaction problem is proposed as general problem solver. Computational results reveal that the algorithm generate optimal solutions to various problems selected from a wide range of applications that include graph coloring, generalized assignment, set covering, timetabling and nurse scheduling.

Operations Research, Models, Combinatorial enumeration problems

---

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

Article Abstract:

Research is presented describing the study of scheduling problems where three-machines are in use in order to utilize time and supplies to their full potential and maximize profits.

Industrial efficiency, Economic efficiency, Permutations

Similar abstracts:

• Abstracts: Heuristics and exact algorithms for solving the Monden problem. Exact and heuristic algorithms for data sets reconstruction
• Abstracts: The effect of monetary policy on industrial performance. Demergers. Recycling and waste management
• Abstracts: Pseudo-invexity and duality in nonlinear programming. Symmetric duality with pseudo-invexity in variational problems
• Abstracts: Layout designs in cellular manufacturing. Quantitative and qualitative indices for the plant layout evaluation problem
• Abstracts: Nonparametric repair-limit replacement policies with imperfect repair. Optimal solutions for the machining economics problem with stochastically distributed tool lives

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.