Publikace UTB
Repozitář publikační činnosti UTB
Discrete self organising migrating algorithm for the task of capacitated vehicle routing problem
Repozitář DSpace/Manakin
Kontaktujte nás | Jazyk: čeština English
- Domovská stránka DSpace
- →
- Článek ve sborníku
- →
- Fakulta aplikované informatiky
- →
- Zobrazit záznam
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.title | Discrete self organising migrating algorithm for the task of capacitated vehicle routing problem | en |
| dc.contributor.author | Davendra, Donald David | |
| dc.contributor.author | Zelinka, Ivan | |
| dc.contributor.author | Bialic-Davendra, Magdalena Lucyna | |
| dc.contributor.author | Šenkeřík, Roman | |
| dc.contributor.author | Jašek, Roman | |
| dc.relation.ispartof | MENDEL 2011 | |
| dc.identifier.issn | 1803-3814 Scopus Sources, Sherpa/RoMEO, JCR | |
| dc.identifier.isbn | 978-80-214-4302-0 | |
| dc.date.issued | 2011 | |
| dc.citation.spage | 259 | |
| dc.citation.epage | 265 | |
| dc.event.title | 17th International Conference on Soft Computing: Evolutionary Computation, Genetic Programming, Fuzzy Logic, Rough Sets, Neural Networks, Fractals, Bayesian Methods, MENDEL 2011 | |
| dc.event.location | Brno | |
| utb.event.state-en | Czech Republic | |
| utb.event.state-cs | Česká republika | |
| dc.event.sdate | 2011-06-15 | |
| dc.event.edate | 2011-06-17 | |
| dc.type | conferenceObject | |
| dc.language.iso | en | |
| dc.publisher | Brno University of Technology | |
| dc.subject | Evolutionary algorithms | en |
| dc.subject | Logistics | en |
| dc.subject | Self organising migrating algorithm | en |
| dc.subject | Vehicle routing problem | en |
| dc.description.abstract | 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. | en |
| utb.faculty | Faculty of Applied Informatics | |
| dc.identifier.uri | http://hdl.handle.net/10563/1004890 | |
| utb.identifier.obdid | 43866684 | |
| utb.identifier.scopus | 2-s2.0-84904191143 | |
| utb.identifier.wok | 000302647900041 | |
| utb.source | d-scopus | |
| dc.date.accessioned | 2015-06-04T12:55:53Z | |
| dc.date.available | 2015-06-04T12:55:53Z | |
| utb.contributor.internalauthor | Bialic-Davendra, Magdalena Lucyna | |
| utb.contributor.internalauthor | Šenkeřík, Roman | |
| utb.contributor.internalauthor | Jašek, Roman |
