Making Index for the intercity transportation network based on the modeling and preparation of mathematical method
محورهای موضوعی : Mathematical Optimization
1 - Department of Mathematics, ST.C., Islamic Azad University, Tehran, Iran
کلید واژه: Transportation systems management, The safety transportation networks and traffic management, The system capacity and transportation planning,
چکیده مقاله :
The necessary condition but not the enough one in order to enhance productivity and optimizing the operation of the transportation network lines is to give a proper index to any of these routes. The common lines of the distinct routes, therefore, would give more complexity and importance to the matter. So, through modeling and using the mathematical method based on the preparation of software we have tried to solve the problem. First, the routes of the journeys between all origins and destinations on the network concerning they sometimes had no specific and constant moving plan were identified. The number of journey demands between them were processed by this software in which for any route and number of journeys a quantitative figure between zero and one with the name of index was calculated. The more the index is closer to the number one, the more valuable the activity of the route will be. In this way the capacity of the routes must be regarded as independent variables. It is notable that by using this mathematical method it would be possible to predict the critical situations; that is, with an omission of one or more routes from the network we can calculate the traffic load imposed on the other routes as well as their respective index variations. The evaluations of the said indices are the basic tools for the safety and traffic management as well as the analysis of the system capacity and transportation planning.
The necessary condition but not the enough one in order to enhance productivity and optimizing the operation of the transportation network lines is to give a proper index to any of these routes. The common lines of the distinct routes, therefore, would give more complexity and importance to the matter. So, through modeling and using the mathematical method based on the preparation of software we have tried to solve the problem. First, the routes of the journeys between all origins and destinations on the network concerning they sometimes had no specific and constant moving plan were identified. The number of journey demands between them were processed by this software in which for any route and number of journeys a quantitative figure between zero and one with the name of index was calculated. The more the index is closer to the number one, the more valuable the activity of the route will be. In this way the capacity of the routes must be regarded as independent variables. It is notable that by using this mathematical method it would be possible to predict the critical situations; that is, with an omission of one or more routes from the network we can calculate the traffic load imposed on the other routes as well as their respective index variations. The evaluations of the said indices are the basic tools for the safety and traffic management as well as the analysis of the system capacity and transportation planning.
[1] An, K. and Lo, H. (2016). Two-phase stochastic program for transit network design under demand uncertainty. Transportation Research B, 84:157–181. Journal of Urban Planning and Development . Volume 146, Issue 3. https://doi.org/10.1061/(ASCE)UP.1943-5444.000060
[2] Badia, H., Estrada, M., and Robusté, F. (2014). Competitive transit network design in cities with radial street patterns. Transportation Research Part B: Methodological, 59:161–181. https://doi.org/10.1016/j.trb.2013.11.006
[3] Bel, G. and Holst, M. (2018). Evaluation of the impact of bus rapid transit on air pollution in mexico city. Transport Policy, 63, 209–220. https://doi.org/10.1016/j.tranpol.2018.01.001
[4] Beltran, B., Carrese, S., Cipriani, E., and Petrelli, M. (2009). Transit network design with allocation of green vehicles: A genetic algorithm approach. Transportation Research Part C: Emerging Technologies, 17(5), 475–483. https://doi.org/10.1016/j.trc.2009.04.008
[5] B. Barabino.(2009). Transit Bus Route Network Design: a model and its application in a real network. WIT Transactions on The Built Environment, 107, 369-382. https://doi.org/10.2495/UT090331
[6] Y. Jiang, W.Y. Szeto, and T.M. Ng.(2013). Transit Network Design: A Hybrid Enhanced Artificial Bee Colony Approach and a Case Study. International Journal of Transportation Science and Technology, 2, no. 3, 243-260. https://doi.org/10.1260/2046-0430.2.3.243
[7] Y. Kuo, C. Luo, and C. Wang, “Bus route design with limited travel time.” Transport, 28, no. 4, 368-373. https://doi.org/10.3846/16484142.2013.865103
[8] S. Ngamchai, D.J. Lovell, and A.M. ASCE, (2005). Optimal Time Transfer in Bus Transit Route Network Design Using a Genetic Algorithm. Proceedings of the Eastern Asia Society for Transportation Studies, 5, pp, 477 - 489. https://www.researchgate.net/publication/228960835
[9] Sharma, SK, & George, SA. (2018). Modelling resilience of truckload transportation industry. Benchmarking An International Journal, 25, 2531–2545. https://doi.org/10.1108/BIJ-07- 2017-0188
[10] Twumasi-Boakye, R., and J. O. Sobanjo. 2017. Evaluation of transportation user costs based on simulated regional network models. Journal of the Transportation Research Board. 2612, 1. https://doi.org/10.3141/2612-14
[11] Twumasi-Boakye, R, & Sobanjo, JO. (2018). Resilience of Regional Transportation Networks Subjected to Hazard-Induced Bridge Damages. Journal of Transportation Engineering, Part A: Systems, 144, 10 .https://doi.org/10.1061/JTEPBS.0000186
[12] Wang, C, Ye, Z, & Wang, W. (2020). A Multi-Objective Optimization and Hybrid Heuristic Approach for Urban Bus Route Network Design. IEEE Access, 8, 12154–12167. https://doi.org/10.1109/ACCESS.2020.2966008.
________________________________________________________
Original Research .
Making Index for the intercity transportation network based on the modeling and preparation of mathematical method
Ehsan Arfa*
Received: 13 April 2025 / Accepted: 14 June 2025 / Published online: 14 June 2025
*Corresponding Author Email, e_arfa@iau.ac.ir
Department of Mathematics, ST.C., Islamic Azad University, Tehran, Iran
Abstract
The necessary condition but not the enough one in order to enhance productivity and optimizing the operation of the transportation network lines is to give a proper index to any of these routes. The common lines of the distinct routes, therefore, would give more complexity and importance to the matter. So, through modeling and using the mathematical method based on the preparation of software we have tried to solve the problem. First, the routes of the journeys between all origins and destinations on the network concerning they sometimes had no specific and constant moving plan were identified. The number of journey demands between them were processed by this software in which for any route and number of journeys a quantitative figure between zero and one with the name of index was calculated. The more the index is closer to the number one, the more valuable the activity of the route will be. In this way the capacity of the routes must be regarded as independent variables. It is notable that by using this mathematical method it would be possible to predict the critical situations; that is, with an omission of one or more routes from the network we can calculate the traffic load imposed on the other routes as well as their respective index variations. The evaluations of the said indices are the basic tools for the safety and traffic management as well as the analysis of the system capacity and transportation planning.
Keywords- Transportation systems management; The safety transportation networks and traffic management; The system capacity and transportation planning
Introduction
Through the identification of the ultimate limit of productivity and operation of the whole network lines we can obtain important data upon which the analysis of capacity, the safety and traffic management are performed. The goals of the transportation network and its sustainability are some permanent issues which have a close relation with the productivity and operating of the whole network lines from one hand and the category of safety improvement and accident prevention from the other.
In this regard it is necessary to refer in particular to the issue of optimum distribution of equipment’s, technology and most skillful personnel across the vital railway lines. It is obvious that the consequences of blocking two distinct connecting sections of lines are not the same from the view of losses incurred.
Many scholars have focused on transportation network resilience because of its importance in society's well-being and recovery efforts after disturbances. Existing studies have suggested various definitions, indicators, and methods for assessing the resilience of transportation networks. This variation is due to differences in the nature, scale, and impact of disturbances. This systematic literature review presents resilience assessment methods for transportation networks, indicators, and disturbance categories [9,11,12].
In terms of algorithm design, researchers have proposed numerous heuristic or metaheuristic algorithms to solve feeder bus network optimization problems, such as simulated annealing algorithm [7], genetic algorithm [10], [8], hybrid enhanced artificial bee colony algorithm [6], and a complex two-phase heuristic algorithm [5]. Reference [5] proposed a two-phase heuristic algorithm to optimize the route network design and frequency setting problems. Reference [10] proposed a genetic algorithm with two types of crossover operators and four types of mutation operators. Reference [6] proposed a hybrid enhanced artificial bee colony algorithm to solve the same problem.
So here the issue of loss estimation and identifying the effect of one or two optional blocked sections on the other lines is put forward. In this case the traffic loads of the blocked sections are imposed on the others. This cycle is occurred repeatedly which inevitably causes the other vehicles to change their routes by force. So, the network management faces with a new condition as an outcome of the former network with some deficiencies inside. Here we need a software program to be able to find the optimum shortest route for the new condition for all journeys and introduce them to the applicants. It means that there are still origins, destinations and journey applicants in which only some connecting lines are missed. In such conditions only some applicants postpone their journey without cancelling. The starting time for their journey depends on the information provided by the traffic management. Off course, the numbers of journeys arranged and put into action prior to the line blockage, are the first traffic waves which must be properly managed and controlled.
These factors show the intensive dependence of the transportation network on the software of "finding the shortest route in the intermodal transportation network" which in its turn would add to its significance. But in this paper through application of the said software algorithm on identifying the connecting lines of the routes, first we calculate the number of traffic movements on each line in respect to the quantity of journey applicants between all origins and destinations.
Then based on these data we will give an index to the mathematic formula of the said line. It is obvious that only based on the identification of the critical network lines and using a proper and optimized plan it would be possible to have a sustainable transport system.
For all line-based transit systems like bus, metro and tram, the routes of the lines and the frequencies at which they are operated are determining for the operational performance of the system. However, as transit line planning happens early in the planning process, it is not straightforward to predict the effects of line planning decisions on relevant performance indicators. This challenge has in more than 40 years of research on transit line planning let to many different models[1, 2, 3, 4].
Statement of the problem and its mathematical method
The best managerial decisions on the way to improve the issues of traffic and safety as well as the economy and transportation planning is to give a proper index to the city streets. This important issue can be achieved based on some assumptions such as the number of applicants for inter-city and outer-city journeys, number of private, public and state-owned vehicles together with the city map. Without disturbing the generality of the matter, we assume that the city junctions and squares, metro stations, busses and taxies are the set of connecting points named as the origins and destinations. Based on this assumption, we name any direct connection between two optional points as a curved or connecting line.
According to the mathematical logic, if the network consists of 
number of connecting points, then there would be 
number of journey demands. The numbers of network connecting lines have no influence on the number of journey demands. As an example, for a network with three connecting points there are six conditions of journey demands as following:
1- Number of vehicles of the journey applicants from the first point (origin) to the second point (destination).
2- Number of vehicles of the journey applicants from the first point (origin) to the third point (destination).
3- Number of vehicles of the journey applicants from the second point (origin) to the first point (destination).
4- Number of vehicles of the journey applicants from the second point (origin) to the third point (destination).
5- Number of vehicles of the journey applicants from the third point (origin) to the first point (destination).
6- Number of vehicles of the journey applicants from the third point (origin) to the sixth point (destination).
Every journey consists of several points and lines which are determined through the algorithm of “optimized route identification” shown by 
in which the
. In any network there are some common connecting points and lines. So, we must pay a close look at these common sections (said above points and lines). Therefore, the issue of ideal distribution of equipment and power in the transportation networks depends on the analysis of the distinct routes with the common parts. In this way we would calculate the number of moving vehicles on each line (line traffic load) through a mathematical formula. This important issue can be achieved by considering the number of vehicles of the journey applicants between all origins and destinations. So, we assume that the matrix of the journey applicants between all origins and destinations exist which is shown as following:
(1)
In which 
is the number of vehicles of journey applicants from origin 
to destination
. Also, we assume 
as a street or highway which directly connects the points 
and 
to each other. The direction of movement is from to in which
.
All the distinct lines which have a common member of are the member of the set 
too
(2)
Now we show the number of the moving vehicles from with 
which is calculated by the following formula.
(3)
After calculating the number of movements for each line, we show the index of street or highway with 
and calculate it by the following formula:
(4)
Obviously, whatever the is bigger, the 
becomes smaller and in contrast the 
gets bigger which is between zero and one. The closer the index to one the more valuable it will be.
Algorithm of identifying the optimum route lines between origins and destinations
Based on the real condition the structure of the network consists of number of connecting points in the form of directional graph 
in which
is the set of points and
set of network lines.
Step one: we set up and show the matrix of the network connections with
. The numbers one and zero are the members of this square matrix
.
In which 
if and only if the connection point is directly connected to the connecting point. Otherwise, 
.
Step two: we simultaneously introduce two matrices of 
and 
respectively named as journey expenses and journey lines identification matrix. The drivers would drive their vehicles based on these two matrices. Each member of the matrix is calculated an assumed on the basis of one variable or a combination of several distinct and main variables such as time, length and fuel cost of the journey. It is recommended to only calculate the time concerning the connection of new metro stations to the transportation network. The second is the matrix whose members identify the optimum route lines for any journey between the origins and destinations. The 
a natural figure which shows the conditions of being in the origin, destination and before reaching the destination. We respectively give some values to the. This process is stopped when
.
First we assume 
.In this condition we are at the beginning of the movement. If the connecting point 
is directly connected to the
, then the value of the 
member from matrix 
would be equal to 
. Otherwise, we consider the infant penalty for this member, that is, 
. In fact, the members of the assumed matrix exist. The 
does not exist, so we must add one to the k.
But at first for the 
we introduce two matrices of and by the following formulas:
(5)
In which
(6)
(7)
Step three: we put 
. Then we calculate two matrices of 
and 
.
If 
, then the processing of this algorithm has finished. Otherwise, we add one to the and once again we calculate two matrices of and .
Step four: For identifying the optimum route between each optional origin and destination of and we refer to 
. We assume 
in which 
. There are two conditions.
Condition one: 
, then the route from to is direct.
Condition two: 
, then we look at the member of 
. We assume 
then again two conditions occur.
Condition one: 
, then the route from to consists of two branches. The first branch from to 
and the second one from to .
Condition two: 
, then we look at the member of 
. We assume 
then again two conditions occur and so on.
We assume after n number of irritation the 
. So, the optimum route between the connecting points I and j consist of n branches as following:
(8)
Problem modeling
The origins and destinations of the transportation network in the 14 connecting points have been gathered in the figure 1. These points have been connected to each other through 40 numbers of curve-shaped lines. (20 two directional curve-shaped lines). The process of gathering the origins and destinations has only been carried out for the ease of function. In fact, it means that there are some distinct transportation networks inside the very nature of each single points of the main network adhering to these calculations and discussions. The figures on the curved lines demonstrate the time period between two connected points. Without disturbing the generality of the matter, it is assumed that the time for going and return is equal.
As an example, 
.As it was formerly discussed there are 
number of journey demands between its all origins and destinations. By the contribution of statistics its outcomes are assumed by the matrix
.
The members of this matrix are assumptive which are considered on the basis of thousand-fold bunches. As an example, the member 
is a symbol of eleven thousands of movements from the origin one to the destination two. The demand for the values of the movements is performed within the unit of time.
For example, we identify the best route from the second origin to the eighth destination. According to the algorithm we refer to the member of 
from the matrix 
and it is seen that 
.
Thus, we must consider 
. Since then we refer to the 
. As 
we will consider 
. It is seen that 
so the algorithm process terminates.
In this way the best route from the second origin to the eighth destination is identified which consists of the following connecting lines:
Moreover, the value of the member 
from the matrix 
is equal to nine hundred and sixty seconds which shows the least period of time for traveling from the second origin to the eight destinations. The identification of the optimum route between all origins and destinations as well as their traveling time is shown in Table I.
Since it was assumed that the going and returning times on the curved lines are the same it is seen that the travel direction of 
is exactly opposite to that of 
and their traveling time is also equal. So, the results are Symmetric which can be avoided. In this way based on the said algorithm, the identification of the route between each pair of two optional points - so called as origin and destination- can be achieved.
According to the Figure 1 of the network curved line the sets of are as following:
From Table I any single member of these sets is obtained. As an example:
.
Now we calculate 
according to the formula (3) which is equal to:
Based on the above result obtained by the formula (4) the index of the street or highway 
is calculated. We show this index with 
which is equal to:
but 
.
According to this method the index of all lines of the Figure 1 are calculated whose results are shown in the Table II sorted from the highest weight in four digits decimal.
Table I
optimum routes between all origins and destinations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Conclusion
Undoubtedly, many of factors such as the population growth, the increase in number of vehicles and intercity and outer-city journeys as a result, improper development of spider web shaped of the network from inside and outside, lack of using the modern controlling technologies, not observing the rules and regulations by the drivers and pedestrians, the existence of some amateur or extra professional accident makers in this industry together with other elements would directly or indirectly add to the traffic load of the transportation network. Only through the modeling and preparation of the mathematical model it is possible to identify and analyze the transportation network. In fact, by identifying the capability of the transportation network it would be possible to solve some parts of the traffic problems or to control them or even to ensure sustainability of its goals. Basically, the activity of indexing the transportation network lines is performed in order to identify the dead routes as well as to identify the whole capacity of the lines especially the critical ones with the aim of supporting them. From the Table II we observe that in the transportation network the Figure 1 is a fully dead line which has been hidden among all fully traffic loaded ones. By the contribution of this model the design of the new lines for decreasing the traffic load of the saturated lines can also be studied. One of the other advantages and paramount features of this method is an ability of its software to compare the change in the direction of movement of the network lines to correct and manage the operational activities. Although, the main and critical lines can easily be identified but the scientific and precise indexing to all lines to establish an intelligent traffic management would cause the degree of any fault and error to be led to zero.
To give an index to the network lines for developing a single and integrated management is a promising measure for rendering a comprehensive method a policy to introduce new transportation systems and technologies as well as to improve the national culture as a whole.
Table II
The index of all lines of the figure 1
|
|
|
|
|
|
References
[1] An, K. and Lo, H. (2016). Two-phase stochastic program for transit network design under demand uncertainty. Transportation Research B, 84:157–181. Journal of Urban Planning and Development . Volume 146, Issue 3. https://doi.org/10.1061/(ASCE)UP.1943-5444.000060
[2] Badia, H., Estrada, M., and Robusté, F. (2014). Competitive transit network design in cities with radial street patterns. Transportation Research Part B: Methodological, 59:161–181. https://doi.org/10.1016/j.trb.2013.11.006
[3] Bel, G. and Holst, M. (2018). Evaluation of the impact of bus rapid transit on air pollution in mexico city. Transport Policy, 63, 209–220. https://doi.org/10.1016/j.tranpol.2018.01.001
[4] Beltran, B., Carrese, S., Cipriani, E., and Petrelli, M. (2009). Transit network design with allocation of green vehicles: A genetic algorithm approach. Transportation Research Part C: Emerging Technologies, 17(5), 475–483. https://doi.org/10.1016/j.trc.2009.04.008
[5] B. Barabino.(2009). Transit Bus Route Network Design: a model and its application in a real network. WIT Transactions on The Built Environment, 107, 369-382. https://doi.org/10.2495/UT090331
[6] Y. Jiang, W.Y. Szeto, and T.M. Ng.(2013). Transit Network Design: A Hybrid Enhanced Artificial Bee Colony Approach and a Case Study. International Journal of Transportation Science and Technology, 2, no. 3, 243-260. https://doi.org/10.1260/2046-0430.2.3.243
[7] Y. Kuo, C. Luo, and C. Wang, “Bus route design with limited travel time.” Transport, 28, no. 4, 368-373. https://doi.org/10.3846/16484142.2013.865103
[8] S. Ngamchai, D.J. Lovell, and A.M. ASCE, (2005). Optimal Time Transfer in Bus Transit Route Network Design Using a Genetic Algorithm. Proceedings of the Eastern Asia Society for Transportation Studies, 5, pp, 477 - 489. https://www.researchgate.net/publication/228960835
[9] Sharma, SK, & George, SA. (2018). Modelling resilience of truckload transportation industry. Benchmarking An International Journal, 25, 2531–2545. https://doi.org/10.1108/BIJ-07- 2017-0188
[10] Twumasi-Boakye, R., and J. O. Sobanjo. 2017. Evaluation of transportation user costs based on simulated regional network models. Journal of the Transportation Research Board. 2612, 1. https://doi.org/10.3141/2612-14
[11] Twumasi-Boakye, R, & Sobanjo, JO. (2018). Resilience of Regional Transportation Networks Subjected to Hazard-Induced Bridge Damages. Journal of Transportation Engineering, Part A: Systems, 144, 10 .https://doi.org/10.1061/JTEPBS.0000186
[12] Wang, C, Ye, Z, & Wang, W. (2020). A Multi-Objective Optimization and Hybrid Heuristic Approach for Urban Bus Route Network Design. IEEE Access, 8, 12154–12167. https://doi.org/10.1109/ACCESS.2020.2966008.
Authors Information
Ehsan arfa, Associate Professor, Academic Board Member of scientific Islamic Azad University, Department Of South Teheran, Applied Mathematic Group
