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

Greedy Target Assignment with Interference Constraints Between Defensive Weapons

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2022年第4期19卷 271-282页

作者： Lee, Daniel Shin, Min Kyu Choi, Han-Lim Korea Adv Inst Sci & Technol Dept Aerosp Engn Daejeon 34141 South Korea

This paper addresses assignment of defensive weapons against a number of incoming targets, particularly when the targets are aiming to a relatively small local area in a high-density manner. The major issue this work tries to deal with is potential interference between the defensive weapons due to short distance between them and/or inclusion within seeker sensing range. The problem is formulated in a time-dependent static weapon-target assignment with operational and interference constraints;a greedy algorithm that features approximate prediction of potential interference. A numerical case study on assignment of defensive interceptor against incoming ballistic objects is presented to demonstrate the efficacy of the proposed method.

关键词： Particle Swarm Optimization Weapon Target Assignment Predicted Impact Point mixed integer linear programming Heading Angle Numerical Simulation Aerodynamic Interference Proportional Navigation Monte Carlo Simulation Target Missiles

来源：评论

学校读者我要写书评

暂无评论

Bus evacuation during no-notice disasters in downtown areas: A case study of the Zhongguancun area, Beijing

引用

Journal of Safety Science and Resilience 2022年第3期3卷 235-242页

作者： Xingang Li Xiaodan Cui Rui Jiang Bin Jia Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing Jiaotong UniversityBeijing 100044China

This paper focuses on the bus evacuation problem with pedestrians’short-distance walking ability between bus stations during no-notice disasters in downtown areas.A mixed-integer linear programming model is proposed to solve this *** objective function is to minimize the evacuation time and number of *** model obtains the flow of evacuees and buses on each arc to the route of buses in the process of ***,a real-time bus evacuation demand estimation method is proposed based on smart card ***,the example of Zhongguancun area in Beijing is used to verify the practicality and validity of the *** results show that pedestrian short-distance walking can effectively reduce casualties and improve the utilization rate of buses.

关键词： No-notice disaster Bus evacuation Short-distance walking mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimization-Time Analysis for Cybersecurity

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2022年第4期19卷 2365-2383页

作者： Zhang, Yunxiao Malacaria, Pasquale Queen Mary Univ London Sch Elect Engn & Comp Sci London E1 4NS England

A mathematical framework to reason about time resilience in cybersecurity is here introduced. We first consider an attacker who is able to mount several multi-stage attacks on the organization: the defender's objective is to select an optimal portfolio of security controls, within a given budget, to withstand the highest number of attacks. The mathematical model is a Markov chain with an initial state called the safe state, intermediate states for all possible attacks (each attack state denoting a probabilistic attack graph), and a sink state denoting a successful attack. The overall defence problem is formulated as a bi-level multi-objective optimization, i.e., the defender selects an optimal portfolio of security controls to mitigate an optimal attacker. In order to determine the probability of success of an attack two cases will be considered: (a) the expected probability of success and (b) the highest probability of success. We refer to these two cases as expected-time analysis and worst-case time analysis, respectively. To solve precisely these bi-level optimizations strong duality and mixed integer linear programming are used. We then extend the framework to investigate resilience in terms of the total duration of the attacks;variations of the previous optimizations are presented to this purpose. Finally numerical evaluations are provided to compare the results obtained from the expected-time analysis and the worst-case time analysis.

关键词： Security Resilience Organizations Optimization Markov processes Analytical models Mathematical model Optimization security Markov processes cyber-security mixed integer linear programming time resilience

来源：评论

学校读者我要写书评

暂无评论

A Heuristic for Load Distribution on Data Center Hierarchy: A MEC Approach

引用

IEEE ACCESS 2022年 10卷 69462-69471页

作者： Vieira, Rafael F. Souza, Daniel Da Silva Da Silva, Marcelino Silva Cardoso, Diego Lisboa Fed Univ Para Postgrad Program Elect Engn BR-66075110 Belem Para Brazil

Mobile Edge Computing (MEC) extends Cloud Computing to the edge of the network, creating a hierarchy of data centers. This paradigm provides computing capacity close to final users, relieves backhaul and the leading network, and serves latency-sensitive applications. When providing computing services at different network levels, it becomes necessary to carry out a more efficient distribution of the resources that come to coexist. A random allocation of these resources can lead to a low service acceptance rate and backhaul overhead problems. Problems like these can be solved with MEC. To maximize the service acceptance and ensure a fair distribution of services in the kinds of servers guaranteeing their quality of service requirements, we propose a MILP (mixed integer linear programming). The model performs an optimal allocation of applications in a two-level hierarchy of data centers: (i) MEC and (ii) cloud computing. On a large scale, the use of MILP becomes unfeasible due to the high computational cost, so we propose a heuristic based on the application profiles. We compare the proposed heuristic with two metaheuristics: (i) Genetic Algorithm and (ii) Particle Swarm Optimization. The solutions are compared in terms of service acceptance rate, large-scale performance, and efficient use of available resources. Results show that the proposed heuristic reaches 91% of the optimal solution and over 140% compared to GA and PSO solutions.

关键词： Servers Cloud computing Resource management Quality of service Task analysis Internet of Things Delays Mobile edge computing cloud computing data center hierarchy mixed integer linear programming genetic algorithm particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

A Recycling Routing Problem of Broken Bikes With Incentives in Bike Sharing Systems

引用

IEEE ACCESS 2022年 10卷 106191-106201页

作者： Xu, Guoxun Zou, An Hainan Univ Sch Tourism Haikou 570228 Hainan Peoples R China

In recent years, the truck-based broken bike recycling mode (i.e., dedicated trucks deal with all transportation activities of broken bikes) in bike sharing systems (BSSs) has led to some problems in China, such as BSS operators have no willingness to collect broken bikes from a bike station in time. As a result, many BSSs are in bad condition due to an increase in the number of broken bikes. To solve this problem, many cities in China have started to introduce a new broken bike recycling mode, where some citizens (i.e., sanitation workers, freelancers, volunteers, etc.) are incentivized to participate in recycling activities. To deal with this new recycling mode, a recycling routing problem of broken bikes with incentives in BSSs is proposed, where the recycling operation is performed by citizen participants and a fleet of homogeneous trucks. Participants are incentivized to relocate broken bikes scattered in a BSS to transshipment stations in exchange for monetary rewards, and then these broken bikes are transported from transshipment stations to the depot by trucks. The problem is formulated as a mixed-integer linear programming model to minimize the total operation cost, and an efficient modified tabu search is developed to solve the proposed problem. Experimental results reveal the proposed broken bike recycling mode is beneficial for BSS operators to reduce the operation cost. Experimental results also show the proposed modified tabu search can generate high-quality solutions in short computing times.

关键词： Bicycles Costs Urban areas Search problems Vehicle routing Transportation Routing mixed integer linear programming Bike sharing vehicle routing problem broken bike mixed-integer linear programming tabu search

来源：评论

学校读者我要写书评

暂无评论

Effect of mitigation technologies on the total cost and carbon dioxide emissions of a cement plant under multi-objective mixed linear programming optimisation

引用

CHEMICAL ENGINEERING RESEARCH & DESIGN 2022年 186卷 326-349页

作者： Ishak, Siti Aktar Hashim, Haslenda Univ Teknol Malaysia UTM Fac Engn Sch Chem & Energy Engn Dept Chem Engn Johor Baharu Johor Malaysia Univ Teknol Malaysia UTM Fac Engn Sch Chem & Energy Engn Green Energy & Environm Planning Res Grp Johor Baharu Johor Malaysia

With the increase of industrial activities in past decades, climate change has been a challenge worldwide. The cement industry is considered one of the industries that generate high carbon dioxide (CO2) emissions. With an imminent increase in CO2 emissions due to increased cement demand, this study proposed a systematic model for a cost-optimal cement plant that fulfils carbon limitations without compromising product specifications. This study considered three mitigation methods for cement manufacturing: co-processing, kiln system improvements, and carbon capture. The mixed integer linear programming model was executed in GAMS. From the optimisation model, it was found that a cement plant with co-processing, kiln improvements, and carbon capture managed to reduce more than 90 % CO2 emissions with USD 135.96/tonne clinker. (C) 2022 Institution of Chemical Engineers. Published by Elsevier Ltd. All rights reserved.

关键词： mixed integer linear programming Cement plant Carbon dioxide mitigation Optimisation Mathematical programming Multi-objective epsilon-constraint method

来源：评论

学校读者我要写书评

暂无评论

The Electric Vehicle Routing Problem with Capacitated Charging Stations

引用

TRANSPORTATION SCIENCE 2022年第2期56卷 460-482页

作者： Froger, Aurelien Jabali, Ola Mendoza, Jorge E. Laporte, Gilbert Univ Bordeaux Bordeaux INP Inst Math Bordeaux CNRSUMR 5251 F-33400 Talence France Politecn Milan Dipt Elet Informaz & Bioingn I-20133 Milan Italy CHEC Montreal Montreal PQ H3T 2A7 Canada Univ Bath Sch Management Bath BA2 7AY Avon England

Electric vehicle routing problems (E-VRPs) deal with routing a fleet of electric vehicles (EVs) to serve a set of customers while minimizing an operational criterion, for example, cost or time. The feasibility of the routes is constrained by the autonomy of the EVs, which may be recharged along the route. Much of the E-VRP research neglects the capacity of charging stations (CSs) and thus implicitly assumes that an unlimited number of EVs can be simultaneously charged at a CS. In this paper, we model and solve E-VRPs considering these capacity restrictions. In particular, we study an E-VRP with nonlinear charging functions, multiple charging technologies, en route charging, and variable charging quantities while explicitly accounting for the number of chargers available at privately managed CSs. We refer to this problem as the E-VRP with nonlinear charging functions and capacitated stations (E-VRP-NL-C). We introduce a continuous-time model formulation for the problem. We then introduce an algorithmic framework that iterates between two main components: (1) the route generator, which uses an iterated local search algorithm to build a pool of high-quality routes, and (2) the solution assembler, which applies a branch-and cut algorithm to combine a subset of routes from the pool into a solution satisfying the capacity constraints. We compare four assembly strategies on a set of instances. We show that our algorithm effectively deals with the E-VRP-NL-C. Furthermore, considering the uncapacitated version of the E-VRP-NL-C, our solution method identifies new best-known solutions for 80 of 120 instances.

关键词： electric vehicle routing nonlinear charging function synchronization constraints mixed integer linear programming matheuristic iterated local search branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

Generative Modeling of Pedestrian Behavior: A Receding Horizon Optimization-Based Trajectory Planning Approach

引用

IEEE ACCESS 2022年 10卷 81624-81641页

作者： Gupta, Saumya Zaki, Mohamed H. Vela, Adan Univ Cent Florida Dept Civil Environm & Construct Engn Orlando FL 32816 USA Univ Cent Florida Dept Ind Engn & Management Syst Orlando FL 32816 USA

Urbanization is bringing together various modes of transport, and with that, there are challenges to maintaining the safety of all road users, especially vulnerable road users (VRUs). There is a need for street designs that encourages cooperation between road users. Shared space is a street design approach that softens the demarcation of vehicles and pedestrian traffic by reducing traffic rules, traffic signals, road marking, and regulations. Understanding the interactions and trajectory formations of various VRUs will facilitate the design of safer shared spaces. In line with this goal, this paper aims to develop a methodology for generating VRUs trajectories that accounts for behaviors and social interactions. We develop a receding horizon optimization-based pedestrian trajectory planning algorithm capable of modeling pedestrian trajectories in a variety of shared space scenarios. Focusing on three scenarios-group interactions, unidirectional interaction, and fixed obstacle interaction-case studies are performed to demonstrate the strengths of the resulting generative model. Additionally, generated trajectories are validated using two benchmark datasets - DUT and TrajNet++. The three case studies are shown to yield low or near-zero Mean Euclidean Distance and Final Displacement Error values supporting the performance validity of the models. We also analyze gait parameters (step length and step frequency) to further demonstrate the model's capability at generating realistic pedestrian trajectories.

关键词： Behavioral sciences Trajectory Legged locomotion Safety Roads Transportation Planning Optimization mixed integer linear programming shared space social interaction rules trajectory-planning vulnerable road users urban design and planning

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Web Application Replication and Deployment in Multi-Cloud Environment

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第8期33卷 1982-1995页

作者： Shi, Tao Ma, Hui Chen, Gang Hartmann, Sven Victoria Univ Wellington Sch Engn & Comp Sci Wellington 6012 New Zealand Tech Univ Clausthal Dept Informat D-38678 Clausthal Zellerfeld Germany

Multi-cloud is becoming a popular cloud ecosystem because it allows enterprise users to share the workload across multiple cloud service providers to achieve high-quality services with lower operation cost and higher application resilience. In multi-cloud, cloud services are widely distributed at different locations with differentiated prices. Therefore, Web application providers face the challenge to select proper cloud services for application replication and deployment with the aim of minimizing the deployment cost. Meanwhile, the deployed application replicas must satisfy the constraint on request response time to maintain the quality of user experience. To meet the two major requirements, this article studies a new problem of Web application replication and deployment in multi-cloud (WARDMC) that jointly considers both the cost minimization and constraints on average response time, including particularly request processing time and network latency. To address the problem, we develop a new approach named MCApp. MCApp combines iterative mixed integer linear programming with domain-tailored large neighborhood search to optimize both application replicas deployment and user requests dispatching. Extensive experiments using the real-world datasets demonstrate that MCApp significantly outperforms several recently proposed approaches.

关键词： Cloud computing Costs Time factors Optimization Upper bound Pricing User experience Multi-cloud Web application deployment service replication cost optimization mixed integer linear programming large neighborhood search

来源：评论

学校读者我要写书评

暂无评论

An efficient Energy Management System for long term planning and real time scheduling of flexible polygeneration systems

引用

RENEWABLE ENERGY 2022年 200卷 1180-1201页

作者： La Fata, Alice Brignone, Massimo Procopio, Renato Bracco, Stefano Delfino, Federico Barilli, Riccardo Ravasi, Martina Zanellini, Fabio Univ Genoa Elect Elect & Telecommun Engn & Naval Architecture Genoa Italy Falck Renewables SpA Milan Italy

The ever-increasing participation of new energy sources, storage systems and controllable loads to electricity markets has introduced more complexity in the operation of power plants, microgrids (MGs) and networks. To face these issues, it is often necessary to design Distributed Energy Systems to optimize the power exchange. Usually, MG operation is managed by an Energy Management System (EMS) dealing with large amounts of parameters to be taken into account and that may drive to problems difficult to be faced and requiring long computational timings. In this direction, this paper describes the mixed integer linear programming MATLAB Based Energy Management System (MB-EMS) developed at the University of Genoa, aimed at optimizing the operating costs of a generic polygeneration system, considering different electrical and thermal production units, energy storage systems, non-programmable loads and flexible loads. Many important technical details are accounted: the duration and costs related to maintenance interventions and CO2 emissions costs are considered for all production units as well as constraints and incentives related to the High-Efficiency Cogeneration systems. Constraints related to the minimum and maximum State-Of-Charge of energy storage systems, plus their dete-rioration, with the consequent optimization of their utilization, are also modelled. Specific test cases for all functionalities are presented. Moreover, a test related to a real MG performed over a time horizon of one year with a time step of 1 h is performed and solved in a short computational time. The linearization of constraints reduces the computational effort, avoiding the need of clustering or averaging parameters for similar production units. Consequently, calculations are rapidly performed, also when dealing with long term planning problems (a realistic test case with time horizon of one year and time step of 15 min can be simulated in some seconds). In this sense, the developed tool c

关键词： Energy management system Renewable energy source polygeneration mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：