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


Solving dynamic double row layout problem via combining simulated annealing and mathematical programming
Affiliation:1. Modern Educational Technology Center, Minjiang University, Fuzhou 350121, China;2. Department of Mathematics, Minjiang University, Fuzhou 350121, China
Abstract:Double row layout problem (DRLP) is to allocate facilities on two rows separated by a straight aisle. Aiming at the dynamic environment of product processing in practice, we propose a dynamic double-row layout problem (DDRLP) where material flows change over time in different processing periods. A mixed-integer programming model is established for this problem. A methodology combining an improved simulated annealing (ISA) with mathematical programming (MP) is proposed to resolve it. Firstly, a mixed coding scheme is designed to represent both of sequence of facilities and their exact locations. Secondly, an improved simulated annealing algorithm is suggested to produce a solution to DDRLP. Finally, MP is used to improve this solution by determining the optimal exact location for each facility. Experiments show that this methodology is able to obtain the optimal solutions for small size problems and outperforms an exact approach (CPLEX) for problems of realistic size.
Keywords:Double row layout problem  Dynamic layout problem  Simulated annealing algorithm  Mathematical programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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