| 基于循环取料的不确定越库调度模型与算法 |
| |
| 引用本文： | 麦家骥,陈峰.基于循环取料的不确定越库调度模型与算法[J].上海交通大学学报,2011,45(2):159-0163. |
| |
| 作者姓名： | 麦家骥 陈峰 |
| |
| 作者单位： | (上海交通大学 机械与动力工程学院， 上海 200240)
|
| |
| 基金项目： | 国家自然科学基金资助项目(70771063) |
| |
| 摘 要： | 研究运输时间不确定环境下基于循环取料的越库调度问题.对问题建立不确定情况下求解该问题的混合整数规划模型；提出2阶段启发式算法和基于禁忌搜索算法的改进算法来获得近似最优解；通过在小规模和大规模情形下进行数值实验，验证了启发式算法的有效性.
|
| 关 键 词： | 越库调度 不确定情况 循环取料 禁忌搜索 |
| 收稿时间： | 2010-4-1 |
Uncertain Milk Run-Based Cross Docking Scheduling:Model and Algorithms |
| |
| MAI Jia-ji,CHEN Feng.Uncertain Milk Run-Based Cross Docking Scheduling:Model and Algorithms[J].Journal of Shanghai Jiaotong University,2011,45(2):159-0163. |
| |
| Authors: | MAI Jia-ji CHEN Feng |
| |
| Institution: | (School of Mechanical Engineering, Shanghai Jiaotong University, Shanghai 200240, China)
|
| |
| Abstract: | This paper studied a milk run based cross docking scheduling problem with uncertain transportation time.By describing problem formally,a mixed integer linear programming is built under uncertain situation.A two-stage heuristic and a tabu search algorithm are presented.Numerical experiments under small and large scale situations are given to verify efficiencies of the proposed heuristics. |
| |
| Keywords: | cross docking uncertain milk run tabu search |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海交通大学学报》浏览原始摘要信息 |
| 点击此处可从《上海交通大学学报》下载免费的PDF全文 |
