Scheduling by Genetic Local Search with Multi-Step Crossover
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Improving EAX with restricted 2-opt
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Genetic multi-step search in interpolation and extrapolation domain
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A genetic algorithm for privacy preserving combinatorial optimization
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Analysis of the performance of genetic multi-step search in interpolation and extrapolation domain
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Multiagent optimization system for solving the traveling salesman problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Mega process genetic algorithm using grid MP
LSGRID'04 Proceedings of the First international conference on Life Science Grid
Fast EAX algorithm considering population diversity for traveling salesman problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Multi-step crossover fusion (MSXF) is a promising crossover method using only the neighborhood structure and the distance measure, when heuristic crossovers are hardly introduced. However, MSXF works unsteadily according to the temperature parameter, like as Simulated Annealing. In this paper, we introduce deterministic multi-step crossover fusion (dMSXF) to take this parameter away. Instead of the probabilistic acceptance of MSXF, neighbors are restricted to be closer to the goal solution, the best candidate of them is selected definitely as the next step solution. The performance of dMSXF is tested on 1max problem and Traveling Salesman Problem, and its superiority to conventional methods, e.g. uniform crossover, is shown.