Genetic Algorithm for the Continuous Location-Routing Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F19%3A00332245" target="_blank" >RIV/68407700:21260/19:00332245 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.14311/NNW.2019.29.012" target="_blank" >https://doi.org/10.14311/NNW.2019.29.012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14311/NNW.2019.29.012" target="_blank" >10.14311/NNW.2019.29.012</a>

Result language
angličtina
Original language name
Genetic Algorithm for the Continuous Location-Routing Problem
Original language description
This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

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

Similar results(10)