Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG42__%2F14%3A00519227" target="_blank" >RIV/60162694:G42__/14:00519227 - isvavai.cz</a>

Výsledek na webu

<a href="http://vavtest.unob.cz/registr" target="_blank" >http://vavtest.unob.cz/registr</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows

Popis výsledku v původním jazyce

The Multi-Depot Vehicle Routing Problem with Time Windows (MDVRP-TW) is a well-known optimization problem with many practical applications in a wide range of domains. The prima-ry goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the origi-nal depot after visiting all customers along its route. Each vehicle can visit a customer only dur-ing its particular predefined time window. Also the condition of maximum vehicles? load has to be met. There are many heuristic and metaheuristic algorithms proposed for this problem solu-tion (e.g. tabu search, simulated annealing, genetic algorithms) as this is a NP-hard problem and, therefore, exact methods are not feasible for more complex solutions. Another possibility is to apply the Ant Colony Optimization (ACO) theory to this problem. The authors successfully managed to adapt the ACO algorithm for the MDVRP-TW problem.

Název v anglickém jazyce

Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows

Popis výsledku anglicky

The Multi-Depot Vehicle Routing Problem with Time Windows (MDVRP-TW) is a well-known optimization problem with many practical applications in a wide range of domains. The prima-ry goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the origi-nal depot after visiting all customers along its route. Each vehicle can visit a customer only dur-ing its particular predefined time window. Also the condition of maximum vehicles? load has to be met. There are many heuristic and metaheuristic algorithms proposed for this problem solu-tion (e.g. tabu search, simulated annealing, genetic algorithms) as this is a NP-hard problem and, therefore, exact methods are not feasible for more complex solutions. Another possibility is to apply the Ant Colony Optimization (ACO) theory to this problem. The authors successfully managed to adapt the ACO algorithm for the MDVRP-TW problem.

Druh

D - Stať ve sborníku

CEP obor

KA - Vojenství

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název statě ve sborníku

International Conference on Engineering and Applied Sciences Optimization (OPT-i 2014)

ISBN

978-960-99994-5-8

ISSN

2241-9098

e-ISSN

—

Počet stran výsledku

9

Strana od-do

1-9

Název nakladatele

National Technical University of Athens

Místo vydání

Kos Island, Řecko

Místo konání akce

Kos Island, Řecko

Datum konání akce

1. 1. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—