Szczegóły publikacji
Opis bibliograficzny
Cockroach swarm optimization algorithm for travel planning / Joanna KWIECIEŃ, Marek Pasieka // Entropy [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1099-4300. — 2017 — vol. 19 iss. 5 art. no. 213, s. 1–15. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 13–15, Abstr. — Publikacja dostępna online od: 2017-05-06
Autorzy (2)
- AGHKwiecień Joanna
- Pasieka Marek
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 106322 |
|---|---|
| Data dodania do BaDAP | 2017-08-21 |
| Tekst źródłowy | URL |
| DOI | 10.3390/e19050213 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Entropy |
Abstract
In transport planning, one should allow passengers to travel through the complicated transportation scheme with efficient use of different modes of transport. In this paper, we propose the use of a cockroach swarm optimization algorithm for determining paths with the shortest travel time. In our approach, this algorithm has been modified to work with the time-expanded model. Therefore, we present how the algorithm has to be adapted to this model, including correctly creating solutions and defining steps and movement in the search space. By introducing the proposed modifications, we are able to solve journey planning. The results have shown that the performance of our approach, in terms of converging to the best solutions, is satisfactory. Moreover, we have compared our results with Dijkstra’s algorithm and a particle swarm optimization algorithm.