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

Inclusion of Mobile Sensors in Water Distribution System Monitoring Operations

JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT 2016年第1期142卷 4015044.1-4015044.1页

作者： Oliker, Nurit Ostfeld, Avi Technion Israel Inst Technol Fac Civil & Environm Engn IL-32000 Haifa Israel

This study describes a binary integer programming model for mutually-operating fixed and mobile sensors in water distribution systems. The proposed method applies a deterministic optimization scheme for maximizing the monitored volume within network clusters. For a given budget, the model determines the ratio of mobile sensors to fixed sensors along with their placement and release strategies. Through assessing the benefit of placing each fixed sensor and the time and location of mobile sensors release, the combination of fixed and mobile sensors is determined. Utilizing mobile sensors for water quality monitoring is still in its infancy. Such sensors are equipped with self-powered sensing, sampling, data acquisition, and wireless transmission units. The model initiates with the combined operation of mobile and fixed sensors. It then explores the benefits of mobile sensors compared to fixed. The two battle of the water sensor networks ( BWSN) are utilized for demonstrating the model's capabilities. Mobile sensors are found to be beneficial to water distribution system monitoring when operated in conjunction with static sensors. (C) 2015 American Society of Civil Engineers.

关键词： Water distribution systems Mobile sensors Fixed sensors binary integer programming Event detection

来源：评论

学校读者我要写书评

暂无评论

On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2009年第unknown期2009卷 251314-251314页

作者： Guo, Wenxuan Huang, Xinming Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity. Copyright (C) 2009 W. Guo and X. Huang.

关键词： Bipartite Graph Relay Node Mobility Model Disaster Area binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Camera Planning for Large Area Surveillance: A Comprehensive Review

引用

ACM COMPUTING SURVEYS 2016年第1期49卷 6-6页

作者： Liu, Junbin Sridharan, Sridha Fookes, Clinton Queensland Univ Technol Sch Elect Engn & Comp Sci 2 George St Brisbane Qld 4000 Australia

With recent advances in consumer electronics and the increasingly urgent need for public security, camera networks have evolved from their early role of providing simple and static monitoring to current complex systems capable of obtaining extensive video information for intelligent processing, such as target localization, identification, and tracking. In all cases, it is of vital importance that the optimal camera configuration (i.e., optimal location, orientation, etc.) is determined before cameras are deployed as a suboptimal placement solution will adversely affect intelligent video surveillance and video analytic algorithms. The optimal configuration may also provide substantial savings on the total number of cameras required to achieve the same level of utility. In this article, we examine most, if not all, of the recent approaches (post 2000) addressing camera placement in a structured manner. We believe that our work can serve as a first point of entry for readers wishing to start researching into this area or engineers who need to design a camera system in practice. To this end, we attempt to provide a complete study of relevant formulation strategies and brief introductions to most commonly used optimization techniques by researchers in this field. We hope our work to be inspirational to spark new ideas in the field.

关键词： Camera planning camera placement optimization binary integer programming swarm intelligence simulated annealing video surveillance

来源：评论

学校读者我要写书评

暂无评论

Making project selection decisions:: A multi-period capital budgeting problem

引用

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE 2002年第3期9卷 301-310页

作者： Benli, ÖS Yavuz, S Calif State Univ Long Beach Dept Informat Syst Long Beach CA 90840 USA Turkish Army Ankara Turkey

Project selection is a major problem in managerial decision making. In this study, a deterministic model that schedules project starts is formulated as a binary integer program. This model is applicable in various settings such as selection of engineering projects in corporate planning, or in other planning environments in which the candidate projects are interdependent. The results of experimental runs with representative data show that the binary integer model can provide the required solutions in a very reasonable amount of time.

关键词： decision making project selection decision support systems planning, programming, and budgeting systems binary integer programming capital budgeting knapsack problems

来源：评论

学校读者我要写书评

暂无评论

Decarbonizing Canada?s remote microgrids

引用

ENERGY 2023年 264卷

作者： Stringer, Thomas Joanis, Marcelin Polytech Montreal Dept Math & Ind Engn CP 6079Succ Ctr Ville Montreal PQ H3C 3A7 Canada CIRANO 1130 Rue Sherbrooke Ouest 1400 Montreal PQ H3A 2M8 Canada

Canada produces most of its electricity using renewables. However, in remote communities that are not con-nected to Southern Canada's main grid, the quasi-totality of microgrids rely on fossil fuels to ensure electricity supply. How much would it cost to decarbonize all of these microgrids? This paper uses a cost-based approach paired with a binary integer optimization model to find the least costly decarbonization solution for each off-grid settlement from now until 2050. By using wind speed and solar irradiance data together with future generation and storage cost estimates, our model determines whether solar or wind is more appropriate for a settlement and at which period it is best to undergo a transition from fossil fuel generation to renewables. Our results show that the cost of decarbonizing Canada's remote microgrids is not prohibitive and which technology and imple-mentation period are cheapest for each settlement. We find that in 2020 wind turbines would be the cheapest option for most settlements, whereas in 2050 solar panels would be the cheapest option for most settlements. Settlements that currently use diesel of heavy fuel to produce electricity should consider undergoing decar-bonization as soon as possible, while those that use natural gas could wait until production and storage tech-nologies become cheaper. Larger settlements and fly-in communities could also be prioritized.

关键词： Microgrid Decarbonization Fossil fuels binary integer programming Renewable energy

来源：评论

学校读者我要写书评

暂无评论

A multi-objective approach to design strategic supply chains and develop responsiveness- efficiency frontiers

引用

INTERNATIONAL JOURNAL OF LOGISTICS MANAGEMENT 2018年第1期29卷 365-386页

作者： AlHusain, Raed Khorramshahgol, Reza Kuwait Univ Shuwaikh Kuwait Kuwait Univ Dept Quantitat Methods & Informat Syst Shuwaikh Kuwait

Purpose The purpose of this paper is twofold. Initially, a multi-objective binary integer programming model is proposed for designing an appropriate supply chain that takes into consideration both responsiveness and efficiency. Then, a responsiveness-cost efficient frontier is generated for the supply chain design that can help organizations find the right balance between responsiveness and efficiency, and hence achieve a strategic fit between organizational strategy and supply chain capabilities. Design/methodology/approach The proposed SC design model used both cross-functional and logistical SC drivers to build a binary integer programming model. To this end, various alternative solutions that correspond to different SC design portfolios were generated and a responsiveness-cost efficient frontier was constructed. Findings Various alternative solutions that correspond to different SC designs were generated and a responsiveness-cost efficient frontier was constructed to help the decision makers to design SC portfolios to achieve a strategic fit between organizational strategy and SC capabilities. Practical implications The proposed methodology enables the decision makers to incorporate both qualitative and quantitative judgements in SC design. The methodology is easy to use and it can be readily implemented by a software. Originality/value The proposed methodology allows for subjective value judgements of the decision makers to be considered in SC design and the efficiency-responsiveness frontier generated by the methodology provides a trade-off to be used when choosing between speed and cost efficiency in SC design.

关键词： Decision making Strategic planning Supply chain management Modelling Distribution management Inventory decisions North America Supply chain design Response time binary integer programming Responsiveness-efficiency frontier

来源：评论

学校读者我要写书评

暂无评论

Reshuffle minimisation to improve storage yard operations efficiency

引用

JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY 2021年第15期15卷 -页

作者： Bisira, Hammed Salhi, Abdellah Univ Essex Dept Math Sci Wivenhoe Pk Colchester CO4 3SQ Essex England

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

关键词： Reshuffle retrieval container terminal binary integer programming heuristic

来源：评论

学校读者我要写书评

暂无评论

The location routing problem for cooling shelters during heat waves

引用

ULTRASONICS SONOCHEMISTRY 2022年第0期88卷

作者： Yoon, Seokho Woo, Seungok Kim, Jaesung Hwang, Seong Wook Kweon, Sang Jin Ulsan Natl Inst Sci & Technol Dept Ind Engn Ulsan 44919 South Korea Sungshin Womens Univ Dept Business Adm Seoul 02844 South Korea

Given the increasing frequency, duration, and intensity of heat waves around the globe, more research is needed on the allocation and operations of cooling shelters for efficient heat mitigation. To address this need, this study considers a cooling shelter operating system that uses shuttle buses to transport heat-vulnerable people and presents a binary integer programming model for the multi-depot location routing problem (LRP) that decides optimal locations of cooling shelters and routes of shuttle buses simultaneously with the objective of minimizing the total operating cost for full accommodation of the heat-vulnerable population. Since the LRP is NP-hard, we further present the simulated annealing to efficiently derive a near-optimal solution. We then validate the proposed methodology with an application to the 14 administrative regions of Ulsan Metropolitan City in the Republic of Korea to assign heat-vulnerable residents and provide them with ride services to the associated cooling shelters. The overall results demonstrate the proposed methodology's competitive performance compared with the traditional two-phased solution approach that separately solves the location problem and routing problem. In particular, our results show that the proposed methodology can save up to 49,000 USD in addressing the cooling shelter location routing problem compared to the two-phased solution approach. Subsequently, a sensitivity analysis is conducted regarding three factors that are likely to impact the effectiveness and efficiency of cooling shelter operations: shuttle bus capacity, traveling cost, and maximum walking distance. Our research provides recommendations for policymakers to carry out the best heat mitigation strategy for their unique circumstances and reduce heat-related illness and death.

关键词： Heat waves Cooling shelter Location routing problem binary integer programming Simulated annealing Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network

引用

INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS 2019年第2期65卷 267-276页

作者： Thomas, Sanu Mathew, Thomaskutty Mahathma Gandhi Univ Fac Sch Technol & Appl Sci Kottayam Kerala India

In a rectilinear route, a moving sink is restricted to travel either horizontally or vertically along the connecting edges. We present a new algorithm that finds the shortest round trip rectilinear route covering the specified nodes in a grid based Wireless Sensor Network. The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph. A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are available. This feature makes the path more suitable for moving objects like Robots, drones and other types of vehicles which carry the moving sink. In the prosed scheme, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The optimal edge set that forms the target path is determined using the binary integer programming.

关键词： Minimum bend Shortest Paths Travelling salesman problem binary integer programming Edge orientation index Vertex Bend Index Vertex-Edge Incident Matrix

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adaptive Streaming over Popularity-driven Caching in Information-Centric Networks

Dynamic Adaptive Streaming over Popularity-driven Caching in...

引用

IEEE International Conference on Communications

作者： Wenjie Li Sharief M. A. Oteafy Hossam S. Hassanein School of Computing Queen's University

ISBN: (纸本)9781467364300

The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this paper, we present a novel strategy in ICNs for adaptive caching of variable video contents tailored to different sizes and bit rates. Our objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, our approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. We incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In our proposed model, named DASCache, we present delay queuing analysis for cached objects, providing a cap on expected delay in accessing video content. In DASCache, we present a binary integer programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, we present an elaborate performance evaluation carried out on ndnSIM, over NS-3.

关键词： Dynamic adaptive streaming Content-centric network In-network caching Optimization Popularity index Queueing analysis binary integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：