检索结果-内蒙古大学图书馆

Fair Deployment of an Unmanned Aerial Vehicle Base Station for maximal coverage

IEICE TRANSACTIONS ON COMMUNICATIONS 2019年第10期E102B卷 2014-2020页

作者： Chen, Yancheng Li, Ning Zhong, Xijian Guo, Yan PLA Army Engn Univ Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China

Unmanned aerial vehicle mounted base stations (UAV-BSs) can provide wireless cellular service to ground users in a variety of scenarios. The efficient deployment of such UAV-BSs while optimizing the coverage area is one of the key challenges. We investigate the deployment of UAV-BS to maximize the coverage of ground users, and further analyzes the impact of the deployment of UAV-BS on the fairness of ground users. In this paper, we first calculated the location of the UAV-BS according to the QoS requirements of the ground users, and then the fairness of ground users is taken into account by calculating three different fairness indexes. The performance of two genetic algorithms, namely Standard Genetic Algorithm (SGA) and Multi-Population Genetic Algorithm (MPGA) are compared to solve the optimization problem of UAV-BS deployment. The simulations are presented showing that the performance of the two algorithms, and the fairness performance of the ground users is also given.

关键词： unmanned aerial vehicles base station (UAV-BS) maximal coverage genetic algorithm fairness performance

来源：评论

学校读者我要写书评

暂无评论

A two-level facility location and sizing problem for maximal coverage

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2020年 139卷 106204-000页

作者： Karatas, Mumtaz Dasci, Abdullah Natl Def Univ Naval Acad Ind Engn Dept TR-34940 Istanbul Turkey Bahcesehir Univ Ind Engn Dept TR-34353 Istanbul Turkey Sabanci Univ Sabanci Business Sch TR-34956 Istanbul Turkey

This paper presents a two-stage hierarchical location problem for systems where the lower level facilities act as the first points contact for the customers while the upper level facilities act as suppliers of the lower level facilities that either serve them or provide advanced services to customers. Furthermore, more recent and realistic coverage constructs such as gradual and cooperative covering are included in our setting. Although our problem can be applicable in various settings, the most fitting application is in wireless telecommunication networks to determine the location of base stations and mobile switching centers. We have developed two competing formulations for the problem, each of which involve nonlinear components that are difficult to deal with. We then develop their respective linearizations and tested their performances. These formulations are solved by commercial optimizers for a set of reasonably large problem instances and it is found that majority of the problems can be solved within a maximum of 10% optimality gap within a short time.

关键词： Hierarchical location maximal coverage Gradual covering

来源：评论

学校读者我要写书评

暂无评论

A comparison of p-median and maximal coverage location models with Q-coverage requirement

A comparison of <i>p</i>-median and maximal coverage locatio...

引用

International Conference on Manufacturing Engineering and Materials (ICMEM)

作者： Karatas, Mumtaz Razi, Nasuh Tozan, Hakan Turkish Naval Acad Dept Ind Engn TR-34942 Istanbul Turkey Turkish Naval Acad Inst Naval Sci & Engn TR-34942 Istanbul Turkey

A facility location problem considers locating a certain number of facilities with the objective of finding their best locations. For most real life situations, it is more realistic to consider the requirement of satisfying a demand with multiple facilities in order to ensure a backup supply. The back-up supply is necessary especially for public or emergency service location problems where a covered demand may not be serviced if its designated facility is engaged serving other demands. Moreover, this issue is more likely to occur when the number of demand locations is much higher. In this study we consider two classic location models, the p-median and maximal coverage location, and compare their performances with respect to five decision criteria under Q-coverage requirement. For this purpose we generate random problem instances and solve each instance with both models for different Q-coverage values. Our comparisons reveal the tradeoffs in selecting the location model for a given problem when the decision maker assesses the performance with multiple criteria. (C) 2016 The Authors. Published by Elsevier Ltd.

关键词： Location Problem Facility Problem p-Median maximal coverage

来源：评论

学校读者我要写书评

暂无评论

A MULTI-CRITERIA ASSESSMENT OF THE p-MEDIAN, maximal coverage AND p-CENTER LOCATION MODELS

引用

TEHNICKI VJESNIK-TECHNICAL GAZETTE 2017年 24卷 399-407页

作者： Karatas, Mumtaz Razi, Nasuh Tozan, Hakan Turkish Naval Acad Dept Ind Engn TR-34942 Istanbul Turkey Turkish Naval Acad Inst Naval Sci & Engn TR-34942 Istanbul Turkey Istanbul Medipol Univ Sch Engn & Nat Sci TR-34810 Istanbul Turkey

Location problems consider locating facilities with the objective of finding their best locations. In most real world problems, it is common that a demand node is required to be covered with multiple facilities in order to ensure a backup supply. The backup supply is necessary especially for public or emergency service location problems where a covered demand may not be serviced if it's designated facility is engaged serving other demands. In this study we consider three classic location models, i.e. p-median, maximal coverage and p-center, and compare their performances with respect to seven decision criteria under Q-coverage requirement. For this purpose, we generate multiple problem instances and solve each instance with the three models for different Q-values. Our numerical results reveal the pros and cons of each model to assist decision makers in determining the most promising model with respect to each assessment criteria.

关键词： backup coverage facility location maximal coverage p-center p-median

来源：评论

学校读者我要写书评

暂无评论

A Comparison of p -median and maximal coverage Location Models with Q –coverage Requirement

引用

Procedia Engineering 2016年 149卷 169-176页

作者： Mumtaz Karatas Nasuh Razi Hakan Tozan Department of Industrial Engineering Turkish Naval Academy Istanbul 34942 TURKEY Institute of Naval Science and Engineering Turkish Naval Academy Istanbul 34942 TURKEY

A facility location problem considers locating a certain number of facilities with the objective of finding their best locations. For most real life situations, it is more realistic to consider the requirement of satisfying a demand with multiple facilities in order to ensure a backup supply. The back-up supply is necessary especially for public or emergency service location problems where a covered demand may not be serviced if its designated facility is engaged serving other demands. Moreover, this issue is more likely to occur when the number of demand locations is much higher. In this study we consider two classic location models, the p -median and maximal coverage location, and compare their performances with respect to five decision criteria under Q -coverage requirement. For this purpose we generate random problem instances and solve each instance with both models for different Q -coverage values. Our comparisons reveal the tradeoffs in selecting the location model for a given problem when the decision maker assesses the performance with multiple criteria.

关键词： Location Problem Facility Problem p-Median maximal coverage

来源：评论

学校读者我要写书评

暂无评论

Distributed Sensor Coordination Algorithms for Efficient coverage in a Network of Heterogeneous Mobile Sensors

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2017年第11期62卷 5954-5961页

作者： Mahboubi, Hamid Moezzi, Kaveh Aghdam, Amir G. Sayrafian-Pour, Kamran Harvard John A Paulson Sch Engn & Appl Sci Cambridge MA 02138 USA Pratt & Whitney Canada Longueuil PQ J4G 1A1 Canada Concordia Univ Dept Elect & Comp Engn EV012-179 Montreal PQ H3G 1M8 Canada NIST Gaithersburg MD 20899 USA

Controlled mobility of nodes in mobile sensor networks allows for autonomous deployment and further optimization of network coverage after initial deployment. When sensor nodes have non-identical sensing ranges, more sophisticated optimization techniques should be used to solve for distributed relocation algorithms that maximize coverage. In this work, novel geometric methods are presented to address this problem. The proposed iterative algorithms use the available local information to judiciously relocate mobile sensors to new positions. This process leads to a continuous reduction in the size of coverage gaps throughout the field. Simulation results demonstrate the performance of the proposed algorithms in improving network coverage.

关键词： Mobile sensor networks autonomous relocation maximal coverage distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Bike-sharing stations: A maximal covering location approach

引用

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE 2015年 82卷 216-227页

作者： Frade, Ines Ribeiro, Anabela Univ Coimbra Dept Civil Engn P-3030788 Coimbra Portugal

The promotion of sustainable alternatives to motorized individual mobility has been seen in the past few decades as one of the cornerstones in a strategy to reduce the negative externalities related to the transportation sector. Bicycle sharing is increasingly popular as a sustainable transport system and the number of bike sharing schemes has grown significantly worldwide in recent years. One of the most important elements in implementation of these systems is the location of the stations. In fact the non-optimal locating of bike sharing compromises its success. Municipalities or public-private partnerships are mostly responsible for implementing bike-sharing schemes. The public investment in bicycle mobility (particularly bike-sharing) is complex because it is always subject to a budget. The main concern for public investment is to maximize the benefits through the design and implementation of bike-sharing systems. This work sets out a methodology to help with the decision-making of bike-sharing systems. The research work we present proposes using an optimization method to design the bike sharing system such that it maximizes the demand covered and takes the available budget as a constraint. It combines strategic decisions for locating bike-sharing stations and defining the dimension of the system (stations and number of bicycles) with operational decisions (relocating bicycles). As an outcome, the model determines the optimal location of the bicycle stations, the fleet size, the capacity of the stations and the number of bicycles in each station, considering an initial investment lower than the given budget. In addition, it balances the annual cost of the system and the revenue assuming a possible supplementary budget from the system provider to cover any loss resulting from the shortfall between its operating cost and the revenue from the subscription charges. A case study in Coimbra, Portugal, is presented and discussed. (C) 2015 Elsevier Ltd. All rights reserv

关键词： Bike-sharing Location problem maximal coverage Optimization

来源：评论

学校读者我要写书评

暂无评论

A support tool for planning classrooms considering social distancing between students

引用

COMPUTATIONAL & APPLIED MATHEMATICS 2022年第1期41卷 1-23页

作者： Bortolete, J. C. Bueno, L. F. Butkeraites, R. Chaves, A. A. Collaco, G. Magueta, M. Pelogia, F. J. R. Salles Neto, L. L. Santos, T. S. Silva, T. S. Sobral, F. N. C. Yanasse, H. H. Fed Inst Sao Paulo Dept Math Itaquaquecetuba SP Brazil Univ Fed Sao Paulo Dept Sci & Technol Sao Jose Dos Campos SP Brazil Fed Inst Sao Paulo Dept Math Campos Do Jordao SP Brazil Univ Estadual Maringa Dept Math Maringa PR Brazil

In this paper, we present the online tool http://***, developed to assist the layout planning of classrooms considering the social distancing in the context of the COVID-19 pandemic. We address both the fixed and non-fixed position seat allocation problems. For the first case, we use two integer optimization models and discuss some curiosities about the solutions found. For the case that the seats can be moved freely, we handle the problem with circle packing techniques using continuous non-linear optimization. For these instances, we propose new algorithms, following other packing problems approaches in the literature. In addition, we propose a fast heuristic that provides a good starting point for the optimization procedure and also an efficient configuration ensuring the students positions in lines, which may be of interest to the user. Computational results are presented to illustrate the numerical behavior of the algorithms and models.

关键词： Location problems maximal coverage Overlap control Mathematical model Metaheuristic COVID-19

来源：评论

学校读者我要写书评

暂无评论

Optimizing precipitation station location: a case study of the Jinsha River Basin

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2016年第6期30卷 1207-1227页

作者： Wang, Ke Chen, Nengcheng Tong, Daoqin Wang, Kai Wang, Wei Gong, Jianya Wuhan Univ State Key Lab Informat Engn Surveying Mapping & R Wuhan 430072 Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan Peoples R China Univ Arizona Sch Geog & Dev Tucson AZ USA Changjiang Water Resources Commiss Bur Hydrol Wuhan Peoples R China

Precipitation stations are important components of a hydrological monitoring network. Given their critical role in rainfall forecasting and flood warnings, along with limited observation resources, determining the optimal locations to deploy precipitation stations presents an important problem. In this paper, we use a maximal covering location problem to identify the best precipitation station sites. Considering the terrain conditions and the characteristics of a rainfall network, the original maximal covering location model is modified with the introduction of a set of additional constraints. The minimum density requirement is used to determine a precipitation station's coverage range, and three weighting schemes are used to evaluate each demand object's covering priority. As a typical mountainous watershed with high annual precipitation, the Jinsha River Basin is selected as the study area to test the applicability of the proposed method. Results show that the proposed method is effective for precipitation station configuration optimization, and the model solution achieves higher coverage than the real-world deployment. Compared with the commercial solver CPLEX, a genetic algorithm-based heuristic can significantly reduce the computation time when the problem size is large. Several deployment strategies are also discussed for establishing the optimal configuration of precipitation stations.

关键词： optimal siting minimum density Precipitation station Jinsha River Basin maximal coverage

来源：评论

学校读者我要写书评

暂无评论

A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage

引用

TOP 2016年第1期24卷 206-232页

作者： Karasakal, Esra Silav, Ahmet Middle E Tech Univ Dept Ind Engn TR-06800 Ankara Turkey

In this study, we present a bi-objective facility location model that considers both partial coverage and service to uncovered demands. Due to limited number of facilities to be opened, some of the demand nodes may not be within full or partial coverage distance of a facility. However, a demand node that is not within the coverage distance of a facility should get service from the nearest facility within the shortest possible time. In this model, it is assumed that demand nodes within the predefined distance of opened facilities are fully covered, and after that distance the coverage level decreases linearly. The objectives are defined as the maximization of full and partial coverage, and the minimization of the maximum distance between uncovered demand nodes and their nearest facilities. We develop a new multi-objective genetic algorithm (MOGA) called modified SPEA-II (mSPEA-II). In this method, the fitness function of SPEA-II is modified and the crowding distance of NSGA-II is used. The performance of mSPEA-II is tested on randomly generated problems of different sizes. The results are compared with the solutions of the most well-known MOGAs, NSGA-II and SPEA-II. Computational experiments show that mSPEA-II outperforms both NSGA-II and SPEA-II.

关键词： Multi-objective genetic algorithm Facility location maximal coverage Partial coverage P-center

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：