中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Designing optimal routing strategies for a manufacturer: a case study

文献类型:期刊论文

作者Zhao, QH; Wang, SY; Xia, GP; Lai, KK
刊名PRODUCTION PLANNING & CONTROL
出版日期2003
卷号14期号:1页码:33-41
关键词transportation system two-stage transportation network dynamic programming model quantitative sensitivity criterion
ISSN号0953-7287
DOI10.1080/0953728031000064750
英文摘要A study of the vehicle transportation system for a manufacturer is presented. An algorithm based on a dynamic programming model is developed so as to find the optimal transportation arrangements referring to the composition of the vehicles as well as the routing of these vehicles. The algorithm is run under the current condition as well as under a number of different scenarios. It is shown the algorithm can solve the problem with reduced computational complexity. The findings and suggestions resulting from the study can help the department manager in reviewing current operations arrangement and determining future operations arrangements.
WOS研究方向Engineering ; Operations Research & Management Science
语种英语
WOS记录号WOS:000182450800003
出版者TAYLOR & FRANCIS LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/18836]  
专题中国科学院数学与系统科学研究院
通讯作者Zhao, QH
作者单位1.Beijing Univ Aeronaut & Astronaut, Sch Econ & Management, Beijing 100083, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
3.City Univ Hong Kong, Dept Management Sci, Kowloon, Hong Kong, Peoples R China
推荐引用方式
GB/T 7714
Zhao, QH,Wang, SY,Xia, GP,et al. Designing optimal routing strategies for a manufacturer: a case study[J]. PRODUCTION PLANNING & CONTROL,2003,14(1):33-41.
APA Zhao, QH,Wang, SY,Xia, GP,&Lai, KK.(2003).Designing optimal routing strategies for a manufacturer: a case study.PRODUCTION PLANNING & CONTROL,14(1),33-41.
MLA Zhao, QH,et al."Designing optimal routing strategies for a manufacturer: a case study".PRODUCTION PLANNING & CONTROL 14.1(2003):33-41.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。