Journal of South China University of Technology(Natural Science Edition) ›› 2019, Vol. 47 ›› Issue (10): 60-74.doi: 10.12141/j.issn.1000-565X.180388

• Mechanical Engineering • Previous Articles     Next Articles

A Discrete Flower Pollination Algorithm for Solving Double-Layer Corridor Allocation Problem

 GUAN Chao1， 2 ZHANG Zeqiang1， 2 LI Yunpeng1， 2 JIA Lin1， 2    

  1.  1． School of Mechanical Engineering，Southwest Jiaotong University，Chengdu 610031，Sichuan，China;  2． Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province，Chengdu 610031，Sichuan，China
  • Received:2018-08-01 Revised:2019-04-04 Online:2019-10-25 Published:2019-09-01
  • Contact: 管超( 1994-) ，男，博士生，主要从事制造系统与智能优化研究． E-mail:17175371524@163.com
  • About author:管超( 1994-) ，男，博士生，主要从事制造系统与智能优化研究．
  • Supported by:
     Supported by the National Natural Science Foundation of China( 51205328， 51675450) ， the Humanities and Social Sciences Research Youth Fund of the Ministry of Education( 18YJC630255) and the Science and Technology Planning Project of Sichuan Province( 2019YFG0285) 

PDF

201

Abstract: Considering the situation that facilities are distributed into multilayers space，a double layer corridor allocation problem was proposed，and the mixedinteger nonlinear programming model was built for this problem． Based on the discrepancy of feasible solutions and complexity of the issue，a discrete flower pollination algorithm was proposed． By redefining the pollination process，the random search process that sets the problem size as the search depth was taken as the global search． In the local optimization stage， the individual updated itself via the exchange pair by following the optimal solution． In order to improve the performance of the algorithm， the thresholds were set in the global search stage to actualize variable neighborhood search by mutating the individual that was in the local optimum，and another threshold was set to improve the efficiency of the solution． The effectiveness of the algorithm was validated by comparing the results that are gotten from two algorithms via solving the 38 benchmark instances． Finally， the improved flower pollination algorithm was applied to solve the corridor allocation problem， and the contrast experiments illustrate that the proposed algorithm possesses more advantages both in quality and efficiency． 

Key words: corridor allocation problem, combinatorial optimization, mixedinteger programming model, discrete flower pollination algorithm, variable neighbourhood search

CLC Number: