國立虎尾科技大學 |

A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas./
Author:	Geevarghese, Kochumman.
Description:	1 online resource (122 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 78-01(E), Section: A.
Contained By:	Dissertation Abstracts International78-01A(E).
Subject:	Transportation. -
Online resource:	click for full text (PQDT)
ISBN:	9781339981420

A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas.
Geevarghese, Kochumman.

A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas. - 1 online resource (122 pages)

Source: Dissertation Abstracts International, Volume: 78-01(E), Section: A.

Thesis (D.P.S.)

Includes bibliographical references

While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the dynamic dial-a-ride system has not been well studied. There have been attempts to extend the static solutions to a dynamic counterpart. But, one inherent problem with the extended solutions is that characteristics of static solutions are carried over to the solutions of a dynamic problem. Current solutions use single depot, and, limits on wait time for service after making the request, have forced many of requests to be rejected. In this research, a new algorithm based on partitions, subjected to limit on wait time for service after making the request, is developed.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781339981420Subjects--Topical Terms:

558117
Transportation.
Index Terms--Genre/Form:

554714
Electronic books.

A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas.
LDR:02525ntm a2200373Ki 4500 001 909630
005 20180426091041.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781339981420
035 $a (MiAaPQ)AAI10142876
035 $a (MiAaPQ)pace.csis:10018
035 $a AAI10142876
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Geevarghese, Kochumman. $3 1180499
245 1 2 $a A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas.
264 0 $c 2016
300 $a 1 online resource (122 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-01(E), Section: A.
500 $a Adviser: Lixin Tao.
502 $a Thesis (D.P.S.) $c Pace University $d 2016.
504 $a Includes bibliographical references
520 $a While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the dynamic dial-a-ride system has not been well studied. There have been attempts to extend the static solutions to a dynamic counterpart. But, one inherent problem with the extended solutions is that characteristics of static solutions are carried over to the solutions of a dynamic problem. Current solutions use single depot, and, limits on wait time for service after making the request, have forced many of requests to be rejected. In this research, a new algorithm based on partitions, subjected to limit on wait time for service after making the request, is developed.
520 $a The proposed algorithm eliminates rejection of any customer request from anywhere in the service area. A combination of an existing scheduling algorithm, like a dynamic basic parallel algorithm, with this newly suggested algorithm is recommended for better performance. This combination is recommended only when the ridership is mixed in density. Three sets of experiments were conducted for evaluation and comparison of scheduling efficiency of the existing dynamic dial-a-ride algorithms and the new partition based algorithm.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Transportation. $3 558117
650 4 $a Computer engineering. $3 569006
650 4 $a Information technology. $3 559429
655 7 $a Electronic books. $2 local $3 554714
690 $a 0709
690 $a 0464
690 $a 0489
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Pace University. $b Seidenberg School of Computer Science and Information Technology. $3 1180500
773 0 $t Dissertation Abstracts International $g 78-01A(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10142876 $z click for full text (PQDT)