By Topic

Iterated Local Search with Guided Mutation

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)
Qingfu Zhang ; Univ. of Essex, Colchester ; Jianyong Sun

Guided mutation uses the idea of estimation of distribution algorithms to improve conventional mutation operators. It combines global statistical information and the location information of good individual solutions for generating new trial solutions. This paper suggests using guided mutation in iterative local search. An experimental comparison between a conventional iterated local search (CILS) and an iterated local search with guided mutation has been conducted on four classes of the test instances of the quadratic assignment problem.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

0-0 0