Abstract
The main purpose of any facility location is to select the optimal places that satisfy project's goals. In location problems, the object is usually to optimize a function - objective function - that defines the problem conditions and efficient decision parameters. Numerous methods are proposed to challenge the location facility issues. In this paper, we consider a class of location/allocation problem that can assume more realistic conditions in real-life applications. This problem is an extension to the well-known capacitated multi source Weber problem. A new method that uses two genetic algorithms is used to solve the problem efficiently. The first, External GA, solves the location problem while the second, Internal GA, solves the allocation problem. A case study was designed to assess the feasibility of the proposed solution. The results indicate that the new approach is optimal, efficient and successful.
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 callMore From: International Journal of Computational Intelligence 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.
