Non-wrapping order crossover: an order preserving crossover operator that respects absolute position

Authors:
Vincent A. Cicirello
Affiliations:
The Richard Stockton College of New Jersey, Pomona, NJ
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 11
Cited 7

Reducing bias and inefficiency in the selection algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
BPSS: a scheduling support system for the packaging industry

Operations Research
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems

Artificial Intelligence
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A GA-Based Systematic Reasoning Approach for Solving Traveling Salesman Problems Using an Orthogonal Array Crossove

HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics

Journal of Heuristics
Topological crossover for the permutation representation

GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

Computers and Operations Research
Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Solving permutational routing problems by population-based metaheuristics

Computers and Industrial Engineering
Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups

Journal of Intelligent Manufacturing
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine

Computers and Operations Research
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Clock power minimization using structured latch templates and decision tree induction

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator---Non-Wrapping Order Crossover (NWOX)---is a variation of the well-known Order Crossover (OX) operator. It strongly preserves relative order, as does the original OX, but also respects the absolute positions within the parent permutations. This crossover operator is experimentally compared to several other permutation crossover operators on an NP-Hard problem known as weighted tardiness scheduling with sequence-dependent setups. A GA using this NWOX operator finds new best known solutions for several benchmark problem instances and proves to be superior to the previous best performing metaheuristic for the problem.