DocumentCode :
397995
Title :
Route planning method for a dial-a-ride problem
Author :
Miyamoto, Takahiro ; Nakatyou, K. ; Kumagai, Shinya
Author_Institution :
Dept. of Electr. Eng., Osaka Univ., Japan
Volume :
4
fYear :
2003
fDate :
5-8 Oct. 2003
Firstpage :
4002
Abstract :
The present paper discusses an online operation planning method for a demand bus system with multiple buses. It is necessary to solve a passengers assignment problem and a routing problem in real time in operating the demand bus system. We propose an agent-base planning method. In the proposed method, an agent exist for each bus, and it solves the routing problem of the bus by a heuristic rule base method, and solves the assignment problem by auction and negotiations among agents. The present paper describes the heuristics of the routing problem, and compares based on computational experiments.
Keywords :
knowledge based systems; real-time systems; road traffic; road vehicles; traffic engineering computing; transportation; agent-based planning; demand bus system; dial-a-ride problem; heuristic rule based method; online operation planning; passengers assignment problem; route planning method; routing problem; Costs; Internet telephony; Mobile robots; Real time systems; Remotely operated vehicles; Road transportation; Routing; Scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2003. IEEE International Conference on
ISSN :
1062-922X
Print_ISBN :
0-7803-7952-7
Type :
conf
DOI :
10.1109/ICSMC.2003.1244513
Filename :
1244513
Link To Document :
بازگشت