Abstract
Abstract Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
