scholarly journals Robust Optimization Model for Single Line Dynamic Bus Dispatching

2021 ◽  
Vol 14 (1) ◽  
pp. 73
Author(s):  
Yingxin Liu ◽  
Xinggang Luo ◽  
Xu Wei ◽  
Yang Yu ◽  
Jiafu Tang

For effective bus operations, it is important to flexibly arrange the departure times of buses at the first station according to real-time passenger flows and traffic conditions. In dynamic bus dispatching research, existing optimization models are usually based on the prediction and simulation of passenger flow data. The bus departure schemes are formulated accordingly, and the passenger arrival rate uncertainty must be considered. Robust optimization is a common and effective method to handle such uncertainty problems. This paper introduces a robust optimization method for single-line dynamic bus scheduling. By setting three scenarios—the benchmark passenger flow, high passenger flow, and low passenger flow—the robust optimization model of dynamic bus departures is established with consideration of different passenger arrival rates in different scenarios. A genetic algorithm (GA) is improved for minimizing the total passenger waiting time. The results obtained by the proposed optimization method are compared with those from a stochastic programming method. The standard deviation of the relative regret value with stochastic optimization is 5.42%, whereas that of the relative regret value with robust optimization is 0.62%. The stability of robust optimization is better, and the fluctuation degree is greatly reduced.

2011 ◽  
Vol 110-116 ◽  
pp. 2866-2871
Author(s):  
Yu Zhang ◽  
Teng Fei Yin

The genetic algorithm discussed in this paper for project scheduling solution to this problem can be obtained the near optimal schedule programs. This has established the objective function and constraints that have a certain scope; it requires the duration of each process that is determined in advance for enterprises. If the project is more familiar with the history with more experience, and more complete database, the project environment can be controlled well. It can accurately determine the time with the construction plan, construction process and the optimization method with the good trial.


Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 5005
Author(s):  
Li ◽  
Zhao ◽  
Geng ◽  
Zhang

Wireless mesh networks (WMNs) can provide flexible wireless connections in smart city, Internet of Things (IoT), and device-to-device (D2D) communications. The performance of WMNs can be greatly enhanced by adopting the multi-radio multi-channel (MR-MC) technique, which enables a node to communicate with more nodes simultaneously. However, increasing the number of data flows will result in network congestion and longer end-to-end delays. In this paper, a distributed rate-control and delay-aware (DRDA) scheduling algorithm is proposed based on a multidimensional conflict graph. To satisfy the arrival rate and delay constraints of a flow, two virtual queues are constructed. All the actual and virtual queues are stabilized by the Lyapunov drift optimization method. The scheduling policy of each flow is optimized only based on the local information. The simulation results show that our proposed algorithm can maintain the stability of all the queues and strictly satisfy the arrival rate and delay constraint of each flow in the network as well.


Author(s):  
Fujun He ◽  
Takehiro Sato ◽  
Bijoy Chand Chatterjee ◽  
Takashi Kurimoto ◽  
Urushidani Shigeo ◽  
...  

2013 ◽  
Vol 756-759 ◽  
pp. 3466-3470
Author(s):  
Xu Min Song ◽  
Qi Lin

The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.


Sign in / Sign up

Export Citation Format

Share Document