Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T22:28:42.796Z Has data issue: false hasContentIssue false

Optimal network design for an on-demand transport system

Published online by Cambridge University Press:  31 March 2006

ZHIJIE CAI
Affiliation:
School of Mathematical Sciences, Fudan University, Shanghai 200433, China email: zhijiecai@163.com
XINYAN LI
Affiliation:
School of Mathematical Sciences, Fudan University, Shanghai 200433, China email: zhijiecai@163.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The design of an on-demand transport system with origin and destination matrices is studied. Two objectives are considered; one is to minimize the sum (over all users) of travel time per unit time and the other is to minimize the sum of the total cost of track built. Firstly, we show that even the minimum total cost problem without consideration of the travel time is not a simple minimum spanning tree problem. Then, for the bi-objective problem, we transform one objective to a constraint condition. With this transformation, we transform the bi-objective problem to a single-objective problem and give the optimal solution by the branch and bound method. Finally, we propose a fast approximate algorithm and analyze its complexity.

Information

Type
Papers
Copyright
2006 Cambridge University Press