By Topic

A New Hybrid Genetic Algorithm for the Stochastic Loader Problem

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
$33 $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)
Wang Hong ; Shandong Institute of Light Industry, China ; Pei-xin Zhao

In 2004, Tang proposed a new NP-hard combinational optimization problem that frequently arises in practice - The Loader Problem. Two special cases of the problem (the restricted loader problem and the equal loader problem) and optimal solution strategy have been considered. In this paper, we extend Tang's model by proposing the stochastic quantity of load and unload at each station that make the model more applicable in practice. For finding the optimal solutions, we present a new hybrid genetic algorithm that combines self-adapting crossover and stochastic mutation operators. Comparing with the basic genetic algorithm, this improved algorithm adequately utilizes the adaptability information of current individuals and has better convergence efficiency and higher solution precision. Two numerical examples illustrate the validity and efficiency of the new hybrid genetic algorithm.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on  (Volume:1 )

Date of Conference:

July 30 2007-Aug. 1 2007