| 受时间限制的运输问题的新算法 |
| |
| 引用本文： | 孙文龙,张发明.受时间限制的运输问题的新算法[J].运筹与管理,2013,22(6):52-56. |
| |
| 作者姓名： | 孙文龙 张发明 |
| |
| 作者单位： | 南昌大学 经济管理学院,江西 南昌 330031 |
| |
| 基金项目： | 国家自然科学基金资助项目(71001048,71361021);国家社会科学基金资助项目(11BGL063);江西省社会科学研究“十二五”规划项目(13GL38);江西省赣鄱555工程。 |
| |
| 摘 要： | 针对现实的物品配送过程中存在着各种各样的外界因素会导致销售时间上的不可预测性的问题,本文在常用的解决受时间限制运输问题的模型的基础上,提出了一种新的解决模型。新模型更适用于较为苛刻的调运时间,相比已有的模型更精确、更适用于现实的市场环境。文中举例说明了该模型的有效性。
|
| 关 键 词： | 运筹学 模型与算法 优先法则 表上作业法 时间限制 运输问题 |
| 收稿时间： | 2012-10-15 |
New Algorithm for The Time Limited Transportation Problem |
| |
| SUN Wen-long,ZHANG Fa-ming.New Algorithm for The Time Limited Transportation Problem[J].Operations Research and Management Science,2013,22(6):52-56. |
| |
| Authors: | SUN Wen-long ZHANG Fa-ming |
| |
| Institution: | School of Economics&Management, Nanchang University, Nanchang 330031, China |
| |
| Abstract: | According to the reality of the goods distribution process where a variety of external factors will lead to the unpredictability of sales time, the authors present a new solving model which is based on the commonly used solution by the models of the time limited transportation problem. The new model is more applicable to the more demanding transporting time. Compared with previous models, it is more accurate, more applicable to the reality of the market environment. A example is given to verify the effectiveness of the model proposed. |
| |
| Keywords: | operations research model and algorithm priority rule table dispatching method time limited transportation problem |
|
| 点击此处可从《运筹与管理》浏览原始摘要信息 |
| 点击此处可从《运筹与管理》下载免费的PDF全文 |
