Multiprogramming genetic algorithm for optimization problems with permutation property
From MaRDI portal
Publication:870194
DOI10.1016/J.AMC.2006.07.067zbMATH Open1107.65323OpenAlexW2007236504MaRDI QIDQ870194FDOQ870194
Yingwu Chen, Xue-Shi Shen, Lining Xing
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.067
Recommendations
- Hybrid genetic algorithm for optimization problems with permutation property
- The use of dynamic programming in genetic algorithms for permutation problems
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- scientific article; zbMATH DE number 1734134
- Improved genetic algorithm for the permutation flowshop scheduling problem.
combinatorial optimizationnumerical examplesasymmetric traveling salesman problempermutation propertymultiprogramming genetic algorithm
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A user's guide to tabu search
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Title not available (Why is that?)
- A new memetic algorithm for the asymmetric traveling salesman problem
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Title not available (Why is that?)
- A genetic algorithm for the generalised assignment problem
- The use of dynamic programming in genetic algorithms for permutation problems
- Genetic algorithm crossover operators for ordering applications
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- Cluster based branching for the asymmetric traveling salesman problem
- Hybrid genetic algorithm for optimization problems with permutation property
Cited In (2)
Uses Software
This page was built for publication: Multiprogramming genetic algorithm for optimization problems with permutation property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870194)