By Topic

Hybrid genetic algorithm with adaptive local search for precedence-constrained sequencing problems

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

3 Author(s)
YoungSu Yun ; Div. of Bus. Adm., Chosun Univ., Gwangju, South Korea ; Gen, M. ; Chiung Moon

Precedence-constrained sequencing problem (PCSP) is to locate the optimal sequence with the shortest traveling time among all feasible sequences. A number of industrial models for the PCSP have been constructed. This paper proposes a new concept of hybrid genetic algorithm (HGA) with adaptive local search so that the PCSP should be effectively solved. By the use of the adaptive local search, a local search method is adaptively adapted into the genetic algorithm loop. Several types of the PCSP are presented and analyzed to compare the efficiency among the proposed HGA approach and other competing conventional approaches. Finally, it is proved that the proposed HGA approach outperforms the other competing conventional approaches.

Published in:

Computers and Industrial Engineering (CIE), 2010 40th International Conference on

Date of Conference:

25-28 July 2010