Abstract
It may be observed that supermarket chain companies invest in special buses to deliver customers directly to a given store. The companies expect a tool which allows to design the routes of buses in order to minimize costs (maximize profits). The objective of this paper is to present the created computer experimentation system (simulator) with the designed and implemented algorithms to determine the optimal bus route for customers. The bus route problem was divided into two stages. At the first stage, the three designed heuristic algorithms called Most Occupied, High Gain Neighbor, and Cut the Worst are responsible for selection (choosing) of the location of bus stops. At the second stage, the five algorithms allow to determine a route between previously chosen stops. These algorithms are based on approaches from so-called Artificial Intelligence area: Simulated Annealing (SA), Taboo Search (TS), Genetic Search (GS), and Ant Colony (AC) as well as on the simple ideas like Random Search (RS). In the paper, the results of the investigations made with the created experimentation system are presented, concerning an adjustment of the parameters of any algorithm, and a comparison of the algorithm’s efficiency on both stages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Grossman, D.A., Frieder, O.: Algorithms and Heuristics. Springer, Berlin (2004)
Cormen, T.H., Leiserson, C.E., Rivert, R.L., Stein, C.: Introduction to Algorithms. MIOT (2009)
Zuhori, S.T: Traveling Salesman Problem. LAP (2012)
Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Glob. Optim. 48(2), 323–334 (2010)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press (2004)
Zaki, S.A., Mousa, A.A., Geneedi, H.M., Elmekawy, A.Y.: Efficient multiobjective genetic algorithm for solving transportation and transshipment problems. Appl. Math. 3, 92–99 (2012)
Kakol, A., Pozniak-Koszalka, I., Koszalka, L,. Kasprzak, A., Burnham, K.J.: An Experimentation System for Testing Bee Behavior Based Algorithm to Solving a Transportation Problem. LNCS. vol. 6592, pp. 11–20. Springer, Berlin (2011)
Golonka, K., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: An experimentation system for bus route planning and testing metaheuristic algorithms. In: Proceedings to the Sixth International Conference on Systems. ICONS (2011)
Hyndman, R.J.: Forecasting with Exponential Smoothing. Springer, Berlin (2008)
Kubacki, J., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: Comparison of heuristic algorithms to solving mesh network path finding problem. In: Proceedings of Fourth Conference on Frontier of Computer Science and Technology, Shanghai (2009)
Acknowledgment
This work was supported by the statutory founds of the Dept. of Systems and Computer Networks, Wroclaw University of Technology, Poland.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Pohoski, A., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A. (2017). Experimentation System for Determining Bus Routes for Customers of Supermarket Chains. In: Stanton, N., Landry, S., Di Bucchianico, G., Vallicelli, A. (eds) Advances in Human Aspects of Transportation. Advances in Intelligent Systems and Computing, vol 484. Springer, Cham. https://doi.org/10.1007/978-3-319-41682-3_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-41682-3_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41681-6
Online ISBN: 978-3-319-41682-3
eBook Packages: EngineeringEngineering (R0)