東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back to Search results for [ null ]

Switch To: Labeled | MARC Mode | ISBD

Freight routing and containerization...

Chayanupatkul, Apichat.

Linked to FindBook

Google Book

Amazon

博客來

Freight routing and containerization in a package network that accounts for sortation constraints and costs.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Freight routing and containerization in a package network that accounts for sortation constraints and costs./
Author:	Chayanupatkul, Apichat.
Description:	142 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 6027.
Contained By:	Dissertation Abstracts International65-11B.
Subject:	Operations Research. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3155390
ISBN:	0496161652

Freight routing and containerization in a package network that accounts for sortation constraints and costs.
Chayanupatkul, Apichat.

Freight routing and containerization in a package network that accounts for sortation constraints and costs. - 142 p.

Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 6027.

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

In this research, we investigate package transportation routing that accounts for sorting activities at terminals. At each terminal visited, sorting operations are essential to regroup and dispatch incoming shipments from different origins to different destinations. This process is time, labor, and resource intensive. Proper containerization allows shipments to bypass terminals without entering sorting operations. The efficient utilization of sorting facilities, in turn, enables parcel carriers to handle more shipments with existing resources while maintaining the same service level. However, container capacity and limits on alternative routes resulting from bypass may cause the containers to be moved via longer routes.

ISBN: 0496161652Subjects--Topical Terms:

626629
Operations Research.

Freight routing and containerization in a package network that accounts for sortation constraints and costs.
LDR:03225nmm 2200289 4500 001 1850485
005 20051208095326.5
008 130614s2004 eng d
020 $a 0496161652
035 $a (UnM)AAI3155390
035 $a AAI3155390
040 $a UnM $c UnM
100 1 $a Chayanupatkul, Apichat. $3 1938409
245 1 0 $a Freight routing and containerization in a package network that accounts for sortation constraints and costs.
300 $a 142 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 6027.
502 $a Thesis (Ph.D.)--University of Southern California, 2004.
520 $a In this research, we investigate package transportation routing that accounts for sorting activities at terminals. At each terminal visited, sorting operations are essential to regroup and dispatch incoming shipments from different origins to different destinations. This process is time, labor, and resource intensive. Proper containerization allows shipments to bypass terminals without entering sorting operations. The efficient utilization of sorting facilities, in turn, enables parcel carriers to handle more shipments with existing resources while maintaining the same service level. However, container capacity and limits on alternative routes resulting from bypass may cause the containers to be moved via longer routes.
520 $a The objective of this research is to study package routing that accounts for containerization to minimize transportation costs and sorting costs. To obtain container routings, a network is modified so that each arc represents a container group. Three heuristic approaches are developed and evaluated: the grouping heuristic (GH), the forcing constraint heuristic (FCH) and the combined heuristic (CH). The approaches are benchmarked with lower bounds calculated by solving the LP relaxation with forcing constraints. Model extensions for congested periods at hubs and sorting options at source terminals are also proposed. Heuristic approaches that build from the GH and the FCH are developed and examined.
520 $a Experimental results show that the GH is the fastest algorithm and provides solutions within 4% of lower bounds for test cases. The FCH outperforms the GH in terms of solution quality, in which solutions are within 2% of lower bounds for test cases, but it is slower than the GH. As for the CH, computation time is between the GH and the FCH but it yields inferior objective values relative to the FCH and the GH. Sensitivity analysis shows that container capacity has little effect on the solution quality. Sorting costs, however, significantly affect the heuristic performance.
520 $a Results for the model extensions correspond to the results from the core model in which the developed heuristic incorporated with the GH is faster than one with the FCH but yields poorer objective values. Sensitivity analysis shows that increase in sorting costs at source terminals impacts the heuristic performance.
590 $a School code: 0208.
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, Industrial. $3 626639
690 $a 0796
690 $a 0546
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 65-11B.
790 $a 0208
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3155390