Multiprogramming genetic algorithm for optimization problems with permutation property

DOI10.1016/J.AMC.2006.07.067MaRDI QIDQ870194zbMATH OpenOpenAlexFDO

Authors Lining Xing, Yingwu Chen, Xue-Shi Shen

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

zbMATH Keywords

combinatorial optimizationnumerical examplesasymmetric traveling salesman problempermutation propertymultiprogramming genetic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

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.

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A genetic algorithm for the generalised assignment problem
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• A new memetic algorithm for the asymmetric traveling salesman problem
• A user's guide to tabu search
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Cluster based branching for the asymmetric traveling salesman problem
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Genetic algorithm crossover operators for ordering applications
• Hybrid genetic algorithm for optimization problems with permutation property
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The use of dynamic programming in genetic algorithms for permutation problems

Cited in

(2)

• The use of dynamic programming in genetic algorithms for permutation problems
• Hybrid genetic algorithm for optimization problems with permutation property

Describes a project that uses

Uses Software

• Tabu search
• LKH
• TSPLIB

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)