# Dynamic Path Optimization in Sharing Mode to Relieve Urban Traffic Congestion

Authors: Hongmei Chen; Yuanhang Zhang
Journal: Discrete Dynamics in Nature and Society
 (2021)

---

## Abstract

In recent years, a new mode of transportation, referred to as “shared commuter buses,” has been introduced, which can considerably reduce the dependence of office workers on private cars and relieve urban traffic congestion, but is not widely used owing to efficiency issues. Improving the efficiency of shared commuter buses was set as a goal, and in this study, several research objects were selected to optimize the driving routes of shared commuter buses. The problem of stop location is combined with dynamic route optimization; the “shortest walking distance” model is established to select the most appropriate location for stops. The vehicle routing problem model and “key point updating strategy” are employed to plan routes with real-time traffic information. Finally, we conduct an empirical study to validate our conclusions. The results show that both the model and algorithm are reliable and effective; thus, travel efficiency can be effectively improved and traffic jams can be alleviated.


---

## Body

## 1. Introduction

In recent years, the “sharing economy” approach to traffic has become very popular; it has been proved effective in alleviating urban traffic congestion by reducing the usage of private cars; typical examples of such schemes include “shared bicycles” and “shared cars.” “Shared commuter bus” schemes can effectively fulfill the commuting needs of urban office workers; however, these schemes are not widely used, predominantly because they cannot ensure efficient travel. Hence, in this study, we attempt to improve the efficiency of shared commuter bus systems by using path optimization. We use the vehicle routing problem (VRP) for reference in our operations research, to optimize the initial routes of commuter buses. However, shared commuter bus systems partially correspond to a mixed-load mode of travel; thus, the traditional VRP model needs to be adjusted.Psaraftis [1] highlighted several dynamic elements in dynamic VRPs (DVRPs), including “dynamic requirements,” “dynamic running times,” and “dynamic vehicles.” Azi et al. [2] suggested that the dynamic factors of DVRPs can be categorized into two groups based on Psaraftis’ theory: the change in customer demand and real-time traffic information. With the development of the Internet of Things and network information technology, information is becoming more readily available; thus, DVRPs based on real-time traffic information have attracted increasing attention from researchers, and these problems are often solved in two stages: initial-route design and dynamic route adjustment. “Initial-route design” is a process of static optimization, and we can solve it in a conventional way; “dynamic route adjustment” is a process of dynamic optimization, in which the most important step is to determine the route-updating strategies.“Initial-route design” is discussed firstly. Compared with the traditional commuter bus, “shared commuter bus” uses a mixed-load model, in which office workers from different companies can take a ride on the same commuter bus. In the common vehicle routing problem, except for the starting point and the ending point, all nodes in the path network are of the same type. However, in the mixed-load mode of commuter buses, the types of nodes in VRP are different, and the load increases at some nodes and decreases at others, so the biggest difficulty lies in the disposal of these nodes. The current research on the mixed-load mode of VRP focuses on the School Bus Routing Problem (SBRP). There is a special class of SBRP, which studies the cooperation of multiple schools to pick up students, and this kind of problem is similar to the content studied in this paper.“Dynamic route adjustment” is discussed secondly. In the process of “initial-route design,” urban road is assumed to be idealized; that is, the influence of other factors except for “path length” on the travel time is not considered, but in the process of “dynamic route adjustment,” the factor “real-time traffic information” is considered, and it has a great influence on the final dynamic optimization result.By consulting numerous documents, we found that the choice of stops strongly influences the final optimization result; however, the existing literature rarely considers this point. In this study, we consider “stop location” as a prerequisite for DVRPs, and we focus on it in our analysis.In line with the above description, this study proposes a dynamic vehicle routing optimization for a mixed-load mode of operation. The contributions of this study are as follows:(1)
We solve the static VRP for a mixed load and adjust the path dynamically according to the real-time traffic information, and our objective model reflects the focal issues encountered in real-life applications. We designed shared commuter bus routes that improve the vehicle driving efficiencies, consequently rendering the scheme suitable for widespread application as part of the efforts to reduce pressure on urban traffic systems during peak times.(2)
We consider the impacts of stop-location selection on route optimization and effectively integrate the two tasks. Furthermore, we use a clustering algorithm and particle swarm optimization (PSO) algorithm to solve them. The clustering algorithm enables us to identify the most convenient site based on the nearest walking distance; the PSO enables us to determine the most efficient driving route.The remainder of this paper is organized as follows: Section2 reviews the relevant literature. Section 3 describes in detail the location model and the vehicle routing optimization model. Section 4 presents the design of the clustering and particle swarm algorithms used to solve the model. Section 5 presents our study on Qinhuangdao as an empirical test case and a specific optimization result. Finally, Section 6 presents the conclusions of this study and recommendations for future work.


## 2. Literature Review

The VRP was proposed by Dantzig and Ramser, and it is widely used in logistic distribution routing problems; there are also some scholars who use it to solve SBRP. However, school buses and commuter buses have different cost and efficiency requirements. Hence, some differences may exist between the two problems in terms of optimization goals and constraint conditions. The DVRP is an important offshoot of the VRP; it was proposed by Psaraftis in 1988; more recently, Psaraftis [3], Bertsimas and Simchi-Levi [4], and Gendreau and Potvin [5] have conducted deeper research on the content of DVRPs. A DVRP based on real-time traffic information is solved in two stages: initial-route design and dynamic route adjustment, and what we need to do in the two stages is to solve a static VRP and choose a route-adjustment strategy.The static VRP related to the paper is different from traditional VRP, there are few studies on the route optimization of “shared commuter bus,” and the mixed-load school bus is similar to “shared commuter buses” in their loading mode, so we mainly refer to the literature studies that study mixed-load SBRP. Ellegood et al. [6] used continuous approximation models to determine whether school bus in mixed-load mode is more beneficial and drew a conclusion that mixed-load mode is more suitable for large districts. Miranda et al. [7] proved that the multiloading approach can substantially reduce cost by practical example analyzing. Mokhtari and Ghezavati [8] introduced a novel mixed-load SBRP and used a biobjective mixed integer linear programming formulation to model it. Shang et al. [9] proposed a time-discretized multicommodity network flow model and transformed the SBRP into a quadratic 0-1 programming model with linear flow balance constraints. Ren et al. [10] considered both school bus stop location and mixed-load routing problem and developed a mixed integer programming model for them.In order to find the most appropriate route adjust strategy, we identified four different strategies by consulting numerous studies. The first one is the regular updating strategy; principally, this transforms dynamic routes into static routes and occasionally adjusts them. Several scholars have used regular updating strategies in their research (Kilby et al. [11]; Abdallah et al. [12]). The second strategy is that of dynamic event-updating; here, the routes are adjusted when drivers encounter unusual events. Armas and Batista [13] used a dynamic updating strategy in their study to produce a DVRP rich in detail. The third strategy is the docking-site updating strategy; in this scheme, routes are adjusted when vehicles reach distribution nodes. Nakamura et al. [14] used a docking-site updating strategy to choose a dynamic, stochastic route. The fourth strategy is the key point updating strategy. It is the latest but most widely used strategy; its core concept is to define “key points” and adjust routes when vehicles reach these points. Different researchers have used different definitions for “key point,” and many scholars have employed the key point updating strategy in their studies (Chen et al. [15]; Li et al. [16]). The Chinese scholar Yanfeng Li, who compared the four strategies under different perturbation frequencies and standard deviations, proved the superiority of the key point updating strategy.Research on optimization algorithms is more extensive; such algorithms are primarily classified as accurate or heuristic. Accurate algorithms are suitable for the problem which involves less data. Shang et al. [9] decomposed the model into a series of linear multicommodity network flow subproblems when dealing with mixed-load SBRP and used dynamic programming algorithms to solve them. Owing to the continuous expansion of research data and the requirements placed upon computational efficiency, heuristic algorithms are a current research hotspot; examples of such algorithms include the tabu search, ant colony, and genetic algorithms, as well as PSO. Hou et al. [17] succeeded to use the algorithm originally developed for pickup and delivery problem with time windows to solve mixed-load SBRP. Wohlgemuth et al. [18] used the tabu search algorithm to plan dynamic routes for disaster rescue vehicles. Li and Chung [19] proposed a new method combining extended insertion and tabu search algorithms to solve VRPs. Schyns [20] used an ant colony algorithm to optimize responsive dynamic vehicle routes. Kuo et al. [21] applied a fuzzy ant colony algorithm to solve DVRPs. Barkaoui and Gendreau [22] designed an adaptive hybrid genetic algorithm by improving the genetic operator; this greatly improved the quality of the genetic algorithm’s solution. Abdallah et al. [12] used a genetic algorithm to solve VRPs in which the demand and road condition information are constantly changing. Khouadjia et al. [23] measured the behavior of PSO in terms of dynamic adaptation. Okulewicz and Mańdziuk [24] presented a two-phase multiswarm particle optimizer to solve DVRPs, and they proved its superiority over traditional methods. Jia et al. [25] designed a set-based PSO algorithm to operate a dynamic, logistic dispatching system.By filtering through and summarizing the existing research, we established a VRP model to solve initial-route design and took the key point updating strategy as the route adjust strategy, owing to its precision. Furthermore, each heuristic algorithm was found to have its own advantages and disadvantages. Thus, we chose the PSO to improve the solving efficiency of models. The stop locations were also considered andk-means clustering algorithm was used to find the most suitable stops.


## 3. Problem Description and Modeling

### 3.1. Problem Description

As important nodes in the path network, the stops have a certain influence on the result of vehicle routing problem. When studying the problem of “stop location,” we minimize the walking distance after ensuring all the office workers in need are located within the service range. When dealing with shared commuter bus routing problem, the shared commuter bus’s mixed-load attribute is taken into consideration, the office workers on a commuter bus may not have the same destination, and in other words, some middle nodes in the path network are boarding points, which present stop location; others are drop-off points, which present enterprise location, and how to distinguish and process different nodes in VRP mode is the difficulty.In this study, shared commuter bus routes were optimized to improve driving efficiency. First, we choose appropriate stop locations based on commuters’ residences. Second, we determine the service scope and arrival order of each commuter bus, and the reasonable initial routes are thus formed. Finally, we adjust the commuter bus routes using real-time road condition information. In terms of efficiency and comfort requirements of commuters, overlap between different routes and overloading is prohibited. The number of commuters at the stop is assumed to not vary over a short time period, and in other words, another group of DVRP (VRP with dynamic customer demand) is ignored. The general problem studied in this paper can be divided into three subproblems: stop location, initial-route design, and dynamic route adjustment.Stop location is primarily determined by the number of stops required and commuters’ addresses. In this study, commuters’ addresses are divided into several regions using a clustering algorithm, and a model based on the shortest walking distance is established. We use the Euclidean distance as a standard model metric; this may result in some disparities between the real scenario and the model, owing to the complexity and irregularity of the actual traffic network; however, we assume that these differences are negligible.The objective of the initial-route design is to minimize the travel time in an ideal situation. Take the routes of picking up office workers in the morning peak hour as an example, and the nodes in the route network include the stop nodes and the enterprise nodes. Shared commuter buses reach the stop nodes to take on office workers, and reach enterprise nodes to put them off. The VRP model is established to solve the problem, and the schematic diagram is shown in Figure1. There are often several routes between two stops, and only the shortest one is considered in the process.Figure 1
Schematic diagram of the VRP in a mixed-load mode.The objective of the dynamic route adjustment is to minimize the travel time in a practical situation. In practice, the travel time of the commuter buses cannot be determined by the route lengths, owing to the randomness of congestion and accidents. So, in the process of dynamic route adjustment, we give up the ideal assumption in the initial-route design and take the dynamic traffic information into consideration.Consistent with the traditional solutions to solve dynamic vehicle routing problems, we divide the process of dynamic path optimization into two steps: static initial-route design and dynamic route adjustment. In addition, the paper makes the following assumption:(1)
Initial-route design is a static optimization process, and when solving it, the road conditions of each route are assumed to be identical; hence, the travel speed of shared commuter bus is fixed, and it should be noted that this assumption only exists in the initial-route design.(2)
The time of stopping at traffic lights is random and unpredictable, and we do not count the time spent on waiting at traffic lights, so it is ignored in this paper.(3)
Repeated routes will make office workers waste more time, in fact, the shared commuter bus’s driving routes are optimized according to the needs of commuters in a short period of time, and ensure the number of commuters at each stop will not exceed the number of seats. So, we will follow the principle and assume that commuters at the same stop are picked up by one commuter bus.(4)
Dynamic route adjustment is a dynamic optimization process, and assumption (1) is invalid when solving it. The problem studied in this paper belongs to DVRP with real-time traffic information, we focus on dynamic path optimization with the changing road conditions, and the change in the number of commuters is not considered.(5)
When shared commuter bus is in motion, real-time dynamic traffic information is available.In this study, we, thus, solve the three subproblems and develop a “first, set point; then, set line; finally, adjust line” method. In the stop-location problem, the coordinates of commuters’ residences are denoted byQiXi,Yi, and we get the coordinates of stops PiXi,Yi by calculating. In the problem of initial-route design, the Euclidean graph is G=P,A, where P is the collection of nodes and A is the collection of routes, the stop points in P are donated by P∗, and the enterprise points are P′, P=P∗∪P′; the distance from the i-th residence to the j-th residence is cij. In the problem of dynamic route adjustment, the coordinates of key points are denoted by nixi,yi.


### 3.2. Mathematical Model

#### 3.2.1. Parameters

The parameters used in this article are shown in Table1.Table 1
Notations and definitions.
QiCoordinates of residencesQi∗Normalized coordinates of residencesDWalking distance from residences to stopsBiCoordinates of stopsvThe speed of shared commuter buspiNumber of commuters picked up ati-th stationdiNumber of commuters dropped off ati-th stationTisTime taken fors-th vehicle to reach i-th station[TEi, TLi]Acceptable time window fori-th stationNUnit penalty coefficient beyond soft time windowMUnit penalty coefficient beyond hard time windowcijThe shortest distance fromi-th node to j-th nodeniCoordinates of key pointsXs, XrParticle radius vectorsVs, VrParticle velocity vectorspBestIndividual extremumgBestGlobal extremumwInertial weightC1, C2Learning effectsrand ()Random number between 0 and 1


#### 3.2.2. Decision Variables

(1)xijs=1,thes−th commuter car goes directly from stationito stationj,0,otherwise,yis=1,the passengers at stationiare served by thes−th commuter car,0,otherwise.To establish the models from the perspective of the three subproblems, we must establish two models for the first two subproblems and examine the relationship between these two models. The steps used to develop the models are presented in Figure2.Figure 2
Model construction stages.


#### 3.2.3. Shortest Walking Distance Model for Stop Location

By considering office workers’ demands for high efficiency during rush hours, we base the stop locations on the principle of maximum convenience, assessing convenience by comparing the walking distances of commuters. Before establishing the shortest walking distance model, the scope of services for each stop must be determined; only then we can know how many clusters commuters’ residences are to be sorted into. Ak-means clustering method is employed in this study; the coordinates of the residences QiXi,Yi are regarded as the element points to be clustered, and the Euclidean distance is used as the similarity. The clustering process is presented in Figure 3.Figure 3
Steps of thek-means clustering method.Normalization is used to mitigate the influence of the different ranges of elements’ abscissa and ordinate values on the clustering. The normalized coordinates of the commuters’ residences are labeled asQi∗Xi∗,Yi∗. The formulas used to normalize the coordinates are as follows:(2)Xi∗=Xi−minXimaxXi−minXi,Yi∗=Yi−minYimaxYi−minYi.After clustering, we assumed that there were five elements (i.e.,A, B, C, D, and E) in the first cluster, with the coordinates xA,yA, xB,yB, xC,yC, xD,yD, and xE,yE, respectively. The stop coordinates were assumed to be x,y, and the shortest total distance was D; the shortest walking distance model was established as follows:(3)minD=x−xA2+y−yA2+x−xB2+y−yB2+⋯+x−xE2+y−yE2.The optimal solution obtained by solving the shortest walking distance model is an idealized result; real-life urban traffic networks are complicated, and parking is not allowed everywhere. The chosen stop locations must be along roadsides where parking is allowed; hence, we must modify the optimal solution according to the actual traffic situation.


#### 3.2.4. VRP Model for Initial-Route Design

Considering the importance of delivering high efficiency to commuters during rush hours, the optimization aims to minimize the number of shared commuter buses required and the total driving time. The minimum number of shared commuter buses can be estimated using the following formula:(4)s=∑Piq+1.To maximize the driving efficiency of shared commuter buses, we introduce a time window, thereby converting the VRP to a VRP with time windows (VRPTW). The total time cost is split into the driving time and penalty costs. The influence of other external factors on the total driving time is neglected when designing the initial routes; expressed otherwise, the total distance is the only directly influencing factor of the total driving time. Hence, the objective becomes one of finding the shortest distance. The VRP model is established as follows:(5)minZ=∑s=0S∑i=0K∑j=0Kcijxijsv+e1∑i=1K∑s=1SN×maxTis−TLi,0+e2∑i=1K∑s=1SM×maxTis−TLi,0.Such that(6)∑i=1Kyispi−di≤q,s=1,2,…,S,(7)∑s=1Syis=1,i=1,2,…,K,(8)∑i=1Kxijs=yjs,j=1,2,…,K,s=1,2,…,S,(9)∑j=1Kxijs=yis,i=1,2,…,K,s=1,2,…,S,(10)∑i,j∈L×Lxijs≤L−1,(11)Tis≤TLi,i=1,2,…,K,s=1,2,…,S,(12)Tjs=Tis×xijs+∑0i∑0jcijxijsv,i=1,2,…,K,j=1,2,…,K,s=1,2,…,S.In equation (4), we round down numbers to calculate the minimum number of vehicles required. In equation (5), we take the minimal time cost as our optimization objective and divide the time cost into three parts: travel time; penalty time of soft time windows; penalty time of hard time windows. A penalty factor is multiplied when the soft time limit is exceeded, and this penalty factor becomes an infinite positive number when the hard time limit is exceeded. Equation (6) ensures that the commuter buses are not overloaded, and equation (7) guarantees that each stop is considered. Equations (8) and (9) prevent any duplication of the arrangements. In equation (10), the DFJ method is used to eliminate the subcircuits, L is proper subset of all nodes (stop nodes and enterprise nodes) in the route network, and L is the number of elements in L. Equation (11) ensures the accuracy of the time window, and equation (12) calculates the time of arrival at the stops and quantifies the penalty costs outside the time window.


## 3.1. Problem Description

As important nodes in the path network, the stops have a certain influence on the result of vehicle routing problem. When studying the problem of “stop location,” we minimize the walking distance after ensuring all the office workers in need are located within the service range. When dealing with shared commuter bus routing problem, the shared commuter bus’s mixed-load attribute is taken into consideration, the office workers on a commuter bus may not have the same destination, and in other words, some middle nodes in the path network are boarding points, which present stop location; others are drop-off points, which present enterprise location, and how to distinguish and process different nodes in VRP mode is the difficulty.In this study, shared commuter bus routes were optimized to improve driving efficiency. First, we choose appropriate stop locations based on commuters’ residences. Second, we determine the service scope and arrival order of each commuter bus, and the reasonable initial routes are thus formed. Finally, we adjust the commuter bus routes using real-time road condition information. In terms of efficiency and comfort requirements of commuters, overlap between different routes and overloading is prohibited. The number of commuters at the stop is assumed to not vary over a short time period, and in other words, another group of DVRP (VRP with dynamic customer demand) is ignored. The general problem studied in this paper can be divided into three subproblems: stop location, initial-route design, and dynamic route adjustment.Stop location is primarily determined by the number of stops required and commuters’ addresses. In this study, commuters’ addresses are divided into several regions using a clustering algorithm, and a model based on the shortest walking distance is established. We use the Euclidean distance as a standard model metric; this may result in some disparities between the real scenario and the model, owing to the complexity and irregularity of the actual traffic network; however, we assume that these differences are negligible.The objective of the initial-route design is to minimize the travel time in an ideal situation. Take the routes of picking up office workers in the morning peak hour as an example, and the nodes in the route network include the stop nodes and the enterprise nodes. Shared commuter buses reach the stop nodes to take on office workers, and reach enterprise nodes to put them off. The VRP model is established to solve the problem, and the schematic diagram is shown in Figure1. There are often several routes between two stops, and only the shortest one is considered in the process.Figure 1
Schematic diagram of the VRP in a mixed-load mode.The objective of the dynamic route adjustment is to minimize the travel time in a practical situation. In practice, the travel time of the commuter buses cannot be determined by the route lengths, owing to the randomness of congestion and accidents. So, in the process of dynamic route adjustment, we give up the ideal assumption in the initial-route design and take the dynamic traffic information into consideration.Consistent with the traditional solutions to solve dynamic vehicle routing problems, we divide the process of dynamic path optimization into two steps: static initial-route design and dynamic route adjustment. In addition, the paper makes the following assumption:(1)
Initial-route design is a static optimization process, and when solving it, the road conditions of each route are assumed to be identical; hence, the travel speed of shared commuter bus is fixed, and it should be noted that this assumption only exists in the initial-route design.(2)
The time of stopping at traffic lights is random and unpredictable, and we do not count the time spent on waiting at traffic lights, so it is ignored in this paper.(3)
Repeated routes will make office workers waste more time, in fact, the shared commuter bus’s driving routes are optimized according to the needs of commuters in a short period of time, and ensure the number of commuters at each stop will not exceed the number of seats. So, we will follow the principle and assume that commuters at the same stop are picked up by one commuter bus.(4)
Dynamic route adjustment is a dynamic optimization process, and assumption (1) is invalid when solving it. The problem studied in this paper belongs to DVRP with real-time traffic information, we focus on dynamic path optimization with the changing road conditions, and the change in the number of commuters is not considered.(5)
When shared commuter bus is in motion, real-time dynamic traffic information is available.In this study, we, thus, solve the three subproblems and develop a “first, set point; then, set line; finally, adjust line” method. In the stop-location problem, the coordinates of commuters’ residences are denoted byQiXi,Yi, and we get the coordinates of stops PiXi,Yi by calculating. In the problem of initial-route design, the Euclidean graph is G=P,A, where P is the collection of nodes and A is the collection of routes, the stop points in P are donated by P∗, and the enterprise points are P′, P=P∗∪P′; the distance from the i-th residence to the j-th residence is cij. In the problem of dynamic route adjustment, the coordinates of key points are denoted by nixi,yi.


## 3.2. Mathematical Model

### 3.2.1. Parameters

The parameters used in this article are shown in Table1.Table 1
Notations and definitions.
QiCoordinates of residencesQi∗Normalized coordinates of residencesDWalking distance from residences to stopsBiCoordinates of stopsvThe speed of shared commuter buspiNumber of commuters picked up ati-th stationdiNumber of commuters dropped off ati-th stationTisTime taken fors-th vehicle to reach i-th station[TEi, TLi]Acceptable time window fori-th stationNUnit penalty coefficient beyond soft time windowMUnit penalty coefficient beyond hard time windowcijThe shortest distance fromi-th node to j-th nodeniCoordinates of key pointsXs, XrParticle radius vectorsVs, VrParticle velocity vectorspBestIndividual extremumgBestGlobal extremumwInertial weightC1, C2Learning effectsrand ()Random number between 0 and 1


### 3.2.2. Decision Variables

(1)xijs=1,thes−th commuter car goes directly from stationito stationj,0,otherwise,yis=1,the passengers at stationiare served by thes−th commuter car,0,otherwise.To establish the models from the perspective of the three subproblems, we must establish two models for the first two subproblems and examine the relationship between these two models. The steps used to develop the models are presented in Figure2.Figure 2
Model construction stages.


### 3.2.3. Shortest Walking Distance Model for Stop Location

By considering office workers’ demands for high efficiency during rush hours, we base the stop locations on the principle of maximum convenience, assessing convenience by comparing the walking distances of commuters. Before establishing the shortest walking distance model, the scope of services for each stop must be determined; only then we can know how many clusters commuters’ residences are to be sorted into. Ak-means clustering method is employed in this study; the coordinates of the residences QiXi,Yi are regarded as the element points to be clustered, and the Euclidean distance is used as the similarity. The clustering process is presented in Figure 3.Figure 3
Steps of thek-means clustering method.Normalization is used to mitigate the influence of the different ranges of elements’ abscissa and ordinate values on the clustering. The normalized coordinates of the commuters’ residences are labeled asQi∗Xi∗,Yi∗. The formulas used to normalize the coordinates are as follows:(2)Xi∗=Xi−minXimaxXi−minXi,Yi∗=Yi−minYimaxYi−minYi.After clustering, we assumed that there were five elements (i.e.,A, B, C, D, and E) in the first cluster, with the coordinates xA,yA, xB,yB, xC,yC, xD,yD, and xE,yE, respectively. The stop coordinates were assumed to be x,y, and the shortest total distance was D; the shortest walking distance model was established as follows:(3)minD=x−xA2+y−yA2+x−xB2+y−yB2+⋯+x−xE2+y−yE2.The optimal solution obtained by solving the shortest walking distance model is an idealized result; real-life urban traffic networks are complicated, and parking is not allowed everywhere. The chosen stop locations must be along roadsides where parking is allowed; hence, we must modify the optimal solution according to the actual traffic situation.


### 3.2.4. VRP Model for Initial-Route Design

Considering the importance of delivering high efficiency to commuters during rush hours, the optimization aims to minimize the number of shared commuter buses required and the total driving time. The minimum number of shared commuter buses can be estimated using the following formula:(4)s=∑Piq+1.To maximize the driving efficiency of shared commuter buses, we introduce a time window, thereby converting the VRP to a VRP with time windows (VRPTW). The total time cost is split into the driving time and penalty costs. The influence of other external factors on the total driving time is neglected when designing the initial routes; expressed otherwise, the total distance is the only directly influencing factor of the total driving time. Hence, the objective becomes one of finding the shortest distance. The VRP model is established as follows:(5)minZ=∑s=0S∑i=0K∑j=0Kcijxijsv+e1∑i=1K∑s=1SN×maxTis−TLi,0+e2∑i=1K∑s=1SM×maxTis−TLi,0.Such that(6)∑i=1Kyispi−di≤q,s=1,2,…,S,(7)∑s=1Syis=1,i=1,2,…,K,(8)∑i=1Kxijs=yjs,j=1,2,…,K,s=1,2,…,S,(9)∑j=1Kxijs=yis,i=1,2,…,K,s=1,2,…,S,(10)∑i,j∈L×Lxijs≤L−1,(11)Tis≤TLi,i=1,2,…,K,s=1,2,…,S,(12)Tjs=Tis×xijs+∑0i∑0jcijxijsv,i=1,2,…,K,j=1,2,…,K,s=1,2,…,S.In equation (4), we round down numbers to calculate the minimum number of vehicles required. In equation (5), we take the minimal time cost as our optimization objective and divide the time cost into three parts: travel time; penalty time of soft time windows; penalty time of hard time windows. A penalty factor is multiplied when the soft time limit is exceeded, and this penalty factor becomes an infinite positive number when the hard time limit is exceeded. Equation (6) ensures that the commuter buses are not overloaded, and equation (7) guarantees that each stop is considered. Equations (8) and (9) prevent any duplication of the arrangements. In equation (10), the DFJ method is used to eliminate the subcircuits, L is proper subset of all nodes (stop nodes and enterprise nodes) in the route network, and L is the number of elements in L. Equation (11) ensures the accuracy of the time window, and equation (12) calculates the time of arrival at the stops and quantifies the penalty costs outside the time window.


## 3.2.1. Parameters

The parameters used in this article are shown in Table1.Table 1
Notations and definitions.
QiCoordinates of residencesQi∗Normalized coordinates of residencesDWalking distance from residences to stopsBiCoordinates of stopsvThe speed of shared commuter buspiNumber of commuters picked up ati-th stationdiNumber of commuters dropped off ati-th stationTisTime taken fors-th vehicle to reach i-th station[TEi, TLi]Acceptable time window fori-th stationNUnit penalty coefficient beyond soft time windowMUnit penalty coefficient beyond hard time windowcijThe shortest distance fromi-th node to j-th nodeniCoordinates of key pointsXs, XrParticle radius vectorsVs, VrParticle velocity vectorspBestIndividual extremumgBestGlobal extremumwInertial weightC1, C2Learning effectsrand ()Random number between 0 and 1


## 3.2.2. Decision Variables

(1)xijs=1,thes−th commuter car goes directly from stationito stationj,0,otherwise,yis=1,the passengers at stationiare served by thes−th commuter car,0,otherwise.To establish the models from the perspective of the three subproblems, we must establish two models for the first two subproblems and examine the relationship between these two models. The steps used to develop the models are presented in Figure2.Figure 2
Model construction stages.


## 3.2.3. Shortest Walking Distance Model for Stop Location

By considering office workers’ demands for high efficiency during rush hours, we base the stop locations on the principle of maximum convenience, assessing convenience by comparing the walking distances of commuters. Before establishing the shortest walking distance model, the scope of services for each stop must be determined; only then we can know how many clusters commuters’ residences are to be sorted into. Ak-means clustering method is employed in this study; the coordinates of the residences QiXi,Yi are regarded as the element points to be clustered, and the Euclidean distance is used as the similarity. The clustering process is presented in Figure 3.Figure 3
Steps of thek-means clustering method.Normalization is used to mitigate the influence of the different ranges of elements’ abscissa and ordinate values on the clustering. The normalized coordinates of the commuters’ residences are labeled asQi∗Xi∗,Yi∗. The formulas used to normalize the coordinates are as follows:(2)Xi∗=Xi−minXimaxXi−minXi,Yi∗=Yi−minYimaxYi−minYi.After clustering, we assumed that there were five elements (i.e.,A, B, C, D, and E) in the first cluster, with the coordinates xA,yA, xB,yB, xC,yC, xD,yD, and xE,yE, respectively. The stop coordinates were assumed to be x,y, and the shortest total distance was D; the shortest walking distance model was established as follows:(3)minD=x−xA2+y−yA2+x−xB2+y−yB2+⋯+x−xE2+y−yE2.The optimal solution obtained by solving the shortest walking distance model is an idealized result; real-life urban traffic networks are complicated, and parking is not allowed everywhere. The chosen stop locations must be along roadsides where parking is allowed; hence, we must modify the optimal solution according to the actual traffic situation.


## 3.2.4. VRP Model for Initial-Route Design

Considering the importance of delivering high efficiency to commuters during rush hours, the optimization aims to minimize the number of shared commuter buses required and the total driving time. The minimum number of shared commuter buses can be estimated using the following formula:(4)s=∑Piq+1.To maximize the driving efficiency of shared commuter buses, we introduce a time window, thereby converting the VRP to a VRP with time windows (VRPTW). The total time cost is split into the driving time and penalty costs. The influence of other external factors on the total driving time is neglected when designing the initial routes; expressed otherwise, the total distance is the only directly influencing factor of the total driving time. Hence, the objective becomes one of finding the shortest distance. The VRP model is established as follows:(5)minZ=∑s=0S∑i=0K∑j=0Kcijxijsv+e1∑i=1K∑s=1SN×maxTis−TLi,0+e2∑i=1K∑s=1SM×maxTis−TLi,0.Such that(6)∑i=1Kyispi−di≤q,s=1,2,…,S,(7)∑s=1Syis=1,i=1,2,…,K,(8)∑i=1Kxijs=yjs,j=1,2,…,K,s=1,2,…,S,(9)∑j=1Kxijs=yis,i=1,2,…,K,s=1,2,…,S,(10)∑i,j∈L×Lxijs≤L−1,(11)Tis≤TLi,i=1,2,…,K,s=1,2,…,S,(12)Tjs=Tis×xijs+∑0i∑0jcijxijsv,i=1,2,…,K,j=1,2,…,K,s=1,2,…,S.In equation (4), we round down numbers to calculate the minimum number of vehicles required. In equation (5), we take the minimal time cost as our optimization objective and divide the time cost into three parts: travel time; penalty time of soft time windows; penalty time of hard time windows. A penalty factor is multiplied when the soft time limit is exceeded, and this penalty factor becomes an infinite positive number when the hard time limit is exceeded. Equation (6) ensures that the commuter buses are not overloaded, and equation (7) guarantees that each stop is considered. Equations (8) and (9) prevent any duplication of the arrangements. In equation (10), the DFJ method is used to eliminate the subcircuits, L is proper subset of all nodes (stop nodes and enterprise nodes) in the route network, and L is the number of elements in L. Equation (11) ensures the accuracy of the time window, and equation (12) calculates the time of arrival at the stops and quantifies the penalty costs outside the time window.


## 4. Solution Algorithms and Processes

When solving path optimization problems, the mathematical model can be solved using several methods, including accurate algorithms, commercial optimization packages (e.g., CPLEX), and heuristic algorithms. If the research scale is large, accurate algorithms and commercial optimization packages are too time-consuming; thus, we chose a heuristic algorithm to solve the VRP.We chose the appropriate algorithms to manage the three subproblems. The change processes of vehicle routes are shown in Figure4. For the stop location, we established the shortest walking distance model; then, we chose the method of steepest descent to solve it. For the initial-route design, we established the VRP model, and PSO was used to solve it. For the dynamic route adjustment, we simply used Dijkstra’s algorithm in combination with actual road condition information. The specific steps for using the algorithms are presented in Figure 5.Figure 4
Changes in vehicle routes.Figure 5
Algorithm flowchart.


### 4.1. Stop Location (Steepest Descent Method)

The shortest walking distance model was proposed by Cauchy; it is an unconstrained optimization problem containing two variables, and it is often solved by partial derivation. However, when the amount of data is too large to be solved by calculation, the partial derivation is no longer appropriate. The steepest descent method (also referred to as the gradient algorithm) can solve the unconstrained optimization problems with large amount of data quickly, and it is very important to decide the gradient. Since the stop-location objective is to minimize walking distance, we choose a negative gradient, and the feasible solution is iterated (along the negative gradient orientation) using a certain step length, until the lowest point is reached. The initial solutionV0 and accuracy eps must be determined before using the steepest descent method. In this study, the steepest descent method was implemented in MATLAB to improve the efficiency.


### 4.2. Initial-Route Design (PSO)

PSO is used to find the initial routes, and its steps are as follows.The first step is to construct the particle expressions. Two questions must be solved for each stop: the first determines which shared commuter bus is responsible for picking up and dropping off the commuters at the specified stop, and the second determines the ordering of the stops that the shared commuter bus visits. The routes can be determined from the number of buses and the order of the stops. The number of buses is represented asXs, the stop ordering is represented as Xr, and the velocity vectors of the particles are represented as Vs and Vr.The second step is to determine the initial positions and velocities of the particles. In this study, a stop is regarded as a dimension. For the radius vector of each particle, the dimensions ofXs take an integer ranging from 1 to S, and each dimension of Xr takes a real number ranging from 1 to K. For the velocity vector of each particle, the dimensions of Vs take an integer ranging from −(S − 1) to (S − 1), and each dimension of Vr takes a real number ranging from − (K − 1) to (K − 1).The third step is to update the positions and velocities of the particles. The vectors of the particles should be updated continually by comparing the individual extremumpBest with the global extremum gBest; the formulas are given below. The velocity of a particle is represented as V, its inertial weight is denoted as w, and typically ranges from 0.1 to 0.9; learning effects are represented as C1 and C2, and rand () represents a random number between 0 and 1:(13)V=w∗V+C1∗rand∗pBEST−Present+C2∗rand∗gBEST−Present,Present=Present+V.


### 4.3. Route Improvement (Dijkstra’s Algorithm)

By considering the dynamic changes in traffic, an appropriate strategy is developed to adjust the initial routes. The premise of path adjustment is that traffic information can be real-timely obtained, while the rapid development of intelligent transportation systems has made it easy. After comparing applicability of the four kinds of updating strategies, we use the key point updating strategy to adjust the initial routes, and the key points are creatively defined as “road intersections and the stops that the shared commuter buses have not reached in the process of driving” in this paper. The reason we set road intersections as key points is that they play an important role in the urban transportation network. U-turns are not allowed on many roads except at intersections, and the shared commuter buses can promptly adjust their route when they get the real-time traffic information. If we choose other updating strategies, such as the regular updating strategy, then we may not respond quickly to sudden traffic problems; if we choose other traffic points as the key points, there are also some invalid routes to get through after we make the decision to adjust initial routes, which waste the travel time of shared commuter buses.As shown in Figure6, suppose the stops are represented as “B” and the key points as “n”; when the shared commuter bus is traversing from B1 to B2, a message describing a sudden accident between n1 and n3 is received; the initial route B1-n1-n3-B2 is adjusted to B1-n1-n2-n3-B2 using Dijkstra’s algorithm. Thus, the route is altered, but the order in which commuters are picked up at each stop remains the same.Figure 6
Dynamic adjustment of routes.Dijkstra’s algorithm is used to obtain the shortest route between two points; it is an expedient method for obtaining the shortest routes in unweighted networks; typically, a specific application of Dijkstra’s algorithm is achieved using the tentative label (T) and permanent label (P). This study implements Dijkstra’s algorithm in MATLAB.


### 4.4. Empirical Analysis

In China, robust urban rail transit systems are installed in large cities; trams, subways, and other transportation modes release a large portion of highway traffic pressure. Medium and small cities are limited by their original urban layouts; thus, it makes more practical sense to choose medium and small cities to study route optimization for shared commuter buses.Qinhuangdao is in the northeast of Hebei Province; it borders the Bohai Sea to the south, Yanshan Mountains to the north, Liaoning Province to the east, and Tianjin to the west. It is located on the border between North China and the Northeast China region, at the center of the Bohai Sea Economy Circle. Favorable geographical conditions and rich ecological resources have brought Qinhuangdao numerous development possibilities. In recent years, Qinhuangdao has undergone rapid economic development, achieving a regional gross domestic product of 163.556 billion yuan in 2018. The annual disposable income per capita reached 24,555 yuan, and the annual disposable income of urban households per capita reached 35,386 yuan. This rapid growth of the economy has driven a continuous increase in urban population and improvements in disposable income. Meanwhile, the demand level for services is rising in line with the improvement of material living standards, and urban traffic is one of the most important aspects of this demand. The number of domestic cars in Qinhuangdao has increased significantly in recent years, with the number of private cars rising to 644,000 in 2018; this has undoubtedly put immense pressure on the urban traffic system.In recent years, traffic jam phenomena during rush hours have become increasingly common in Qinhuangdao, and this has had a considerable impact on the travel habits of people. The layout of Qinhuangdao is quite unique: most residential locations are in central Qinhuangdao, and several large industrial sites are located in a remote development zone. Direct buses between these locations are limited in number and slow. Thus, most office workers choose to commute in private cars, and an excessive number of private cars can result in traffic jams. Therefore, optimizing the routes of shared commuter buses will not only improve their commuting efficiency but also effectively reduce the frequency of private car use; this will reduce traffic congestion and relieve urban traffic pressure.Before beginning path optimization, we conducted a traffic flow analysis on some important road nodes in Qinhuangdao. Through our investigations, we identified several nodes prone to congestion; these are presented in Table2. Taking these nodes as research objects, we collected their road traffic data over set periods of time, as presented in Table 3.Table 2
Survey of traffic jams in Qinhuangdao.
NumberTime of traffic jamLocation of traffic jam1Seven thirty am to eight thirty amFive pm to six twenty pmThe intersection of Qinhuangxi Street and Haiyang Road2Seven thirty am to eight thirty amFive pm to six pmThe main line of Haiyang Road3Seven thirty am to eight thirty amFour pm to five forty pmThe west section of Qinhuangxi Street4Seven thirty am to eight thirty amFour forty pm to five forty pmThe intersection of Jianshe Street and Wenhua Road5Seven thirty am to eight thirty amFive pm to six twenty pmThe intersection of Hebei Street and Minzu Road6Eight am to nine amFive pm to six twenty pmThe Tanghe Park section of Hebei StreetTable 3
Measured traffic data.
NumberTimeFlow (veh/h)Speed (km/h)Occupancy (veh/km)18:00 a.m.73412828:00 a.m.66482438:00 a.m.81323248:00 a.m.72412958:00 a.m.76393168:00 a.m.68.0046.0026.0015:30 p.m.53.0052.0013.0025:30 p.m.46.0063.008.0035:30 p.m.62.0050.0018.0045:30 p.m.57.0058.0010.0055:30 p.m.61.0052.0013.0065:30 p.m.53.0054.0011.00By analyzing the traffic jam congestion points and traffic flow, it can be observed that traffic jams often occur around Qinhuangdao People’s Park. We chose as our research object several residential districts whose residents must pass these traffic jam congestion points to reach their destination.The algorithms were programmed in MATLAB R2018a on a PC (Windows 10, CPU 2.70 Hz, RAM 7.9 GB). To combine them with the actual investigation results, we used the drawing tools to establish a rectangular coordinate system on the map; the points marked on the map were considered the standard of residential information to determine the coordinates of residential locations. The selected residential districts and their corresponding coordinates are presented in Table4.Table 4
Coordinates of the 20 selected residential districts.
NumberResidential districtCoordinatesNormalized coordinates1Tiancheng(0, 6.6)(0, 0.94)33qu(3.5, 6.2)(0.19, 0.88)5Gongyuanli(6.8, 1.8)(0.37, 0.22)7Bijing(8.3, 2.3)(0.45, 0.30)9Jianxinli(11.2, 0.3)(0.61, 0)11Shoufu(11.5, 2.5)(0.63, 0.33)13Hongweili(12.7, 2.8)(0.69, 0.37)15Hejianli(13.8, 4.7)(0.75, 0.66)17Hongjingli(17.5, 0.8)(0.96, 0.07)19Renminli(15.9, 3.9)(0.87, 0.54)2Xuefu(2.2, 7.0)(0.12, 1.0)4Guolingwan(2.4, 5.1)(0.13, 0.72)6Taisheng(7.7, 2.0)(0.42, 0.25)8Hepingli(9.2, 3.0)(0.50, 0.40)10Yingqiuxili(13.5, 0.9)(0.74, 0.09)12Heanli(12.4, 3.5)(0.68, 0.48)14Xianweili(10.8, 5.0)(0.59, 0.70)16Fuwubeili(15.6, 1.6)(0.85, 0.19)18Kangleli(16.0, 3.0)(0.87, 0.40)20Hongqiaoli(18.3, 3.1)(1, 0.42)Considering the limits of the service range of each stop in Qinhuangdao (500 m–800 m), we determined that four to six stops should be established and took five stops as an example to study firstly; hence, the target number of clusters is five. Before analysis, the coordinates must be normalized; the results are presented (to two decimal places) in Table4. Because the choice of the initial clustering center has a large influence on the clustering difficulty, it is necessary to make a preliminary intuitive judgment according to their geographical locations and to select the representative elements. The 1st, 8th, 9th, 12th, and 18th residential districts were selected as the initial clustering centers a, b, c, d, and e, respectively; five clusters (i.e., A, B, C, D, and E) were created. Using the second residential district (Xuefu) as an example, we calculated the Euclidean distance from this district to the initial clustering centers a, b, c, d, and e; the results were 0.134164, 0.710211, 1.113598, 0.764199, and 0.960469, respectively. Thus, Xuefu is classified as belonging to Cluster A. The remaining 14 residential districts were similarly classified. The clustering centers needed to be updated, and their coordinates are as shown in Table 5. We calculated the distances between the 20 residential districts and the five new clustering centers, to cluster again. Finally, the clustering results were not found to change after the third iteration; hence, we considered the final clusters to be stabilized.Table 5
Results for each clustering step.
ClusterA (a)B (b)C (c)D (d)E (e)First cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 1516, 17, 18, 19, 20Clustering center(0, 0.94)(0.50, 0.40)(0.61, 0)(0.68, 0.48)(0.87, 0.40)Second cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 15, 1916, 17, 18, 20Clustering center(0.11, 0.88)(0.48, 0.30)(0.67, 0.04)(0.68, 0.55)(0.91, 0.33)Third cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 15, 1916, 17, 18, 20Clustering center(0.11, 0.88)(0.48, 0.30)(0.67, 0.04)(0.72, 0.55)(0.92, 0.27)For each cluster, a mathematical model based on the shortest walking distance was established. Using ClusterA as an example, the model is expressed as follows:(14)minD=x2+y−6.62+x−2.22+y−7.02+x−3.52+y−6.22+x−2.42+y−5.12.The model was solved using the steepest descent method in MATLAB. After nine iterations, the coordinates of the chosen stop wereBa2.2694,6.3406. Similarly, the coordinates of the other stops were obtained as Bb8.3000,2.3000, Bc12.0241,0.5150, Bd12.6846,3.6159, and Be16.5824,2.1458. Finally, the stop locations were adjusted according to the actual road situation; the final choices were B1 (Volvo), B2 (Bijinghuating), B3 (Wantong Building), B4 (Student House), and B5 (Haisan Building).The industrial sites in Qinhuangdao are geographically decentralized, and it is too difficult to study all of them; thus, the Qinhuangdao Economic and Technological Development Zone (QETDZ) and Qinhuangdao HR-Channel Management Co., Ltd. (QHRM) were taken as representative of the industrial sites; QETDZ was the beginning and end of all routes, and its coordinates wereE19.72,5.86; the coordinates of QHRM were E29.63,4.20. We investigated the number of office workers required to commute from the chosen residential restricts, and the results are shown in Table 6. In addition, we got the message that the business time of QETDZ and QHRM is half past eight, so we took it as the upper limit of each stop’s time window and chose eight as the lower limit. The unit penalty coefficient beyond hard time window M is an infinite number, and the unit penalty coefficient beyond soft time window N is set to 0.25 (15 minutes).Table 6
Coordinates of stops and numbers of office workers.
Stops (enterprise)E1B1B2B3B4B5E2Coordinates(9.72, 2.56)(2.27, 6.34)(8.30, 2.30)(12.02, 0.52)(12.68, 3.62)(16.58, 2.15)(9.62, 2.40)Number (QETDZ/QHRM)043 (43/0)38 (13/26)14 (14/0)15 (15/0)11 (11/0)0In the VRP model for finding the shortest route, there are two objective constraints: the smallest number of shared commuter buses and the shortest travel time. The priority of the former exceeds that of the latter; thus, the number of required shared commuter buses must be estimated before route optimization. We chose a popular medium-sized coach as the shared commuter bus, which contains 45 seats. The minimum number of shared commuter buses can be calculated as 3 using the previous formula. At the same time, we setv to 20 km/h within the allowable speed range for medium-sized coach on urban roads.Particle swarm optimization was implemented in MATLAB to perform iterative searching. The search dimension (D) should be consistent with the number of shared commuter bus, so it was set to 5, the learning effects (C1, C2) were both set to 1.4962, the inertia weight (w) was set to 0.7298, the number of particles in the initial swarm (N) was set to 10, and the maximum number of iterations (maxDT) was set to 100. Finally, we obtained a global extremum (gBest) of 0.6855; the length of the shortest route was found to be 13.71 km. The particle radius vectors are presented in Table 7, from which simple routes can be identified. The first route is from E1 to B1 to E1, the second route is from E1 to B2 to E2 to E1, and the third route is from E1 to B4 to B5 to B3 to E1.Table 7
Obtained particle radius vectors.
StopB1B2B3B4B5E2Xs123332Xr113122When the number of vehicles increases, the number of particles in the initial swarm should be larger to avoid local optimal solutions. Therefore, we changed the number of particles, settingN = 20, 30, and 40 for the initial swarm. The results obtained were the same as those obtained when N = 10. In addition, as w increases, the number of iterations required to obtain the optimal path also increases; however, if w is too small, the program will easily fall into a local optimum. We set the inertia weight as w = 0.2298, 0.5298, and 0.8298 and calculated the results. The results were similar to those of the original, and the accuracy of the results could be judged.To analyze the influence of different stop locations on commuter vehicle path planning, we set the learning factorc1 = c2 = 1.4962, the inertial weight w = 0.7298, the number of particles in the initial swarm N = 10, and the maximum number of iterations maxDT = 100 (unchanged). We solved for the initial-route design for four and six stops (i.e., the number of clustering targets k = 4 or 6 and the search dimension D = 4 or 6). The comparison results are shown in Table 8. It can be observed that the initial path length of the design also differs under a change in the number of stops. When four stops were selected, the actual distance was the shortest, and the shared commuter buses’ driving efficiency was the highest. When six stops were selected, the actual distance was the longest, and the driving efficiency of the shared commuter buses was the lowest.Table 8
Comparative analysis for different numbers of stops.
Number of stopsStop service coverageStop-location coordinatesInitial routeGlobal optimal solution (Gbest)Actual distance (km)4P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P1 ⟶ E1E1 ⟶ P2 ⟶ E2 ⟶ E1P0 ⟶ P3 ⟶ P4 ⟶ P00.610012.20P25, 6, 7, 8, 11(8.30, 2.26)P39, 10, 16, 17(13.50, 0.90)P412, 13, 14, 15, 18, 19, 20(13.99, 3.82)5P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P1 ⟶ E1E1 ⟶ P2 ⟶ E2 ⟶ E1E1 ⟶ P4 ⟶ P5 ⟶ P3 ⟶ E10.685513.71P25, 6, 7, 8, 11(8.30, 2.30)P39, 10(12.02, 0.52)P412, 13, 14, 15, 19(12.68, 3.62)P516, 17, 18, 20(16.58, 2.15)6P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P2 ⟶ P1 ⟶ E2 ⟶ E1E1 ⟶ P5 ⟶ E2 ⟶ E1E1 ⟶ P4 ⟶ P6 ⟶ P3 ⟶ E10.798015.96P25, 6, 7, 8(8.00, 2.20)P39, 10(11.96, 0.50)P411, 12, 13, 15(12.44, 3.40)P514(10.80, 5.00)P616, 17, 18, 19, 20(16.23, 2.81)In order to verify the optimality of solution found by PSO gives the heuristic nature of this algorithm, we compare the results obtained by using the PSO and the precise algorithm. The exact calculation is implemented in Lingo, and the comparison is shown in Table9. When the number of stops is set to 4, 5, and 6, the result of initial-route design found by PSO is equal to the accurate results, but obviously using PSO saves more solution time. In fact, PSO has higher accuracy and faster speed in solving small- and medium-sized optimization problems, but it needs to be improved when large-scale problem comes.Table 9
Computational results of different algorithms.
PSOAccurate algorithmResult (Gbest)Running time (second)ResultRunning time (second)4 stops0.61000.780.61007.805 stops0.68551.200.685512.456 stops0.79801.580.798025.30By comparison, the travel time of the shared commuter buses is the shortest when the number of stops is set to 4, but office workers spend too much time walking to the stops, so we continued our research with five stops. The data for the particle radii vectors can also be restored to the actual expressed node and arrival sequence; the specific initial routes are shown in Figure7. If more shared commuter buses are required, the number of particles in the initial swarm should be increased to avoid local optimal solutions. No specific regulations exist for the number of initial particles, and we sought to ensure the reliability of the results; thus, we changed the number on the basis of our research; N was set to 20, 30, and 40 to calculate three times. All results were the same as the original ones. Furthermore, with an increase in inertial weight, the iteration time will increase and the computational efficiency will decrease; however, it is easy to fall into a local optimum when the inertia weight is too small, so we adjusted the value of w, setting it to 0.2298, 0.5298, and 0.8298. The calculated results are similar to the original ones. This proves the reliability of the empirical results.Figure 7
Design of initial routes for QETDZ and QHRM.The shared commuter buses will follow the optimized initial routes when picking up and dropping off commuters, accepting the real-time traffic information, and adjusting their route once they reach the key points; it is of crucial importance that we know how long the shared commuter bus will take in each route. In this study, we considered a traffic jam encountered in the investigation process to assess the route-adjustment mechanism; the accident occurred on the Jianshe Road between the Student House and the Haisan Building. As shown in Figure8, the junctions on the routes were chosen as the key points; the initial route between Student House and Haisan Building is from B4 to n1 to n2 to n3 to n4 to B5; the third shared commuter bus has passed Student House and is approaching the junction of Youyi Road and Jianshe Street. When it reaches n1, the real-time traffic information of the accident is received, and the initial routes are adjusted. The estimated time fed back by the intelligent transportation system for each route is indicated in Figure 8. The route adjustment is solved using Dijkstra’s algorithm in MATLAB, and the optimal adjusted route is obtained as running from P4 to n1 to n6 to n3 to n4 to P5; expressed otherwise, the third commuter bus reaches the Haisan Building by passing through Youyi Road, the west section of Heping Street, Hongqi Road, the east section of Jianshe Street, and Wenhua Road, respectively.Figure 8
Key points between stops and time consumed on different routes.


## 4.1. Stop Location (Steepest Descent Method)

The shortest walking distance model was proposed by Cauchy; it is an unconstrained optimization problem containing two variables, and it is often solved by partial derivation. However, when the amount of data is too large to be solved by calculation, the partial derivation is no longer appropriate. The steepest descent method (also referred to as the gradient algorithm) can solve the unconstrained optimization problems with large amount of data quickly, and it is very important to decide the gradient. Since the stop-location objective is to minimize walking distance, we choose a negative gradient, and the feasible solution is iterated (along the negative gradient orientation) using a certain step length, until the lowest point is reached. The initial solutionV0 and accuracy eps must be determined before using the steepest descent method. In this study, the steepest descent method was implemented in MATLAB to improve the efficiency.


## 4.2. Initial-Route Design (PSO)

PSO is used to find the initial routes, and its steps are as follows.The first step is to construct the particle expressions. Two questions must be solved for each stop: the first determines which shared commuter bus is responsible for picking up and dropping off the commuters at the specified stop, and the second determines the ordering of the stops that the shared commuter bus visits. The routes can be determined from the number of buses and the order of the stops. The number of buses is represented asXs, the stop ordering is represented as Xr, and the velocity vectors of the particles are represented as Vs and Vr.The second step is to determine the initial positions and velocities of the particles. In this study, a stop is regarded as a dimension. For the radius vector of each particle, the dimensions ofXs take an integer ranging from 1 to S, and each dimension of Xr takes a real number ranging from 1 to K. For the velocity vector of each particle, the dimensions of Vs take an integer ranging from −(S − 1) to (S − 1), and each dimension of Vr takes a real number ranging from − (K − 1) to (K − 1).The third step is to update the positions and velocities of the particles. The vectors of the particles should be updated continually by comparing the individual extremumpBest with the global extremum gBest; the formulas are given below. The velocity of a particle is represented as V, its inertial weight is denoted as w, and typically ranges from 0.1 to 0.9; learning effects are represented as C1 and C2, and rand () represents a random number between 0 and 1:(13)V=w∗V+C1∗rand∗pBEST−Present+C2∗rand∗gBEST−Present,Present=Present+V.


## 4.3. Route Improvement (Dijkstra’s Algorithm)

By considering the dynamic changes in traffic, an appropriate strategy is developed to adjust the initial routes. The premise of path adjustment is that traffic information can be real-timely obtained, while the rapid development of intelligent transportation systems has made it easy. After comparing applicability of the four kinds of updating strategies, we use the key point updating strategy to adjust the initial routes, and the key points are creatively defined as “road intersections and the stops that the shared commuter buses have not reached in the process of driving” in this paper. The reason we set road intersections as key points is that they play an important role in the urban transportation network. U-turns are not allowed on many roads except at intersections, and the shared commuter buses can promptly adjust their route when they get the real-time traffic information. If we choose other updating strategies, such as the regular updating strategy, then we may not respond quickly to sudden traffic problems; if we choose other traffic points as the key points, there are also some invalid routes to get through after we make the decision to adjust initial routes, which waste the travel time of shared commuter buses.As shown in Figure6, suppose the stops are represented as “B” and the key points as “n”; when the shared commuter bus is traversing from B1 to B2, a message describing a sudden accident between n1 and n3 is received; the initial route B1-n1-n3-B2 is adjusted to B1-n1-n2-n3-B2 using Dijkstra’s algorithm. Thus, the route is altered, but the order in which commuters are picked up at each stop remains the same.Figure 6
Dynamic adjustment of routes.Dijkstra’s algorithm is used to obtain the shortest route between two points; it is an expedient method for obtaining the shortest routes in unweighted networks; typically, a specific application of Dijkstra’s algorithm is achieved using the tentative label (T) and permanent label (P). This study implements Dijkstra’s algorithm in MATLAB.


## 4.4. Empirical Analysis

In China, robust urban rail transit systems are installed in large cities; trams, subways, and other transportation modes release a large portion of highway traffic pressure. Medium and small cities are limited by their original urban layouts; thus, it makes more practical sense to choose medium and small cities to study route optimization for shared commuter buses.Qinhuangdao is in the northeast of Hebei Province; it borders the Bohai Sea to the south, Yanshan Mountains to the north, Liaoning Province to the east, and Tianjin to the west. It is located on the border between North China and the Northeast China region, at the center of the Bohai Sea Economy Circle. Favorable geographical conditions and rich ecological resources have brought Qinhuangdao numerous development possibilities. In recent years, Qinhuangdao has undergone rapid economic development, achieving a regional gross domestic product of 163.556 billion yuan in 2018. The annual disposable income per capita reached 24,555 yuan, and the annual disposable income of urban households per capita reached 35,386 yuan. This rapid growth of the economy has driven a continuous increase in urban population and improvements in disposable income. Meanwhile, the demand level for services is rising in line with the improvement of material living standards, and urban traffic is one of the most important aspects of this demand. The number of domestic cars in Qinhuangdao has increased significantly in recent years, with the number of private cars rising to 644,000 in 2018; this has undoubtedly put immense pressure on the urban traffic system.In recent years, traffic jam phenomena during rush hours have become increasingly common in Qinhuangdao, and this has had a considerable impact on the travel habits of people. The layout of Qinhuangdao is quite unique: most residential locations are in central Qinhuangdao, and several large industrial sites are located in a remote development zone. Direct buses between these locations are limited in number and slow. Thus, most office workers choose to commute in private cars, and an excessive number of private cars can result in traffic jams. Therefore, optimizing the routes of shared commuter buses will not only improve their commuting efficiency but also effectively reduce the frequency of private car use; this will reduce traffic congestion and relieve urban traffic pressure.Before beginning path optimization, we conducted a traffic flow analysis on some important road nodes in Qinhuangdao. Through our investigations, we identified several nodes prone to congestion; these are presented in Table2. Taking these nodes as research objects, we collected their road traffic data over set periods of time, as presented in Table 3.Table 2
Survey of traffic jams in Qinhuangdao.
NumberTime of traffic jamLocation of traffic jam1Seven thirty am to eight thirty amFive pm to six twenty pmThe intersection of Qinhuangxi Street and Haiyang Road2Seven thirty am to eight thirty amFive pm to six pmThe main line of Haiyang Road3Seven thirty am to eight thirty amFour pm to five forty pmThe west section of Qinhuangxi Street4Seven thirty am to eight thirty amFour forty pm to five forty pmThe intersection of Jianshe Street and Wenhua Road5Seven thirty am to eight thirty amFive pm to six twenty pmThe intersection of Hebei Street and Minzu Road6Eight am to nine amFive pm to six twenty pmThe Tanghe Park section of Hebei StreetTable 3
Measured traffic data.
NumberTimeFlow (veh/h)Speed (km/h)Occupancy (veh/km)18:00 a.m.73412828:00 a.m.66482438:00 a.m.81323248:00 a.m.72412958:00 a.m.76393168:00 a.m.68.0046.0026.0015:30 p.m.53.0052.0013.0025:30 p.m.46.0063.008.0035:30 p.m.62.0050.0018.0045:30 p.m.57.0058.0010.0055:30 p.m.61.0052.0013.0065:30 p.m.53.0054.0011.00By analyzing the traffic jam congestion points and traffic flow, it can be observed that traffic jams often occur around Qinhuangdao People’s Park. We chose as our research object several residential districts whose residents must pass these traffic jam congestion points to reach their destination.The algorithms were programmed in MATLAB R2018a on a PC (Windows 10, CPU 2.70 Hz, RAM 7.9 GB). To combine them with the actual investigation results, we used the drawing tools to establish a rectangular coordinate system on the map; the points marked on the map were considered the standard of residential information to determine the coordinates of residential locations. The selected residential districts and their corresponding coordinates are presented in Table4.Table 4
Coordinates of the 20 selected residential districts.
NumberResidential districtCoordinatesNormalized coordinates1Tiancheng(0, 6.6)(0, 0.94)33qu(3.5, 6.2)(0.19, 0.88)5Gongyuanli(6.8, 1.8)(0.37, 0.22)7Bijing(8.3, 2.3)(0.45, 0.30)9Jianxinli(11.2, 0.3)(0.61, 0)11Shoufu(11.5, 2.5)(0.63, 0.33)13Hongweili(12.7, 2.8)(0.69, 0.37)15Hejianli(13.8, 4.7)(0.75, 0.66)17Hongjingli(17.5, 0.8)(0.96, 0.07)19Renminli(15.9, 3.9)(0.87, 0.54)2Xuefu(2.2, 7.0)(0.12, 1.0)4Guolingwan(2.4, 5.1)(0.13, 0.72)6Taisheng(7.7, 2.0)(0.42, 0.25)8Hepingli(9.2, 3.0)(0.50, 0.40)10Yingqiuxili(13.5, 0.9)(0.74, 0.09)12Heanli(12.4, 3.5)(0.68, 0.48)14Xianweili(10.8, 5.0)(0.59, 0.70)16Fuwubeili(15.6, 1.6)(0.85, 0.19)18Kangleli(16.0, 3.0)(0.87, 0.40)20Hongqiaoli(18.3, 3.1)(1, 0.42)Considering the limits of the service range of each stop in Qinhuangdao (500 m–800 m), we determined that four to six stops should be established and took five stops as an example to study firstly; hence, the target number of clusters is five. Before analysis, the coordinates must be normalized; the results are presented (to two decimal places) in Table4. Because the choice of the initial clustering center has a large influence on the clustering difficulty, it is necessary to make a preliminary intuitive judgment according to their geographical locations and to select the representative elements. The 1st, 8th, 9th, 12th, and 18th residential districts were selected as the initial clustering centers a, b, c, d, and e, respectively; five clusters (i.e., A, B, C, D, and E) were created. Using the second residential district (Xuefu) as an example, we calculated the Euclidean distance from this district to the initial clustering centers a, b, c, d, and e; the results were 0.134164, 0.710211, 1.113598, 0.764199, and 0.960469, respectively. Thus, Xuefu is classified as belonging to Cluster A. The remaining 14 residential districts were similarly classified. The clustering centers needed to be updated, and their coordinates are as shown in Table 5. We calculated the distances between the 20 residential districts and the five new clustering centers, to cluster again. Finally, the clustering results were not found to change after the third iteration; hence, we considered the final clusters to be stabilized.Table 5
Results for each clustering step.
ClusterA (a)B (b)C (c)D (d)E (e)First cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 1516, 17, 18, 19, 20Clustering center(0, 0.94)(0.50, 0.40)(0.61, 0)(0.68, 0.48)(0.87, 0.40)Second cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 15, 1916, 17, 18, 20Clustering center(0.11, 0.88)(0.48, 0.30)(0.67, 0.04)(0.68, 0.55)(0.91, 0.33)Third cluster1, 2, 3, 45, 6, 7, 8, 119, 1012, 13, 14, 15, 1916, 17, 18, 20Clustering center(0.11, 0.88)(0.48, 0.30)(0.67, 0.04)(0.72, 0.55)(0.92, 0.27)For each cluster, a mathematical model based on the shortest walking distance was established. Using ClusterA as an example, the model is expressed as follows:(14)minD=x2+y−6.62+x−2.22+y−7.02+x−3.52+y−6.22+x−2.42+y−5.12.The model was solved using the steepest descent method in MATLAB. After nine iterations, the coordinates of the chosen stop wereBa2.2694,6.3406. Similarly, the coordinates of the other stops were obtained as Bb8.3000,2.3000, Bc12.0241,0.5150, Bd12.6846,3.6159, and Be16.5824,2.1458. Finally, the stop locations were adjusted according to the actual road situation; the final choices were B1 (Volvo), B2 (Bijinghuating), B3 (Wantong Building), B4 (Student House), and B5 (Haisan Building).The industrial sites in Qinhuangdao are geographically decentralized, and it is too difficult to study all of them; thus, the Qinhuangdao Economic and Technological Development Zone (QETDZ) and Qinhuangdao HR-Channel Management Co., Ltd. (QHRM) were taken as representative of the industrial sites; QETDZ was the beginning and end of all routes, and its coordinates wereE19.72,5.86; the coordinates of QHRM were E29.63,4.20. We investigated the number of office workers required to commute from the chosen residential restricts, and the results are shown in Table 6. In addition, we got the message that the business time of QETDZ and QHRM is half past eight, so we took it as the upper limit of each stop’s time window and chose eight as the lower limit. The unit penalty coefficient beyond hard time window M is an infinite number, and the unit penalty coefficient beyond soft time window N is set to 0.25 (15 minutes).Table 6
Coordinates of stops and numbers of office workers.
Stops (enterprise)E1B1B2B3B4B5E2Coordinates(9.72, 2.56)(2.27, 6.34)(8.30, 2.30)(12.02, 0.52)(12.68, 3.62)(16.58, 2.15)(9.62, 2.40)Number (QETDZ/QHRM)043 (43/0)38 (13/26)14 (14/0)15 (15/0)11 (11/0)0In the VRP model for finding the shortest route, there are two objective constraints: the smallest number of shared commuter buses and the shortest travel time. The priority of the former exceeds that of the latter; thus, the number of required shared commuter buses must be estimated before route optimization. We chose a popular medium-sized coach as the shared commuter bus, which contains 45 seats. The minimum number of shared commuter buses can be calculated as 3 using the previous formula. At the same time, we setv to 20 km/h within the allowable speed range for medium-sized coach on urban roads.Particle swarm optimization was implemented in MATLAB to perform iterative searching. The search dimension (D) should be consistent with the number of shared commuter bus, so it was set to 5, the learning effects (C1, C2) were both set to 1.4962, the inertia weight (w) was set to 0.7298, the number of particles in the initial swarm (N) was set to 10, and the maximum number of iterations (maxDT) was set to 100. Finally, we obtained a global extremum (gBest) of 0.6855; the length of the shortest route was found to be 13.71 km. The particle radius vectors are presented in Table 7, from which simple routes can be identified. The first route is from E1 to B1 to E1, the second route is from E1 to B2 to E2 to E1, and the third route is from E1 to B4 to B5 to B3 to E1.Table 7
Obtained particle radius vectors.
StopB1B2B3B4B5E2Xs123332Xr113122When the number of vehicles increases, the number of particles in the initial swarm should be larger to avoid local optimal solutions. Therefore, we changed the number of particles, settingN = 20, 30, and 40 for the initial swarm. The results obtained were the same as those obtained when N = 10. In addition, as w increases, the number of iterations required to obtain the optimal path also increases; however, if w is too small, the program will easily fall into a local optimum. We set the inertia weight as w = 0.2298, 0.5298, and 0.8298 and calculated the results. The results were similar to those of the original, and the accuracy of the results could be judged.To analyze the influence of different stop locations on commuter vehicle path planning, we set the learning factorc1 = c2 = 1.4962, the inertial weight w = 0.7298, the number of particles in the initial swarm N = 10, and the maximum number of iterations maxDT = 100 (unchanged). We solved for the initial-route design for four and six stops (i.e., the number of clustering targets k = 4 or 6 and the search dimension D = 4 or 6). The comparison results are shown in Table 8. It can be observed that the initial path length of the design also differs under a change in the number of stops. When four stops were selected, the actual distance was the shortest, and the shared commuter buses’ driving efficiency was the highest. When six stops were selected, the actual distance was the longest, and the driving efficiency of the shared commuter buses was the lowest.Table 8
Comparative analysis for different numbers of stops.
Number of stopsStop service coverageStop-location coordinatesInitial routeGlobal optimal solution (Gbest)Actual distance (km)4P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P1 ⟶ E1E1 ⟶ P2 ⟶ E2 ⟶ E1P0 ⟶ P3 ⟶ P4 ⟶ P00.610012.20P25, 6, 7, 8, 11(8.30, 2.26)P39, 10, 16, 17(13.50, 0.90)P412, 13, 14, 15, 18, 19, 20(13.99, 3.82)5P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P1 ⟶ E1E1 ⟶ P2 ⟶ E2 ⟶ E1E1 ⟶ P4 ⟶ P5 ⟶ P3 ⟶ E10.685513.71P25, 6, 7, 8, 11(8.30, 2.30)P39, 10(12.02, 0.52)P412, 13, 14, 15, 19(12.68, 3.62)P516, 17, 18, 20(16.58, 2.15)6P11, 2, 3, 4(2.27, 6.34)E1 ⟶ P2 ⟶ P1 ⟶ E2 ⟶ E1E1 ⟶ P5 ⟶ E2 ⟶ E1E1 ⟶ P4 ⟶ P6 ⟶ P3 ⟶ E10.798015.96P25, 6, 7, 8(8.00, 2.20)P39, 10(11.96, 0.50)P411, 12, 13, 15(12.44, 3.40)P514(10.80, 5.00)P616, 17, 18, 19, 20(16.23, 2.81)In order to verify the optimality of solution found by PSO gives the heuristic nature of this algorithm, we compare the results obtained by using the PSO and the precise algorithm. The exact calculation is implemented in Lingo, and the comparison is shown in Table9. When the number of stops is set to 4, 5, and 6, the result of initial-route design found by PSO is equal to the accurate results, but obviously using PSO saves more solution time. In fact, PSO has higher accuracy and faster speed in solving small- and medium-sized optimization problems, but it needs to be improved when large-scale problem comes.Table 9
Computational results of different algorithms.
PSOAccurate algorithmResult (Gbest)Running time (second)ResultRunning time (second)4 stops0.61000.780.61007.805 stops0.68551.200.685512.456 stops0.79801.580.798025.30By comparison, the travel time of the shared commuter buses is the shortest when the number of stops is set to 4, but office workers spend too much time walking to the stops, so we continued our research with five stops. The data for the particle radii vectors can also be restored to the actual expressed node and arrival sequence; the specific initial routes are shown in Figure7. If more shared commuter buses are required, the number of particles in the initial swarm should be increased to avoid local optimal solutions. No specific regulations exist for the number of initial particles, and we sought to ensure the reliability of the results; thus, we changed the number on the basis of our research; N was set to 20, 30, and 40 to calculate three times. All results were the same as the original ones. Furthermore, with an increase in inertial weight, the iteration time will increase and the computational efficiency will decrease; however, it is easy to fall into a local optimum when the inertia weight is too small, so we adjusted the value of w, setting it to 0.2298, 0.5298, and 0.8298. The calculated results are similar to the original ones. This proves the reliability of the empirical results.Figure 7
Design of initial routes for QETDZ and QHRM.The shared commuter buses will follow the optimized initial routes when picking up and dropping off commuters, accepting the real-time traffic information, and adjusting their route once they reach the key points; it is of crucial importance that we know how long the shared commuter bus will take in each route. In this study, we considered a traffic jam encountered in the investigation process to assess the route-adjustment mechanism; the accident occurred on the Jianshe Road between the Student House and the Haisan Building. As shown in Figure8, the junctions on the routes were chosen as the key points; the initial route between Student House and Haisan Building is from B4 to n1 to n2 to n3 to n4 to B5; the third shared commuter bus has passed Student House and is approaching the junction of Youyi Road and Jianshe Street. When it reaches n1, the real-time traffic information of the accident is received, and the initial routes are adjusted. The estimated time fed back by the intelligent transportation system for each route is indicated in Figure 8. The route adjustment is solved using Dijkstra’s algorithm in MATLAB, and the optimal adjusted route is obtained as running from P4 to n1 to n6 to n3 to n4 to P5; expressed otherwise, the third commuter bus reaches the Haisan Building by passing through Youyi Road, the west section of Heping Street, Hongqi Road, the east section of Jianshe Street, and Wenhua Road, respectively.Figure 8
Key points between stops and time consumed on different routes.


## 5. Discussion from the Managerial Insight

Dynamic path optimization is just a part of managing the sharing commuter bus, the main purpose we focus on the shared commuter bus route optimization is to solve the current hot issues, urban traffic jams make commuting difficult for commuters, and dynamic route optimization is expected to meet the commuting demand of office workers, to drive office workers choose shared commuter bus, and to reduce their reliance on private cars.After investigation, we find that there are many idle vehicles in the city at present, and the transport agency can make full use of these resources. The idle vehicles can be rent to provide commuting service of shared commuter bus, which can greatly reduce the waste of idle resources. The managerial insight of dynamic path optimization is shown in Figure9.Figure 9
The managerial insight of dynamic path optimization.Dynamic path optimization for shared commuter bus belongs to the underlying technology of shared commuter bus, and it provides a more efficient commuting mode for office workers. If an office worker asks for shared commuter bus’s services, he may need to schedule on a sharing platform the day before. The platform needs to collect all the reservation data and analyze the data which are submitted to the platform in a same short period of time, then the framework in this paper is used, the stop location is chosen, and the optimal initial routes in an ideal setting are designed; at the same time, the waiting point and time is fed back to the customer. The enough idle vehicles as shared commuter buses also need to be rent to use, the employed drivers are notified to be responsible for the corresponding driving trip. When the shared commuter bus is running, the decision whether it is necessary to adjust the initial route dynamically should be made, and according to the real-time traffic information obtained by the intelligent transportation system at each key point, a timely feedback should be given if there is any adjustment in the routes.In this way, transportation agency can obtain information of commuters timely, use the information to optimize the route, and give the commuters specific feedback. Because of the rapid exchange and processing of information, the shared commuter bus can design the route according to the demand and adjust the route in real time according to the road condition, and transportation mobility in the network can be greatly improved.


## 6. Conclusions

Because the operating routes of shared commuter buses differ from those of other vehicles, this study modified the traditional DVRP model and considered the influence of stop locations on the VRP. To maximize the travel efficiency of shared commuter buses, we studied the DVRP problem using real-time traffic information and established route optimization models that were more appropriate for shared commuter bus. The PSO and Dijkstra’s algorithm were used to solve the problem, and their effectiveness was validated through empirical analysis of the QETDZ and QHRM.In this study, both DVRP and VRPTW were considered when studying the problem of vehicle path optimization. In essence, this is a loadable and unloadable VRP featuring time windows. In the process of solving the initial path, we considered the driving time costs of the vehicle and the penalty costs of exceeding the time window to ensure the highest efficiency; however, this is slightly idealistic because certain other factors are neglected (e.g., site service time costs). Therefore, the mathematical models should be further improved to ensure high accuracy.



---

*Source: 8874957-2021-05-24.xml*