Multiprogramming genetic algorithm for optimization problems with permutation property

DOI10.1016/j.amc.2006.07.067zbMath1107.65323OpenAlexW2007236504MaRDI QIDQ870194

Ying-Wu Chen, Xue-Shi Shen, Li-Ning 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

zbMATH Keywords

numerical examplescombinatorial optimizationasymmetric traveling salesman problempermutation propertymultiprogramming genetic algorithm

Mathematics Subject Classification ID

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

Uses Software

• TSPLIB
• LKH
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of dynamic programming in genetic algorithms for permutation problems
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Genetic algorithm crossover operators for ordering applications
• A genetic algorithm for the generalised assignment problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A new memetic algorithm for the asymmetric traveling salesman problem
• Cluster based branching for the asymmetric traveling salesman problem
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• Hybrid genetic algorithm for optimization problems with permutation property
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• A user's guide to tabu search
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Genetic Algorithms and Random Keys for Sequencing and Optimization

This page was built for publication: Multiprogramming genetic algorithm for optimization problems with permutation property