Abstract
In this paper, we present a genetic algorithm with spanning tree representation for solving bicriteria fixed charge transportation problem. First we consider the fixed charge transportation problem with 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 one of the dynamic scalind which considers normalizing for the different data from the bicriteria region. The proposed genetic algorithm can be found the Pareto optimal solutions in the bicriteria space. Computational results will show the performance of the spanning tree-based genetic algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Japan Society for Fuzzy Theory and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
