Cockroach Swarm Optimization Algorithm for Travel Planning
AbstractIn 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. View Full-Text
Share & Cite This Article
Kwiecień, J.; Pasieka, M. Cockroach Swarm Optimization Algorithm for Travel Planning. Entropy 2017, 19, 213.
Kwiecień J, Pasieka M. Cockroach Swarm Optimization Algorithm for Travel Planning. Entropy. 2017; 19(5):213.Chicago/Turabian Style
Kwiecień, Joanna; Pasieka, Marek. 2017. "Cockroach Swarm Optimization Algorithm for Travel Planning." Entropy 19, no. 5: 213.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.