Search

Purpose: Regarding urban population growth and importance of time and cost in the societies of today, subway systems have faced with demand increase and passengers waiting time have prolonged. In urban transportation systems especially in subways, the passengers waiting time influences the society satisfaction deeply. Since the emersion of rail network, time and scheduling as important challenges have been emerged. Then the periodic train planning as one of the best solutions was introduced to decrease passenger waiting time, reduce travel length, and increase transportation safety. This challenge should be solved by subway managers. Due to the limited number of trains and equipment on subway lines and increase of their cost-effectiveness in reducing passenger waiting times at intersections, an attempt has been made in this paper to reduce waiting time using optimization models that often do not impose costs on the system. In addition, another aim of this paper is to fill the existing research gap in this area. Design/methodology/approach: This paper aims to calculate the weights of intersections stations in order to minimize the passenger waiting time through goal programming (Khalili Damghani et al. 2015; Mosadeghi et al. 2010). Many studies have been done on train scheduling and transportation mathematical modelling all around the world (Moghaddam and Mahlooji, 2017; Sadeghieh and Dehnavi-Arani, 2019). The aim of this paper is to minimize the deviation from desirable situation through goal programming. The main function of the proposed model is formulated again along with new construction, auxiliary variables and optimum values. It consists of variables with the concept of “deviation of desirable situation”. In this paper, both of the deviations of desirable situations are shown by dip and din which are undesired and should be minimized to achieve the optimum value. For this purpose, the fourth line of Tehran subway system and its intersections sections are considered as the real world problem. Findings: The model is solved by Lingo and optimum values are calculated. The model is developed based on goal programming and it can reduce the passenger waiting time and satisfaction which results in increased acceptance of public transportation in society. These findings are compared with current values of time tables for first and last movements. Findings indicated that the proposed model can reduce the passenger current waiting time by 42%. Research limitations/implications: In this paper, the accurate amount of passenger population was determined in a day based on lines, separately. Also, it was difficult to collect study data from the Tehran subway system organization. The proposed approach resulted in reduced passenger waiting time. Suggestions for further study include examining and analyzing the factors causing train delay and comparing the results of each single line with another; using simulation method to develop an optimization model for time tabling of train movement in order to optimize energy consumption; calculating and optimizing the number of subway station staff; and optimizing models to design the subway station network. Practical implications: As Tehran public transportation system is extending to cover more urban regions, the intersection stations will increase. Therefore, the role of these stations will be more tangible. Each intersection station scheduling affects the train movements in other stations and this continues throughout the length of the network. It means that each delay and pause will influence the other intersections, increasingly. The subway system managers can employ this model on other lines and reduce the waiting time of passengers in the whole Tehran subway. Social implications: As mentioned earlier, the waiting time of passengers in different stations, especially in intersections, is an important factor in using subway system as an effective public transportation system. It will increase or decrease the rate of subway usage. More public transportation usage leads to less air pollution, less traffic and faster travels in the city, which are all desirable for society. Originality/value: In this paper, a goal programming model was proposed to minimize the deviations in the objective function and subsequently, the passenger waiting time in intersection stations. As the intersection stations are increased, the role of the proposed method can be considered as a solution for public transportation in different cities of Iran. [ABSTRACT FROM AUTHOR]

In the Qajar era, manifestations of the new civilization were first established in the centers of modernity such as Tehran and Tabriz. Despite numerous obstacles, it gradually reached other provinces. From institutions and new manifestations, we can name the school and the newspaper that had a great impact on the social and intellectual transformation of the society. In the city of Zanjan, the manifestations of civilization were created with delay despite the fact that this city is located between the two important centers of Tehran and Tabriz. It was due to the social, political, and cultural creation of Zanjan. However, gradually new institutions impress their influence on Zanjan society among some classes and groups. This issue has not yet been the subject of an independent study and its vacancy is felt in studies on the process of establishing the manifestations of a new civilization in different provinces. In this regard, the present study seeks to examine the establishment of schools with newspapers and newspaper reading and those who try this path by explaining the obstacles, difficulties, effects, and results. According to the research claim, due to the relatively free conditions of the Mozaffari era and the cooperation of the executive elements of the government with the reformists, new manifestations were established in Zanjan and were accompanied by some successes. But the competition of the scholars in form of opposing groups that affected different strata created serious obstacles for new institutions and those interested in new manifestations. This study deals with the issue using a descriptive-explanatory method, relying on original sources, newspapers, and archival and family documents. [ABSTRACT FROM AUTHOR]

Purpose: Cross-docking is a strategy in logistics management in which products from one or more suppliers are distributed directly to customers with a minimum loading or storage time. Cross docks act more as an inventory coordinator than as a storage warehouse. Finding a proper location is a critical issue in cross-docking. The page rank algorithm in social networks is one of the methods used to locate the accessible nodes in urban-networks. However, in the application of page rank algorithm in the location problems, only location access to the other nodes of the network has been considered, whereas, in cross docks’ location problem, the distance between the nodes, directly and indirectly, is of high importance due to the one-way nature of some routes and the average closeness of the cross docks to all nodes of the network in general. Thus, this research aims to develop the page rank algorithm in cross docks’ location problem, recognizing the distance between nodes with a weighted distanced adjacency matrix, besides considering the access and closeness to the different nodes of the network. Design/methodology/approach: The page rank algorithm developed by Agryzkov et al. (2012) in a way that the binary adjacency matrix of the path between nodes is changed into a weighted adjacency matrix, in which each element of the matrix in a row ‘i’ and column ‘j’ denotes the distance between ith and jth locations in the map. Besides, the main criteria of the Social Network Analysis (SNA) approach, such as Closeness centrality and Eigenvector centrality, also used to develop the model. Finally, the maximum covering location model in the network has been created by considering the output of the developed page rank algorithm as the input. To investigate the validity of the developed algorithm, it is applied in a practical cross docking problem and is solved by using the GAMS software. Findings: The developed page rank algorithm was applied to find the best locations of cross docks for an online store in the western half of district 3 in Tehran. The location points identified by the algorithm seem reasonable since they have access to the main highways allowing for easy and timely delivery of orders to customers distributed all over the investigated area. Research limitations/implications: Authors did not consider limitations such as the cost of renting and purchasing warehouse and the physical and traffic feasibility of the location points in the developed model. As a suggestion for future study, the model can be further developed by considering such features. Practical implications: By using the developed algorithm, the time of delivering goods and services to the customers by online stores would reduce, which not only increases the customers’ satisfaction but it also declines the company’s costs, significantly. Social implications: Timely delivery of orders to customers elevates customers’ feeling of safety and trust. Thus, it augments the online shopping habit of customers, leading to saving time, energy, and cost. Originality/value: Previously, the page ranking algorithm used in finding the best locations of advertising billboards in the urban map. Regarding the nature of a billboard location problem, only access/lack of access to a point determines the importance of a place, while in cross-docking location problem, in addition to access points, the distance of these warehouses, directly and indirectly, and the average proximity of them to all points of the network is of great importance. The algorithm developed in this study, in comparison with the previous version, not only considers the access of location points but also reflects the proximity of points through direct or indirect paths. [ABSTRACT FROM AUTHOR]