東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Hybrid scheduling methods for the ge...

University of Southern California.

Linked to FindBook

Google Book

Amazon

博客來

Hybrid scheduling methods for the general routing problem.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Hybrid scheduling methods for the general routing problem./
Author:	Aldaihani, Majid Mohammad.
Description:	145 p.
Notes:	Adviser: Maged M. Dessouky.
Contained By:	Dissertation Abstracts International63-12B.
Subject:	Engineering, Industrial. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoeng/servlet/advanced?query=3073738
ISBN:	9780493938219

Hybrid scheduling methods for the general routing problem.
Aldaihani, Majid Mohammad.

Hybrid scheduling methods for the general routing problem. - 145 p.

Adviser: Maged M. Dessouky.

Thesis (Ph.D.)--University of Southern California, 2002.

We study an extension to the general routing problem, which deals with integrating fixed route service with the general pick up and delivery problem to create a hybrid routing problem. The primary application for such a service is a dial-a-ride system used by transit agencies to transport disabled or elderly individuals. The main aim of the integration is to have higher productivity and/or less cost while not significantly reducing the customer service level. Due to the combinatorial nature of the problem, we propose a heuristic approach that provides an approximate solution, which is computationally efficient for solving large sized problems.

ISBN: 9780493938219Subjects--Topical Terms:

626639
Engineering, Industrial.

Hybrid scheduling methods for the general routing problem.
LDR:03041nam 2200313 a 45 001 858096
005 20100712
008 100712s2002 ||||||||||||||||| ||eng d
020 $a 9780493938219
035 $a (UMI)AAI3073738
035 $a AAI3073738
040 $a UMI $c UMI
100 1 $a Aldaihani, Majid Mohammad. $3 1025124
245 1 0 $a Hybrid scheduling methods for the general routing problem.
300 $a 145 p.
500 $a Adviser: Maged M. Dessouky.
500 $a Source: Dissertation Abstracts International, Volume: 63-12, Section: B, page: 6030.
502 $a Thesis (Ph.D.)--University of Southern California, 2002.
520 $a We study an extension to the general routing problem, which deals with integrating fixed route service with the general pick up and delivery problem to create a hybrid routing problem. The primary application for such a service is a dial-a-ride system used by transit agencies to transport disabled or elderly individuals. The main aim of the integration is to have higher productivity and/or less cost while not significantly reducing the customer service level. Due to the combinatorial nature of the problem, we propose a heuristic approach that provides an approximate solution, which is computationally efficient for solving large sized problems.
520 $a Our initial solution is first derived using an Insertion procedure. The solution of the Insertion procedure is fed into an Improvement procedure where we try to identify an alternative path for requests that have multiple hybrid paths that can satisfy the demand. The solution from the Improvement procedure is further improved by two system-wide strategies implemented by a Tabu Search technique, which are Re-sequencing (TABU-S) and Re-assigning (TABU-A).
520 $a We tested our heuristics on actual data from a transit agency. The most effective heuristic in terms of the trade-off between solution quality and computation time was TABU-S. The results of the recommended methodology showed that shifting some of the demand to a hybrid service route (18.6% of the requests) reduces the on-demand vehicle distance by 16.6% and the overall customer trip time by 8.7% over the manual schedule provided by the transit agency. However, for these customers who take the hybrid delivery method, their trip time will increase on average by 5.4%.
520 $a In addition to developing algorithms to improve the scheduling of a hybrid system, we also develop a model that aids decision-makers in designing a hybrid network. That is, we determine the optimal number of zones in an area where each zone is served by a number of on-demand vehicles which transfer passengers to a fixed route line if the destination is in a different zone or to its final destination if it is within the same zone.
590 $a School code: 0208.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Operations Research. $3 626629
690 $a 0546
690 $a 0796
710 2 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 63-12B.
790 $a 0208
790 1 0 $a Dessouky, Maged M., $e advisor
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoeng/servlet/advanced?query=3073738