A new GA based solution for capacitated multi source Weber problem Nazila Mohammadi

DOI

10.2991/ijcis.2010.3.5.1How to use a DOI?

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.

Copyright

© 2010, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Nazila Mohammadi
AU  - Mohammad Reza Malek
AU  - Ali Asghar Alesheikh
PY  - 2010
DA  - 2010/10/01
TI  - A new GA based solution for capacitated multi source Weber problem Nazila Mohammadi
JO  - International Journal of Computational Intelligence Systems
SP  - 514
EP  - 521
VL  - 3
IS  - 5
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.2010.3.5.1
DO  - 10.2991/ijcis.2010.3.5.1
ID  - Mohammadi2010
ER  -