基于时间满意的覆盖问题及混合遗传算法实现  

Time-Satisfaction-Based Covering Location Problem and the Application of Hybrid Genetic Algorithm

作　　者：屈波[1] 杨超[2] 马云峰[3] 翁克瑞[2] 

机构地区：[1]郑州航空工业管理学院,河南郑州450008 [2]华中科技大学管理学院,湖北武汉430074 [3]武汉科技大学管理学院,湖北武汉430081

出　　处：《工业工程与管理》2008年第1期31-35,52,共6页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(70471042)

摘　　要：利用时间满意度函数,从顾客角度考虑覆盖半径,从企业角度考虑覆盖比例,提出了比传统集覆盖问题更一般的基于时间满意的覆盖选址问题。通过建立这一问题的整数规划模型,应用混合遗传算法对该问题求解,并同几种被证明为在覆盖选址问题中计算效果较好的启发式算法进行了对比实验分析,实验显示本文的算法策略可以得到高质量的解。This paper defined the time satisfaction function and presented the Time-Satisfaction-Based Covering Location Problem （TSBCLP） which is more general than the classical set covering location problem. We analyzed coverage level on the interests of customer, and considered the percentage of demand to be covered on behalf of the enterprise. Given a discrete network, TSBCLP as an integer programming under the goal of minimizing the total cost of facility construction is formulated, and then provided a mixed genetic algorithm strategies to solve the variety of size of the problem. The result was analyzed after computational experiment and compared with some heuristic algorithms which have been proven to be overall the best in solving set covering location problems. The experiment showed a good performance of mixed genetic algorithm.

关 键 词：运筹学 选址 遗传算法 时间满意 

分 类 号：C931.1[经济管理—管理学]