Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A fusion of crossover and local search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yamada, T. ; NTT Commun. Sci. Labs., Kyoto, Japan ; Nakano, R.

It is well known that genetic algorithms (GAs) are not well suited for fine-tuning structures that are very close to optimal solutions and that it is essential to incorporate local search methods, such as neighborhood search, into GAs. This paper explores the use of a new GA operator, called multi-step crossover fusion (MSXF), which combines a crossover operator with a neighborhood search algorithm. MSXF performs a local search essentially in the region within the search space between parent solutions to find a locally optimal solution that inherits the parents' characteristics. GA/MSXF was applied to-job-shop scheduling problem. Experiments using benchmark problems show promising GA/MSXF performance even with a small population

Published in:

Industrial Technology, 1996. (ICIT '96), Proceedings of The IEEE International Conference on

Date of Conference:

2-6 Dec 1996