Abstract
The article refers to the problem of planning international transport. The aim of this paper is to develop the algorithm which will be used to planning international transport. Planning international transport problems are the complex decision problems which refer to the vehicle routing problems and the problems of designating the minimal path in the graph. The approach to planning international transport presented in this paper takes into account the delay times in the intermediate points, e.g. cities and average waiting time at the border crossings. In order to determine the international transport routes the mathematical model was developed, i.e. decision variables, constraints and the criterion function. Decision variables take the binary form and determine the connections between the objects in the transportation network which are realized by the vehicles. Constraints take into account the weight limits on the routes and the time realization of the transportation task. The criterion function determines the minimal transportation route in the context the time of its realization. In order to designate the routes in international transport the heuristic algorithm, i.e. ant algorithm was developed. The steps of building this algorithm was presented. This algorithm was verified in the C# programming language. The results generating by the presented algorithm were compared with the results generating by the random algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jacyna, M., Wasiak, M.: Decision Support in Designing Transport Systems. Tools of Transport Telematics, pp. 11–23. Springer, Berlin (2015)
Jacyna, M., Merkisz, J.: Proecological approach to modelling traffic organization in national transport system. Arch. Transp. Pol. Acad. Sci. 30(2), 32–71 (2014)
Sharma, R.R.K., Berry, V.: Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort. Eur. J. Oper. Res. 177(2), 803–812 (2007)
Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by Benders decomposition. Manage. Sci. 20(5), 822–844 (1974)
Sharma, R.R.K.: Modeling a fertilizer distribution system. Eur. J. Oper. Res. 51(1), 24–34 (1991)
Spliet, R., Gabor, A.F.: The time window assignment vehicle routing problems. Transp. Sci. 49(4), 721–731 (2013)
Figliozzi, M.A., Mahmassani, H.S., Jaillet, P.: Pricing in dynamic vehicle routing problem. Transp. Sci. 41(3), 302–318 (2007)
Sharma, D.K., Peer, S.K.: Finding the shortest path in the stochastic networks. Comput. Math Appl. 53(5), 729–740 (2007)
Fan, Y., Kalaba, R., Moore, J.: Shortest paths in stochastic networks with correlated link costs. Comput. Math Appl. 49(9–10), 1549–1564 (2005)
Jacyna-Golda, I., Izdebski, M., Podviezko, A.: Assessment of efficiency of assignment of vehicles to tasks in supply chains: a case study of a municipal company. Transport 32(3), 243–251 (2017)
Lewczuk, K.: The concept of genetic programming in organizing internal transport processes. Arch. Transp. Pol. Acad. Sci. 34(2), 61–74 (2015)
Dorigo, M., Gambardela, L.M.: Ant colonies for the travelling salesman problem. BioSystems 43(2), 73–81 (1997)
Dorigo, M., Gambardela, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Izdebski, M., Jacyna-Gołda, I., Jakowlewa, I. (2019). Planning International Transport Using the Heuristic Algorithm. In: Sierpiński, G. (eds) Integration as Solution for Advanced Smart Urban Transport Systems. TSTP 2018. Advances in Intelligent Systems and Computing, vol 844. Springer, Cham. https://doi.org/10.1007/978-3-319-99477-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-99477-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99476-5
Online ISBN: 978-3-319-99477-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)