【摘要】 研究多分配枢纽站集覆盖选址问题(M AHSCP):如何以最少的建站费用选择枢纽站,使所有的O-D流都能够在规定的时间、费用或距离内从供给点任意经过一个或两个枢纽站后到达需求点。通过建立M AHSCP的改进模型,设计求解该问题的分散搜索算法,算法提供了两种组合操作策略,最后给出基于澳大利亚邮政(AP)枢纽中心选址数据包的计算实验。实验表明,分散搜索算法在求解M AHSCP时具有很好的计算效果。同时,实验显示两种组合操作策略分别具有更好的求解效率与求解质量。更多还原

【Abstract】 We consider the multiple allocation hub set covering problem(MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time,cost or distance,what is the optimal way to locate hubs at minimal cost.The paper first proposes a new model for the MAHSCP.Then,provides an intelligent heuristic(approach) based on scatter search with two combination operators.The computational experience shows scatter search works well for MAHSCP.And the two combination operators have the advantages of computational efficiency and solution quality respectively.更多还原