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

IEEE Electrical Power and Energy Conference (EPEC)

作者： Alharbi, Walied Bhattacharya, Kankar Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781479901067

Demand response (DR) and energy storage (ES) have the potential to support high levels of renewable energy (RE) penetration than currently possible, by providing such flexibility in power system operations. This paper presents optimal energy management in islanded microgrids using DR mechanisms and ES system, for enabling secure microgrids with high penetration of renewables. The potential for achieving higher penetration in islanded microgrids is also investigated. A mathematical model is developed for the islanded mode operation of a microgrid. The optimization is formulated as a mixed integer linear programming (MILP) problem, which is solved using the CPLEX solver in the General Algebraic Modeling System (GAMS) platform. A case study is carried out to illustrate the usefulness of the proposed model. The numerical results show the effectiveness of the coordinated operation of ES with DR on operational costs, and RE penetration levels.

关键词： Demand response energy storage mixed integer linear programming renewable energy microgrids

来源：评论

学校读者我要写书评

暂无评论

Minimizing Virtual Machine Migration Probability for Cloud Environments

Minimizing Virtual Machine Migration Probability for Cloud E...

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Chen, Xiaojiao Chen, Shiping Tseng, Fan-Hsun Chou, Li-Der Chao, Han-Chieh Shanghai Univ Sci & Technol Sch Opt Elect & Comp Engn Shanghai 201800 Peoples R China Shanghai Univ Sci & Technol Network Ctr Shanghai 201800 Peoples R China Natl Cent Univ Dept Comp Sci & Informat Engn Taoyuan Taiwan Natl Ilan Univ Inst Comp Sci & Informat Engn Ilan Taiwan Natl Dong Hwa Univ Dept Elect Engn Hualien Taiwan

ISBN: (纸本)9780769550886

In recent years, many researchers focus on how to balance the number of average virtual machines (VMs) in cloud data center. However, the VMs suddenly jumped to more than the utilization threshold of the physical machine (PM) and exhausted the computing resource, which will lead to VM migration and extra cost. In this paper, the VM migration problem in cloud computing is formulated based on mixed integer linear programming (MILP). Then we propose an Allocation algorithm to distribute the VMs among the PMs, which is based on the Support Vector Machine (SVM). The ultimate goal that not only minimizes the VM migration probability but also maximizes the PM resources as much as possible. According to the training data in a period time, the classified VMs can be allocated into the PMs with the lowest VM migration probability by the proposed Allocation algorithm. The simulation results show that the proposed algorithm can achieve lower VM migration probability and reduce the cost for the cloud environments.

关键词： cloud computing VM migration support vector machine mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

TSP with Multiple Time-Windows and Selective Cities

引用

4th International Conference on Computational Logistics (ICCL)

作者： Mesquita, Marta Murta, Alberto Paias, Ana Wise, Laura Univ Tecn Lisboa CIO ISA P-1349017 Lisbon Portugal Portuguese Inst Sea & Atmosphere IPMA P-1449006 Lisbon Portugal Univ Lisbon Fac Ciencias CIO & DEIO P-1749016 Lisbon Portugal

ISBN: (纸本)9783642410192;9783642410185

We address a special TSP in which the set of cities is partitioned into two subsets: mandatory cities and selective cities. All mandatory cities should be visited once within one of the corresponding predefined multiple time windows. A subset of the selective cities, whose cardinality depends on the tour completion time, should be visited within one of the associated multiple time windows. The objective is to plan a tour, not exceeding a predefined number of days, that minimizes a linear combination of the total traveled distance as well as the total waiting time. We present a mixed integer linear programming (MILP) model for the problem and propose a heuristic approach to solve it. Computational experiments address two real world problems that arise in different practical contexts.

关键词： Traveling salesman problem multiple time windows mixed integer linear programming branch-and-bound heuristics

来源：评论

学校读者我要写书评

暂无评论

Caregivers' Assignment Problem in Home Health Care Structures

Caregivers' Assignment Problem in Home Health Care Structure...

引用

5th International Conference on Industrial Engineering and Systems Management (IEEE IESM)

作者： Errarhout, Afrae Kharraja, Said Zorkani, Izeddine Univ St Etienne Lab Anal Signaux & Proc Ind Roanne France Univ Sidi Mohamed Ben Abdellah Fac Sci Dhar El Mahraz Fes Morocco

ISBN: (纸本)9782960053241

In this paper we introduce a caregivers' assignment problem related to the health home care (HHC) structures. This problem uses the generalized assignment problem as a reference. However, we consider more factors and constraints in order to better illustrate the real case. We take into account the caregivers (nurses) qualifications and capacity and we also include the districts where the patients live. The caregivers' capacity is the sum of the total visit time (the cares' workload) and the total travel time (the travels' workload). This problem's aim is to allocate the nurses while securing their workload equilibrium. We present a mixed integer linear programming model and the computational tests were done using CPLEX and produced good results very quickly.

关键词： assignment problem HHC mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal client-server configuration of mobile ad-hoc networks

引用

Electronic Notes in Discrete Mathematics 2013年 41卷 495-502页

作者： De Giovanni, Luigi Palazzi, Claudio E. Dipartimento di Matematica Università degli Studi di Padova Padua Italy

Interactive online gaming is a widely successful application that is becoming more and more popular even on mobile devices. In this context, an emerging scenario is represented by having players' mobile devices directly connected to each other, without resorting to the Internet. To enable this scenario, we leverage on a hybrid architecture that allows client-server games to be played in ad-hoc mode: a number of players take turn in acting also as the server of the game. However, the problem on how to choose the servers so as to maximize the duration of the network still remains an issue. To this aim, we propose an integer programming model and a heuristic based on it: preliminary experimental results show the effectiveness and the potential of the approach. © 2013 Elsevier B.V.

关键词： Backup server Energy MANET mixed integer linear programming Online game Tabu search

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solution of Practical Airline Crew Scheduling Problems

Modeling and Solution of Practical Airline Crew Scheduling P...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Iijima, Y. Nishi, T. Inuiguchi, M. Takahashi, S. Ueda, K. Ojima, K. Osaka Univ Grad Sch Engn Sci Suita Osaka 565 Japan Mitsubishi Electr Corp Adv Technol R&D Ctr Tokyo Japan Mitsubishi Elect Informat Syst Corp Tokyo Japan

ISBN: (纸本)9781479909865

We study on the modeling and solution of practical airline crew scheduling problems. The problem determines a feasible assignment of flight duties to the set of crews. Two types of integer programming formulations with cell model and graph models are developed. An efficient solution algorithm based on labeling algorithm is proposed. The validity of the proposed models is compared by using a general-purpose solver. The computational results show that cell model is better than those of the graph model with less decision variables.

关键词： combinatorial optimization airline crew pairing mixed integer linear programming modeling

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Multiple Sensors for Localization Applications

Optimal Placement of Multiple Sensors for Localization Appli...

引用

International Conference on Indoor Positioning and Indoor Navigation (IPIN)

作者： Kirchhof, Nicolaj TU Dortmund Univ Robot Res Inst D-44227 Dortmund Germany

ISBN: (纸本)9781479940431

Indoor localization systems are usually based on distributed sensors. The sensor output is thereby converted into a distance or angle measure in order to estimate a target's position via triangulation or trilateration. For such systems, the localization error on the one hand depends on the quality of the sensor measurements and on the other hand on the sensor placement In this paper, the problem of optimally placing a minimum number of distributed sensors to fulfill and optimize task requirements is addressed. It is shown how adequate task requirements can be stated for different types of sensor systems by exploiting the Geometric Dilution of Precision (GDOP). Using these requirements, the problem can be formulated in a discrete and continuous search space. The discrete formulations are presented and evaluated using Binary integer programming (BIP) and mixed integer programming (MIP) solver. In contrast, the continuous formulation is briefly described and evaluated using Nonlinear programming (NLP) methods. Both approaches are evaluated with respect to their solvability, runtime and quality. To find solutions for the NP-hard placement problem in reasonable time even for large problem sizes, a new approximation heuristic is introduced. Its worst case solution quality is derived and its solutions are compared to the optimal placements. All evaluations are done using the properties of a visual sensor system that exploits the thermal infrared radiation of humans for indoor localization.

关键词： Sensor Planning mixed integer linear programming Convex Polygon Decomposition Sensor Network Distribution Localization

来源：评论

学校读者我要写书评

暂无评论

Demand Response Through Smart Home Energy Management Using Thermal Inertia

Demand Response Through Smart Home Energy Management Using T...

引用

Australasian Universities Power Engineering Conference (AUPEC)

作者： Wang, Haiming Meng, Ke Luo, Fengji Dong, Zhao Yang Verbic, Gregor Xu, Zhao Wong, K. P. Univ Newcastle Ctr Intelligent Elect Networks Newcastle NSW 2300 Australia Univ Sydney Sch Elect & Informat Engn Sydney NSW Australia Hong Kong Polytech Univ Dept Elect Engn Hong Kong Peoples R China Univ Western Australia Dept Elect & Elect Engn Perth WA Australia

ISBN: (纸本)9781862959132

In this paper, the value of thermal inertia in demand response to benefit customers is determined through a mixed integer linear programming (MILP) algorithm. Thermal models with different sophistications for a smart house are investigated. The energy consumption for cooling a smart house is optimized to minimize the expenditure of cooling load. One parameter and two-parameter thermal models are integrated into the optimization. The optimization of thermal load for maintaining the smart house within thermal comfort level is formulated as a MILP algorithm under the dynamic pricing policy. It is observed that the utilization of thermal inertia could potentially benefit both smart house owners and grid operators in the context of smart grid.

关键词： Demand Response mixed integer linear programming Smart Home Energy Management System Thermal Inertia

来源：评论

学校读者我要写书评

暂无评论

Employing Multiple Unmanned Aerial Vehicles for Co-Operative Path Planning

引用

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2013年第5期10卷

作者： Habib, Durdana Jamal, Habibullah Khan, Shoab A. Natl Univ Comp & Emerging Sci Dept Elect Engn Islamabad Pakistan Univ Engn & Technol Dept Elect Engn Taxila Pakistan Natl Univ Sci & Technol Dept Comp Syst Engn Rawalpindi Pakistan

In this paper, we work to develop a path planning solution for a group of Unmanned Aerial Vehicles (UAVs) using a mixed integer linear programming (MILP) approach. Co-operation among team members not only helps reduce mission time, it makes the execution more robust in dynamic environments. However, the problem becomes more challenging as it requires optimal resource allocation and is NP-hard. Since UAVs may be lost or may suffer significant damage during the course of the mission, plans may need to be modified in real-time as the mission proceeds. Therefore, multiple UAVs have a better chance of completing a mission in the face of failures. Such military operations can be treated as a variant of the Multiple Depot Vehicle Routing Problem (MDVRP). The proposed solution must be such that m UAVs start from multiple source locations to visit n targets and return to a set of destination locations such that (1) each target is visited exactly by one of the chosen UAVs (2) the total distance travelled by the group is minimized and (3) the number of targets that each UAV visits may not be less than K or greater than L.

关键词： Multiple Depot Vehicle Routing Problem Cooperative Path Planning Optimal Resource Allocation mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

MILP Formulations for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems

引用

IFAC Proceedings Volumes 2013年第9期46卷 471-476页

作者： Temel Öncan Merve Cağırıcı Endüstri Mühendisliği Bölümü Galatasaray Üniversitesi Ortaköy İstanbul 34357 TÜRKİYE Eti Pazarlama ve Sanayii A.Ş. Küçük Çamlica Mahallesi Dr. Fahrettin Gökay Cad. No: 56 Üsküdar İstanbul 34662TÜRKİYE

In this work we introduce mixed integer linear programming (MILP) formulations for the Order Batching Problem considering traversal and return routing policies. The proposed MILP formulations have been tested on randomly generated instances and compared with the well-known savings algorithm. According to our extensive computational experiments we can say that the proposed MILP formulations are quite useful to yield good upper bounds and hence, they can be used for benchmarking purposes.

关键词： Order Batching Problem mixed integer linear programming Warehouse Management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：