Custom Bus optimization of docking stations based on partition path selection

Wenyong Li,Tao Wang,Ziwei Yu,Shuo Wei,Xiayun Lu,Yuanqing Zhang

doi:10.1177/1687814017731544

Abstract

The Custom Bus has advantages on punctuality, direct arrival, and economic benefits. It has a good effect on attracting passengers from private cars commuting in city. Due to the unscientific docking stations, the Custom Bus is always ineffective. There are little studies about the optimization of docking stations. Based on the reference to minimum cost maximum flow problem, using the chain of minimum cost increase flow and the Dijkstra algorithm, choosing points by 0-1 planning model, studying the docking forms on multi-origin to multi-destination. Guaranteeing the attendance rate and limited docking stations, to achieve the goals that shortest single path and the highest service rate by arranging the docking stations reasonably. This algorithm has been demonstrated during the process of optimizing Custom Bus docking stations between Guilin’s new and old urban districts.

Highlights

The rapid growth of private car population and its usage lower the use efficiency of resource for public road and reduce the trip proportion of public transportation
The optimized selection of docking stations can maximize the efficiency of Custom Bus, which can be regarded as a way to resolve the network problems of minimum cost maximum flow
We study the stops form of multi-origin and multi-destination, which can be converted to a network problem of minimum cost maximum flow at condition of certain attendance rate and limited number of stops

Summary

Introduction

The rapid growth of private car population and its usage lower the use efficiency of resource for public road and reduce the trip proportion of public transportation. Keywords Custom Bus, optimization of docking stations, minimum cost maximum flow, chain of minimum cost increase flow, Dijkstra algorithm The optimized selection of docking stations can maximize the efficiency of Custom Bus, which can be regarded as a way to resolve the network problems of minimum cost maximum flow.

Results

Conclusion