Solution to the location-routing problem using a genetic algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F16%3A00301218" target="_blank" >RIV/68407700:21260/16:00301218 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7501016/" target="_blank" >http://ieeexplore.ieee.org/document/7501016/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SCSP.2016.7501016" target="_blank" >10.1109/SCSP.2016.7501016</a>

Result language
angličtina
Original language name
Solution to the location-routing problem using a genetic algorithm
Original language description
In this paper, we focus on solving location-routing problem that belongs to NP-hard problems and that often appears in the optimization of supply chain and distribution systems. The goal of location-routing problem is to determine the location of multiple depots together with vehicle routes such that the total cost of the system is minimal. A genetic algorithm is proposed to solve a deterministic location-routing problem. The representation of individuals together with genetic operators are designed to solve both location and routing part interdependently. Various parameters of genetic algorithm are tested to show their influence on the results and effectiveness of the proposed algorithm.
Czech name
—
Czech description
—

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

Similar results(10)