首页 | 本学科首页   官方微博 | 高级检索  
     检索      

限制情况下装卸工问题的最优解
引用本文:宁爱兵,唐国春,熊小华,马良.限制情况下装卸工问题的最优解[J].数学的实践与认识,2008,38(19).
作者姓名:宁爱兵  唐国春  熊小华  马良
基金项目:国家自然科学基金 , 上海市高校选拔培养优秀青年教师科研专项基金  
摘    要:装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过.现代物流技术迅速发展,促成和推动装卸工问题的提出和研究.装卸工问题是一个新的NP困难的组合优化问题,首先介绍装卸工问题及限制情况下装卸工问题的数学模型,然后分析限制情况下的装卸工问题的性质,最后给出该问题的所有最优解.

关 键 词:组合最优化  装卸工问题  NP困难  限制情况  最优解

The Optimal Solution of the Restricted Case of the Loader Prblem
NING Ai-bing,TANG Guo-chun,XIONG Xiao-hua,MA Liang.The Optimal Solution of the Restricted Case of the Loader Prblem[J].Mathematics in Practice and Theory,2008,38(19).
Authors:NING Ai-bing  TANG Guo-chun  XIONG Xiao-hua  MA Liang
Abstract:The loader problem is a real problem from the logistics technologies. The embryonic form of the problem was proposed and studied by Institute of Mathematics, the Chinese Academy of Sciences, in 1960's. The rapid developments of the modern logistics technologies motivate the presentation and study of the loader problem. The loader problem is a new NP-hard combinatorial optimization problem. In this paper we firstly introduce the mathematical model of the loader problem and the restricted case of the loader problem, then, analyze the mathematical properties of the problem, and, finally, provides all optimal solutions for the restricted case of the loader problem.
Keywords:combinatorial optimization  loader problem  NP hard  restricted case  optimal solution
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号