期刊文献+

基于树搜索的一种动态空间调度方法 被引量:11

Dynamic spatial scheduling approach based on tree-search
下载PDF
导出
摘要 针对大型离散企业产品组装空间调度问题,提出了一种基于树搜索的动态调度方法。该方法同时考虑了空间布置和时间调度两方面因素,在整个调度规划周期内,算法分成两部分:一是调度准备阶段,把调度时间分割成连续的时间段,并通过时间约束条件得到在每个分场地内需要组装的模块候选集,同时得到分场地的初始布局状态;二是局部调度阶段,通过深度优先树搜索的方法,在每个时间片内使用局部调度算法进行空间布置搜索,得出最优调度。该方法简单实用,最后,仿真实验说明了所提方法的有效性。 This paper proposes a dynamic spatial scheduling approach based on tree-search to solve the assembling spatial scheduling problem in the large-sized discrete companies.The approach considers the spatial layout and the time scheduling simultaneously,and in the whole scheduling plan period,the algorithm is divided into two parts:the first is the pre-scheduling stage,the scheduling time is separated into the continual time-slices,and the block candidate set is got via the time constraint, the initial layout status is given at the same time;the second is the partial scheduling stage,with the depth first search,we perform the spatial layout search by the partial schedule algorithm in every time-slice,in order to get the optimal scheduling plan. This approach is simple and useful.Finally,the simulated experiment illustrates the validity of this approach.
作者 郭美娜 李波
出处 《计算机工程与应用》 CSCD 北大核心 2007年第14期180-183,198,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.70572045)~~
关键词 空间布置 动态空间调度 深度优先搜索 spatial layout dynamic spatial scheduling depth first search
  • 相关文献

参考文献6

  • 1Honda K,Mizoguchi F.Automatic spatial layout planning system using a second-generation constraint logic programming language[J].Expert Systems with Applications,1997,13 (4):291-297.
  • 2Park K,Lee K,Park S,et al.Modeling and solving the spatial block scheduling problem in a shipbuilding company[J].Computers Engineering,1996,30(3):357-364.
  • 3Cho K K,Lee Dong-ha,Oum T H,An intelligent spatial planning and scheduling system[C]//Proceedings of the 6th Annual International Conference on Industrial Engineering-Theory,Application,and Practice,San Francisco,CA,USA,November 18-20,2001.
  • 4李波,王秀峰,赵志彦.一种基于遗传算法的最优空间布置方法[J].系统仿真学报,2004,16(8):1845-1848. 被引量:6
  • 5Yang T,Peters B A,Tu Ming-an.Layout design for flexible manufacturing systems considering single-loop directional flow patterns[J].European Journal of Operational Research,2005,164:440-450.
  • 6Lee K.Sufficient search space for spatial expert systems[J].Expert Systems with Applications,2000,19:1-8.

二级参考文献6

  • 1Jan P,Fenyes P,Richter R.Optimal blank nesting using simulated annealing [J].Trans.ASME,1992,114:160-165.
  • 2Vassilios E T,James L G.The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules [J].Computer Methods in Applied Mechanics and Engineering,1995,125:53-70.
  • 3Fujita K,Akagi S,Hirokawa N.Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm [A].Proceedings of ASME Design Automation Conference [C].Albaquerque,New Mexico,U.S.A.,1993,65(1):477-484.
  • 4Su Y X,Zhang C H,Duan B Y.An optimal layout methodology for cold forming rectangular parts using genetic algorithms [J].Robotics and Computer Integrated manufacturing,2001,17:429-433.
  • 5Leung T W,Chan C K,Troutt M D.Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem [J].European Journal of Operational Research,2003,145(3):530-542.
  • 6Chung B K S,Langevin A,Delmaire H.Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems [J].Computers Mathematics Application,1997,34:13-23.

共引文献5

同被引文献95

引证文献11

二级引证文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部