A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem

S. Salhi () and M.D.H. Gamal ()

Annals of Operations Research, 2003, vol. 123, issue 1, 203-222

Abstract: A GA-based approach is introduced to address the continuous location–allocation problem. Selection and removal procedures based on groups of chromosomes instead of individual chromosomes are put forward and specific crossover and mutation operators that rely on the impact of the genes are proposed. A new operator that injects once in a while new chromosomes into the population is also introduced. This provides diversity within the search and attempts to avoid early convergence. This approach is tested on existing data sets using several runs to evaluate the robustness of the proposed GA approach. Copyright Kluwer Academic Publishers 2003

Keywords: GA heuristic; location; continuous space (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1026131531250 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:123:y:2003:i:1:p:203-222:10.1023/a:1026131531250

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1026131531250

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().