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


A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem
Authors:Jingpeng Li  Raymond S. K. Kwan
Affiliation:(1) School of Computer Science & Information Technology, The University of Nottingham, Nottingham, NG8 1BB, U.K.;(2) School of Computing, University of Leeds, Leeds, LS2 9JT, U.K.
Abstract:This paper reports an evolutionary meta-heuristic incorporating fuzzy evaluation for some large-scale set covering problems originating from the public transport industry. First, five factors characterized by fuzzy membership functions are aggregated to evaluate the structure and generally the goodness of a column. This evaluation function is incorporated into a refined greedy algorithm to make column selection in the process of constructing a solution. Secondly, a self-evolving algorithm is designed to guide the constructing heuristic to build an initial solution and then improve it. In each generation an unfit portion of the working solution is removed. Broken solutions are repaired by the constructing heuristic until stopping conditions are reached. Orthogonal experimental design is used to set the system parameters efficiently, by making a small number of trials. Computational results are presented and compared with a mathematical programming method and a GA-based heuristic.
Keywords:set covering  fuzzy subset  evolutionary algorithm  scheduling
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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