Discrete Self Organising Migrating Algorithm For The Task Of Capacitated Vehicle Routing Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F11%3A43866563" target="_blank" >RIV/70883521:28140/11:43866563 - isvavai.cz</a>
Alternative codes found
RIV/70883521:28120/11:43866563 RIV/61989100:27240/11:86080756
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Discrete Self Organising Migrating Algorithm For The Task Of Capacitated Vehicle Routing Problem
Original language description
A discrete self organising migrating algorithm is introduced and described in this paper. The generic algorithm is modified with novel jump sequences which is incorporated with the 2 OPT local search. The capacitated vehicle routing problem is solved using this algorithm. The challenging Taillard benchmark problem sets is used as the problem set with promising results obtained.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MENDEL 2011 17th International Conference on Soft Computing
ISBN
978-80-214-4302-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
259-265
Publisher name
VUT Brno
Place of publication
Brno
Event location
Brno
Event date
Jun 15, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—