大葉大學圖書館 |

登入

回首頁 到查詢結果 [ subject:"Operations Research." ]

An inventory routing problem with pe...

Le, Tung H.

An inventory routing problem with perishable goods.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	An inventory routing problem with perishable goods.
作者:	Le, Tung H.
面頁冊數:	116 p.
附註:	Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: 6529.
Contained By:	Dissertation Abstracts International70-10B.
標題:	Engineering, Industrial.
標題:	Operations Research.
ISBN:	9781109432886
摘要、提要註:	An Inventory Routing Problem (IRP) is a transportation problem in which inventory and routing decisions are determined simultaneously over a given planning time horizon. The objective of IRP is to find (1) when to deliver to a customer, (2) how much to deliver to a customer in a time period, and (3) how to route vehicles such that the sum of transportation and inventory costs is minimized while still meeting customer demands.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3378791

An inventory routing problem with perishable goods.
Le, Tung H.

An inventory routing problem with perishable goods. - 116 p.

Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: 6529.

Thesis (Ph.D.)--Purdue University, 2009.

An Inventory Routing Problem (IRP) is a transportation problem in which inventory and routing decisions are determined simultaneously over a given planning time horizon. The objective of IRP is to find (1) when to deliver to a customer, (2) how much to deliver to a customer in a time period, and (3) how to route vehicles such that the sum of transportation and inventory costs is minimized while still meeting customer demands.

ISBN: 9781109432886Subjects--Topical Terms:

423093
Engineering, Industrial.

An inventory routing problem with perishable goods.
LDR:02953nam 2200349 4500 001 345050
005 20110620110221.5
008 110817s2009 ||||||||||||||||| ||eng d
020 $a 9781109432886
035 $a (UMI)AAI3378791
035 $a AAI3378791
040 $a UMI $c UMI
100 1 $a Le, Tung H. $3 423507
245 1 3 $a An inventory routing problem with perishable goods.
300 $a 116 p.
500 $a Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: 6529.
500 $a Adviser: Yuehwern Yih.
502 $a Thesis (Ph.D.)--Purdue University, 2009.
520 $a An Inventory Routing Problem (IRP) is a transportation problem in which inventory and routing decisions are determined simultaneously over a given planning time horizon. The objective of IRP is to find (1) when to deliver to a customer, (2) how much to deliver to a customer in a time period, and (3) how to route vehicles such that the sum of transportation and inventory costs is minimized while still meeting customer demands.
520 $a We study a variation of IRP in which goods delivered to customers from the warehouse are perishable (PIRP). This work was motivated from the food distribution of the Academic Model for the Prevention and Treatment of HIV (AMPATH) program, a partnership between the medical school of Indian University and Moi University in Kenya.
520 $a Our research explores modeling issues, solution approaches and potential benefits for IRP models with perishable goods. The main contributions exist in four areas: (1) PIRP is formulated a large scale mixed integer problem. This model, to our best knowledge, is the first IRP model with perishable goods. (2) We introduce an innovative column generation approach which can obtain good solutions of PIRP within reasonable time. As a result of solving LP relaxation by column generation, we obtain the strong lower bound on the optimal solution of PIRP. (3) By studying the polyhedral structure of PIRP, we develop three families of valid inequalities for PIRP. The computational results showed that these valid inequalities are effective to strengthen PIRP. (4) We propose a Tabu search algorithm to solve large-scale PIRPs in which the search is done on routing binary variables and continuous variables, the quantities of goods delivered to customers, are determined through a linear programming problem. The computational results showed that the Tabu search algorithm can provide a good heuristic solution.
590 $a School code: 0183.
650 4 $a Engineering, Industrial. $3 423093
650 4 $a Operations Research. $3 423094
690 $a 0546
690 $a 0796
710 2 $a Purdue University. $b Industrial Engineering. $3 423506
773 0 $t Dissertation Abstracts International $g 70-10B.
790 1 0 $a Yih, Yuehwern, $e advisor
790 1 0 $a Jean-Philippe, Richard $e committee member
790 1 0 $a Leyla, Ozsen $e committee member
790 1 0 $a Lee, Seokcheon $e committee member
790 1 0 $a Joseph, Pekny $e committee member
790 $a 0183
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3378791

筆 0 讀者評論

多媒體

多媒體檔案
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3378791

評論

新增評論分享你的心得

Export

取書館別