By Topic

Spanning tree-based genetic algorithm for the bicriteria fixed charge transportation 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)
M. Gen ; Dept. of Ind. & Inf. Syst. Eng., Ashikaga Inst. of Technol., Japan ; Yinzhen Li

In this paper, we present a genetic algorithm with a spanning tree representation for solving the bicriteria fixed charge transportation problem. First we consider the fixed charge transportation problem with a single objective function by the spanning tree-based genetic algorithm, and then extend this GA approach to solve the bicriteria problem. Due to the bicriteria program, the fitness function is constructed by dynamic scaling which normalizes the different data from the bicriteria region. The proposed genetic algorithm can find Pareto optimal solutions in the bicriteria space. Computational results will show the performance of the spanning tree-based genetic algorithm

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference: