New genetic algorithm for the p-median problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86097111" target="_blank" >RIV/61989100:27240/14:86097111 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/14:86097111
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-319-07773-4_4" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-07773-4_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-07773-4_4" target="_blank" >10.1007/978-3-319-07773-4_4</a>

Result language
angličtina
Original language name
New genetic algorithm for the p-median problem
Original language description
The p-median problem is a well-known combinatorial optimization problem with several possible formulations and many practical applications in areas such as operational research and planning. It has been also used as a testbed for heuristic and metaheuristic optimization algorithms. This work proposes a new genetic algorithm for the p-median problem and evaluates it in a series of computational experiments.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Advances in Intelligent Systems and Computing. Volume 298
ISBN
978-3-319-07772-7
ISSN
2194-5357
e-ISSN
—
Number of pages
10
Pages from-to
35-44
Publisher name
Springer
Place of publication
New York
Event location
Shenzhen
Event date
Jun 13, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)