poster

An evolutionary algorithm for some cases of the single-source constrained plant location problem

Author:

Bryant A. JulstromAuthors Info & Claims

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

Pages 607 - 608

https://doi.org/10.1145/1389095.1389215

Published: 12 July 2008 Publication History

Get Access

Abstract

An evolutionary algorithm for some instances of the single-source capacitated plant location problem encodes candidate solutions in two permutations, one of plant locations and a second of customers, with an integer that indicates the number of open locations. A greedy decoder identifies the solution such a genotype represents, and the EA searches for good solutions using only selection and mutation. In tests on 36 problem instances, the EA is competitive with a recent algorithm, though two superficially promising heuristic extensions do not improve its performance. The results support the general effectiveness of permutation codings in EAs that search for optimum subsets.

References

[1]

M. J. ao Cortinhal and M. E. Captivo. Genetic algorithms for the single source capacitated location problem. In M. G. C. Resende and J. P. de Sousa, editors, Metaheuristics: Computer Decision-Making, pages 187--216. Kluwer, Boston, 2004.

Digital Library

Google Scholar

[2]

J. E. Beasley. Obtaining test problems via Internet. Journal of Global Optimization, 8:429--433, 1996.

Crossref

Google Scholar

Cited By

View all

Soak SLee S(2010)Meta-heuristic Method for the Single Source Capacitated Facility Location ProblemThe Journal of the Korea Contents Association10.5392/JKCA.2010.10.9.10710:9(107-116)Online publication date: 28-Sep-2010
https://doi.org/10.5392/JKCA.2010.10.9.107
Song DPark JLee C(2010)Large Scale Entertainment System based on Gesture Recognition for Learning Chinese Character ContentsThe Journal of the Korea Contents Association10.5392/JKCA.2010.10.9.00110:9(1-8)Online publication date: 28-Sep-2010
https://doi.org/10.5392/JKCA.2010.10.9.001
Julstrom BRothlauf F(2009)String- and permutation-coded genetic algorithms for the static weapon-target assignment problemProceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers10.1145/1570256.1570360(2553-2558)Online publication date: 8-Jul-2009
https://dl.acm.org/doi/10.1145/1570256.1570360

Index Terms

An evolutionary algorithm for some cases of the single-source constrained plant location problem

Recommendations

An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

Graphical abstractDisplay Omitted HighlightsStudies the Single Source Capacitated Facility Location Problem.Develops an iterated tabu search heuristic.Computational results show that this simple heuristic produces high-quality solutions. This paper ...
Hybrid evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems

A theorem characterizing the property of the optimal solution is presented.A hybrid evolutionary algorithm (HEA) is proposed.Extreme machine learning is used to approximate the fitness of most individuals.Two heuristics are incorporated to generate a ...
An algorithm with different exploration mechanisms

We consider the well-known capacitated facility location/network design problem.We study various exploration mechanisms in context of variable neighborhood search.We propose a new method to generate high quality initial solutions in few seconds.Using ...

Comments

Information & Contributors

Information

Published In

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

July 2008

1814 pages

ISBN:9781605581309

DOI:10.1145/1389095

Conference Chair:
Conor Ryan
University of Limerick, Ireland
,
Editor:
Maarten Keijzer
Chordiant Software International B.V., The Netherlands

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GECCO08

Sponsor:

GECCO08: Genetic and Evolutionary Computation Conference

July 12 - 16, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
119
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Soak SLee S(2010)Meta-heuristic Method for the Single Source Capacitated Facility Location ProblemThe Journal of the Korea Contents Association10.5392/JKCA.2010.10.9.10710:9(107-116)Online publication date: 28-Sep-2010
https://doi.org/10.5392/JKCA.2010.10.9.107
Song DPark JLee C(2010)Large Scale Entertainment System based on Gesture Recognition for Learning Chinese Character ContentsThe Journal of the Korea Contents Association10.5392/JKCA.2010.10.9.00110:9(1-8)Online publication date: 28-Sep-2010
https://doi.org/10.5392/JKCA.2010.10.9.001
Julstrom BRothlauf F(2009)String- and permutation-coded genetic algorithms for the static weapon-target assignment problemProceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers10.1145/1570256.1570360(2553-2558)Online publication date: 8-Jul-2009
https://dl.acm.org/doi/10.1145/1570256.1570360

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

Hybrid evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems

An algorithm with different exploration mechanisms

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations