語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Heuristic approaches for the integra...
~
Abdelmaguid, Tamer F.
FindBook
Google Book
Amazon
博客來
Heuristic approaches for the integrated inventory distribution problem.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Heuristic approaches for the integrated inventory distribution problem./
作者:
Abdelmaguid, Tamer F.
面頁冊數:
103 p.
附註:
Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3638.
Contained By:
Dissertation Abstracts International65-07B.
標題:
Engineering, Industrial. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3140422
ISBN:
0496875639
Heuristic approaches for the integrated inventory distribution problem.
Abdelmaguid, Tamer F.
Heuristic approaches for the integrated inventory distribution problem.
- 103 p.
Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3638.
Thesis (Ph.D.)--University of Southern California, 2004.
This dissertation addresses the integrated inventory distribution problem (IIDP) in which vehicle routing and inventory holding and backorder decisions for a set of customers are to be made over a specific planning horizon. A single item is distributed to the customers by a heterogeneous fleet of vehicles that start and end their trips at a central depot. The depot is assumed to have sufficient supply of items that can cover all customers' demands throughout the planning horizon. We consider an environment in which the demand at each customer is relatively small compared to the vehicle capacity, and the customers are closely located such that a consolidated shipping strategy is appropriate. The objective is to minimize the total transportation and inventory costs.
ISBN: 0496875639Subjects--Topical Terms:
626639
Engineering, Industrial.
Heuristic approaches for the integrated inventory distribution problem.
LDR
:03121nmm 2200301 4500
001
1850426
005
20051208095318.5
008
130614s2004 eng d
020
$a
0496875639
035
$a
(UnM)AAI3140422
035
$a
AAI3140422
040
$a
UnM
$c
UnM
100
1
$a
Abdelmaguid, Tamer F.
$3
1938352
245
1 0
$a
Heuristic approaches for the integrated inventory distribution problem.
300
$a
103 p.
500
$a
Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3638.
500
$a
Adviser: Maged M. Dessouky.
502
$a
Thesis (Ph.D.)--University of Southern California, 2004.
520
$a
This dissertation addresses the integrated inventory distribution problem (IIDP) in which vehicle routing and inventory holding and backorder decisions for a set of customers are to be made over a specific planning horizon. A single item is distributed to the customers by a heterogeneous fleet of vehicles that start and end their trips at a central depot. The depot is assumed to have sufficient supply of items that can cover all customers' demands throughout the planning horizon. We consider an environment in which the demand at each customer is relatively small compared to the vehicle capacity, and the customers are closely located such that a consolidated shipping strategy is appropriate. The objective is to minimize the total transportation and inventory costs.
520
$a
We provide a mixed integer programming (MIP) formulation and investigate two different lower bounding techniques based on Lagrangian relaxation and Benders' decomposition. A constructive heuristic, based on estimating transportation cost values for each customer in every period, is introduced to provide solutions to the IMP in polynomial time. This constructive heuristic generates solutions in which delivery schedules cover customers' exact demand requirements in future periods. That is, partial fulfillment of a customer's demand in a future period is not considered. An improvement heuristic is developed to allow for such partial delivery schedules, which can provide savings in transportation or shortage costs.
520
$a
120 test problems have been designed and used to benchmark the developed lower bounding and heuristic techniques against the lower and upper bounds obtained by a commercial MIP solver, CPLEX. The experimental results show that the investigated lower bounding techniques do not generate better values compared to CPLEX within 60 minutes of running time. The constructive heuristic can achieve solutions that are on average 30% or less from the optimal. This figure is reduced to 25% when the improvement heuristic is used. Computational time results show that both heuristics generate solutions in few minutes for the largest test problem, which could take weeks to be solved optimally using CPLEX.
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 0
$a
University of Southern California.
$3
700129
773
0
$t
Dissertation Abstracts International
$g
65-07B.
790
1 0
$a
Dessouky, Maged M.,
$e
advisor
790
$a
0208
791
$a
Ph.D.
792
$a
2004
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3140422
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9199940
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入