具有确定覆盖半径的分层轮毂最大覆盖问题

2010 IEEE International Conference on Industrial Engineering and Engineering Management Pub Date : 2010-12-23 DOI:10.1109/IEEM.2010.5674407

R. Sahraeian, E. Korani

{"title":"具有确定覆盖半径的分层轮毂最大覆盖问题","authors":"R. Sahraeian, E. Korani","doi":"10.1109/IEEM.2010.5674407","DOIUrl":null,"url":null,"abstract":"Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand. This paper study the single allocation hierarchical hub maximal covering problem over complete network linking in the first level, that is consists of hub facilities known as central hubs and in the second and third levels are star networks linking the hubs to central hubs and the demand places to hubs or central hubs. The problem assigns every non-hub nodes and hubs to their top level facilities with predetermined cover radiuses, and minimizing the total cost. The cover radiuses computed with a heuristic method finally present a mixed integer programming model for this problem and test the performance of the problem on the CAB data.","PeriodicalId":285694,"journal":{"name":"2010 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"The hierarchical hub maximal covering problem with determinate cover radiuses\",\"authors\":\"R. Sahraeian, E. Korani\",\"doi\":\"10.1109/IEEM.2010.5674407\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand. This paper study the single allocation hierarchical hub maximal covering problem over complete network linking in the first level, that is consists of hub facilities known as central hubs and in the second and third levels are star networks linking the hubs to central hubs and the demand places to hubs or central hubs. The problem assigns every non-hub nodes and hubs to their top level facilities with predetermined cover radiuses, and minimizing the total cost. The cover radiuses computed with a heuristic method finally present a mixed integer programming model for this problem and test the performance of the problem on the CAB data.\",\"PeriodicalId\":285694,\"journal\":{\"name\":\"2010 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2010.5674407\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2010.5674407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

三层分层设施选址问题处理的是任意一层设施的选址问题和给定路由的流量分配问题。如果需求节点位于能够满足其需求的设施的特定半径内，则中心覆盖问题涵盖需求节点。本文研究了第一级由中心枢纽设施组成的完整网络连接的单分配分层枢纽最大覆盖问题，第二级和第三级是将枢纽连接到中心枢纽和需求地点连接到枢纽或中心枢纽的星形网络。该问题将每个非集线器节点和集线器分配到具有预定覆盖半径的顶层设施，并使总成本最小化。用启发式方法计算覆盖半径，最后给出了该问题的混合整数规划模型，并在CAB数据上测试了该问题的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The hierarchical hub maximal covering problem with determinate cover radiuses

Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand. This paper study the single allocation hierarchical hub maximal covering problem over complete network linking in the first level, that is consists of hub facilities known as central hubs and in the second and third levels are star networks linking the hubs to central hubs and the demand places to hubs or central hubs. The problem assigns every non-hub nodes and hubs to their top level facilities with predetermined cover radiuses, and minimizing the total cost. The cover radiuses computed with a heuristic method finally present a mixed integer programming model for this problem and test the performance of the problem on the CAB data.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Industrial Engineering and Engineering Management

自引率

0.00%

发文量