Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: Model formulation and solution approaches

Sadrani, Mohammad; Tirachini, Alejandro; Antoniou, Constantinos

doi:10.1016/j.ejor.2021.07.054

Cited by 27 publications

(7 citation statements)

References 72 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The set of solid edges in the figure represents a match, that is, a possible vehicle scheduling scheme. (5) To ensure the service level of the system, it is necessary to ensure that the number of vehicles of each model in the system is sufficient; (6) After the previous task of the vehicle is over, it stays at the terminal of the previous task and waits for dispatch; (7) During the actual operation, the vehicle is allowed to turn around; (8) The impact on vehicle dispatch due to emergencies and other reasons will not be considered for the time being.…”

Section: Problem Description Based On Weighted Bipartite Graphmentioning

confidence: 99%

“…A good and reliable plan will have a positive impact on many aspects such as enterprise operating cost control, bus operation resource utilization, personnel work efficiency management, and passenger satisfaction evaluation. As an important part of public transport dispatching, vehicle dispatching refers to the rational planning and dispatching of vehicles based on public transport pre-dispatching work [8]. It is of great significance to ensure the smooth progress of the transportation plan, make full use of resources such as saving vehicles, and reduce the operating costs of public transport companies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing Multi-Vehicle Demand-Responsive Bus Dispatching: A Real-Time Reservation-Based Approach

et al. 2023

View full text Add to dashboard Cite

The demand-responsive public transport system with multi-vehicles has the potential to efficiently meet real-time and high-volume transportation needs through effective scheduling. This paper focuses on studying the real-time vehicle scheduling problem, which involves dispatching and controlling different model vehicles uniformly based on generated vehicle number tasks at a given point in time. By considering the immediacy of real-time itinerary tasks, this paper optimizes the vehicle scheduling problem at a single time point. The objective function is to minimize the total operating cost of the system while satisfying constraints such as passenger capacity and vehicle transfer time. To achieve this, a vehicle scheduling optimization model is constructed, and a solution approach is proposed by integrating bipartite graph optimal matching theory and the Kuhn–Munkres algorithm. The effectiveness of the proposed approach is demonstrated by comparing it with a traditional greedy algorithm using the same calculation example. The results show that the optimization method has higher solution efficiency and can generate a scheduling scheme that effectively reduces operating costs, improves transportation efficiency, and optimizes the operation organization process for demand-responsive buses.

show abstract

Section: Problem Description Based On Weighted Bipartite Graphmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimizing Multi-Vehicle Demand-Responsive Bus Dispatching: A Real-Time Reservation-Based Approach

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Real-world transportation systems have limited capacity regarding the number of commuters who can board. Such limitations can alter the optimal despatch of vehicles and headway [49][50][51][52], hence staggered solutions are not necessarily optimal even in the presence of only regular bus stops. Reference [53] deals more explicitly with bunching buses in the form of a newly proposed modular vehicle system.…”

Section: The Effect Of Limited Capacity For the Busesmentioning

confidence: 99%

Synchronising Bus Bunching to the Spikes in Service Demand Reduces Commuters’ Waiting Time

2022

View full text Add to dashboard Cite

Bus bunching is ostensibly regarded as a detrimental phenomenon in bus systems. We study a bus loop with two bus stops, one regular bus stop and one spike bus stop, where bunched buses can outperform staggered buses. The spike bus stop models a bus stop connected to a train or metro service, where passengers arrive in groups at periodic intervals (spikes). We introduce the configuration of synchronised bunched buses, where bunched buses wait for the spike in demand. For a wide range of parameters, synchronised bunched buses outperform perfectly staggered buses in terms of minimising the waiting time of commuters. We present an analytical formulation of the average waiting time in the case of bunched buses, synchronised bunched buses, and perfectly staggered buses with the consideration of different passenger demands, number of buses, and bus capacity. We demonstrate the validity of our analytical results through an agent-based simulation of the bus loop system.

show abstract

“…In the delivery of emergency materials, it is common to allow vehicles to make multiple trips, and it is also widely used in logistics [8], public transportation scheduling [9] and other fields. Cattaruzza et al [10] emphasized that allowing vehicles to make multiple trips can significantly improve vehicle utilization and reduce the number of vehicles required, thereby further reducing fixed costs and overall costs, and the application in life is more realistic.…”

mentioning

confidence: 99%

An Improved Intelligent Auction Mechanism for Emergency Material Delivery

Zhang

Zhu²,

Wang³

et al. 2022

Mathematics

View full text Add to dashboard Cite

Emergency material delivery is vital to disaster emergency rescue. Herein, the framework of the emergency material delivery system (EMDS) with the unmanned aerial vehicle (UAV) as the vehicle is proposed, and the problem is modeled into a multi-trip time-dependent dynamic vehicle routing problem with split-delivery (MTTDDVRP-SD) in combination with the rescue reality, which provides decision support for planning disaster relief material. Due to the universality of dynamic interference in the process of material delivery, an optimization algorithm based on the traditional intelligent auction mechanism is proposed to avoid system performance degradation or even collapse. The algorithm adds pre-authorization and sequential auction mechanisms to the traditional auction mechanism, where the pre-authorization mechanism improves the capability performance of the system when there is no interference during the rescue process and the sequential auction mechanism improves the resilience performance of the system when it faces interferences. Finally, considering three types of interference comprehensively, which includes new task generations, task unexpected changes and UAV’s number decreases, the proposed algorithm is compared with DTAP (DTA based on sequential single item auctions) and CBBA-PR (consensus-based bundle algorithms-partial replanning) algorithms under different dynamic interference intensity scenarios for simulation experimental from two perspectives of the capability performance and resilience performance. The results of Friedman’s test with 99% confidence interval indicate that the proposed algorithm can effectively improve the capability performance and resilience performance of EMDS.

show abstract

Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: Model formulation and solution approaches

Cited by 27 publications

References 72 publications

Optimizing Multi-Vehicle Demand-Responsive Bus Dispatching: A Real-Time Reservation-Based Approach

Optimizing Multi-Vehicle Demand-Responsive Bus Dispatching: A Real-Time Reservation-Based Approach

Synchronising Bus Bunching to the Spikes in Service Demand Reduces Commuters’ Waiting Time

An Improved Intelligent Auction Mechanism for Emergency Material Delivery

Contact Info

Product

Resources

About