An Optimization Method of Passenger Assignment for Customized Bus

Yang Cao and Jian Wang

Mathematical Problems in Engineering, 2017, vol. 2017, 1-9

Abstract:

This study proposes an optimization method of passenger assignment on customized buses (CB). Our proposed method guarantees benefits to passengers by balancing the elements of travel time, waiting time, delay, and economic cost. The optimization problem was solved using a Branch and Bound (B&B) algorithm based on the shortest path for the selected stations. A simulation-based evaluation of the proposed optimization method was conducted. We find that a CB service can save 38.33% in average travel time, 38.33% in average waiting time, and 27.78% in delay penalties, all at an acceptable ticket price. The variations are caused by different degrees of busload. A detailed investigation revealed that a CB can significantly reduce travel time, waiting time, and delays, with the degree of benefits showing a decreasing trend with corresponding increases in busload. This finding indicates that CBs with smaller busloads can more flexibly transport passengers and provide a greater level of benefits. At the same time, a small busload strategy can be implemented more easily and in the near future on a test basis in urban China areas.

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/7914753.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/7914753.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7914753

DOI: 10.1155/2017/7914753

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().