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

Towards Real-Time Energy Management of Multi-Microgrid Using a Deep Convolution Neural Network and Cooperative Game Approach

引用

IEEE ACCESS 2020年 8卷 161377-161395页

作者： Samuel, Omaji Javaid, Nadeem Khalid, Adia Khan, Wazir Zada Aalsalem, Mohammed Y. Afzal, Muhammad Khalil Kim, Byung-Seo COMSATS Univ Islamabad Dept Comp Sci Islamabad 44000 Pakistan Jazan Univ Dept Comp Sci & Informat Syst Farasan Networking Res Lab Jazan 828226694 Saudi Arabia COMSATS Univ Islamabad Dept Comp Sci Wah Cantonment 47040 Pakistan Hongik Univ Dept Comp & Informat Commun Engn Sejong 30016 South Korea

Multi-microgrid (MMG) system is a new method that concurrently incorporates different types of distributed energy resources, energy storage systems and demand responses to provide reliable and independent electricity for the community. However, MMG system faces the problems of management, real-time economic operations and controls. Therefore, this study proposes an energy management system (EMS) that turns an infinite number of MMGs into a coherence and efficient system, where each MMG can achieve its goals and perspectives. The proposed EMS employs a cooperative game to achieve efficient coordination and operations of the MMG system and also ensures a fair energy cost allocation among members in the coalition. This study considers the energy cost allocation problem when the number of members in the coalition grows exponentially. The energy cost allocation problem is solved using a column generation algorithm. The proposed model includes energy storage systems, demand loads, real-time electricity prices and renewable energy. The estimate of the daily operating cost of the MMG using a proposed deep convolutional neural network (CNN) is analyzed in this study. An optimal scheduling policy to optimize the total daily operating cost of MMG is also proposed. Besides, other existing optimal scheduling policies, such as approximate dynamic programming (ADP), model prediction control (MPC), and greedy policy are considered for the comparison. To evaluate the effectiveness of the proposed model, the real-time electricity prices of the electric reliability council of Texas are used. Simulation results show that each MMG can achieve energy cost savings through a coalition of MMG. Moreover, the proposed optimal policy method achieves MG's daily operating cost reduction up to 87.86% as compared to 79.52% for the MPC method, 73.94% for the greedy policy method and 79.42% for ADP method.

关键词： Games Real-time systems Energy management Game theory Optimal scheduling Atmospheric modeling Coalition column generation algorithm cooperative game convolutional neural network energy management system multi-microgrid RES forecasting

来源：评论

学校读者我要写书评

暂无评论

Research on Train Formation Plan Optimization in Railway Network Based on Branch-and-Price algorithm 6

Research on Train Formation Plan Optimization in Railway Net...

引用

6th International Conference on Behavioral, Economic and Socio-Cultural Computing (BESC)

作者： Xiao, Wei Yue, Yixiang Chen, Feng Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China China Acad Railway Sci Corp Ltd Signal & Commun Res Inst Beijing Peoples R China

ISBN: (纸本)9781728147628

Freight train formation plan is the basic technical document of railway freight transport organization, it decides the efficiency of railway freight transport. In this paper, we introduce the train formation plan optimization problem in railway network. Then we propose the 0-1 integrated optimization model with the object function to minimize the sum of accumulation time, running time and transit time. According to the characteristics of the model, an improved solution algorithm is designed based on the Branch-and-Price algorithm. The algorithm is programmed in C# language to solve the model. Finally, the computation results on a case study of simplified China's railway network with 14 large marshalling stations demonstrate the effectiveness and feasibility of the proposed optimization method, which shows the application on the actual railway engineering industry.

关键词： railway network train formation plan car flow organization column generation algorithm branch-and-price algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

Inverse max plus sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector

引用

OPTIMIZATION LETTERS 2018年第5期12卷 1065-1077页

作者： Guan, Xiucui Pardalos, Panos M. Zhang, Binwu Southeast Univ Sch Math Nanjing 210096 Jiangsu Peoples R China Univ Florida Dept Ind & Syst Engn Ctr Appl Optimizat 303 Weil Hall Gainesville FL 32611 USA Hohai Univ Dept Math & Phys Changzhou Campus Changzhou 213022 Peoples R China

The inverse max+sum spanning tree problem is considered by modifying the sum-cost vector under weighted norm. On an undirected network G(V, E, c, w), a cost c(e) and a weight w(e) are prescribed for each edge . The max+sum spanning tree (MSST) problem is to find a spanning tree which makes the combined weight as small as possible. It can be solved in time, where and . Whereas, in an inverse MSST problem, is a given spanning tree of G, which is not an optimal MSST. The sum-cost vector c is to be modified to so that becomes an optimal MSST of the new network . The goal is to minimize the modification cost incurred by adjusting the sum-cost vector under weighted norm. The inverse MSST problem under weighted norm can be formulated as a linear programming problem with exponential number of constraints. Then a column generation algorithm is proposed to solve its dual problem. It is extremely interesting that in each iteration the choice of entering variable can be determined by solving an MSST problem with new sum-cost . Computational experiments show that the column generation algorithm can find the optimal solutions of the inverse problem although the number of iterations as well as the running time grow fast with the increase in the size of the instance.

关键词： Max plus sum spanning tree problem Inverse optimization Linear programming Dual theory column generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on Robustness of Aircraft Stand Allocation Based on Flight Type

Study on Robustness of Aircraft Stand Allocation Based on Fl...

引用

2018 5th ERMI International Conference on Social Issues, Social Work and Social Sciences (ERMI-SSS 2018)

作者： Yong Tian Xiaotian Wang Nanjing University of Aeronautics and Astronautics

Robustness of aircraft stand allocation scheme is of significant importance in the research of airport operation *** that delay cost per unit time varies with flight type,and based on a robust model with buffer time balance as the objective function,the concept of flight-type-affected buffer time weight is introduced,and a mathematical model is built to increase stand allocation *** model is solved by means of column generation algorithm,and processed with branch-and-bound method to obtain a non-integer *** of algorithm example indicates that,such stand allocation model and algorithm have certain advantage in computation time and allocation result,and are efficient and feasible in actual operations.

关键词： Aircraft stand allocation Robustness Flight type Aircraft stand plan column generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Integrated fleet assignment and aircraft routing based on delay propagation

引用

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 2016年第7期41卷 713-719页

作者： Liu, Wan-ming Zhu, Xing-hui Qi, Yan-long Nanjing Univ Aeronaut & Astronaut Coll Civil Aviat Nanjing 210016 Jiangsu Peoples R China

Airlines' expensive resources, especially aircraft, are to be optimally scheduled to cover flights of timetables. However, the irregular flight, due to bad weather, mechanical fault and so on, is inevitable. Moreover, flight delays become more severe with the rapid development of the air transport industry in China and have huge irregular flight cost. In order to alleviate flight delays impact on the flight plan, we present a double objective multi-commodity network flow model of flight delay propagation-based aircraft scheduling and minimize the total delay propagation and airline operation cost as the optimization objective. Branch-and-price solution and column generation algorithm are used to solve the problem. Computational results obtained by using data from a major domestic airline show that our approach can reduce delay propagation significantly, thus improving on-time performance and robustness of aircraft scheduling, and decreasing the total cost simultaneously.

关键词： Aircraft scheduling delay propagation column generation algorithm branch-and-price

来源：评论

学校读者我要写书评

暂无评论

Portfolio optimization with a copula-based extension of conditional value-at-risk

引用

ANNALS OF OPERATIONS RESEARCH 2016年第1-2期237卷 219-236页

作者： Krzemienowski, Adam Szymczyk, Sylwia Warsaw Univ Technol Inst Control & Computat Engn Nowowiejska 15-19 PL-00665 Warsaw Poland

The paper presents a copula-based extension of Conditional Value-at-Risk and its application to portfolio optimization. Copula-based conditional value-at-risk (CCVaR) is a scalar risk measure for multivariate risks modeled by multivariate random variables. It is assumed that the univariate risk components are perfect substitutes, i.e., they are expressed in the same units. CCVaR is a quantile risk measure that allows one to emphasize the consequences of more pessimistic scenarios. By changing the level of a quantile, the measure permits to parameterize prudent attitudes toward risk ranging from the extreme risk aversion to the risk neutrality. In terms of definition, CCVaR is slightly different from popular and well-researched CVaR. Nevertheless, this small difference allows one to efficiently solve CCVaR portfolio optimization problems based on the full information carried by a multivariate random variable by employing column generation algorithm.

关键词： Multivariate risk measures Quantile risk measures Portfolio optimization column generation algorithm

来源：评论

学校读者我要写书评

暂无评论

A bi-level programming for bus lane network design

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2015年第Jun.期55卷 310-327页

作者： Yu Bin Kong Lu Sun Yao Yao Baozhen Gao Ziyou Dalian Maritime Univ Transportat Management Coll Dalian 116026 Peoples R China Dalian Univ Technol Sch Automot Engn Dalian 116024 Peoples R China Beijing jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China

This paper proposes a bi-level programming model to solve the design problem for bus lane distribution in multi-modal transport networks. The upper level model aims at minimizing the average travel time of travelers, as well as minimizing the difference of passengers' comfort among all the bus lines by optimizing bus frequencies. The lower level model is a multi-modal transport network equilibrium model for the joint modal split/traffic assignment problem. The column generation algorithm, the branch-and-bound algorithm and the method of successive averages are comprehensively applied in this paper for the solution of the bi-level model. A simple numerical test and an empirical test based on Dalian economic zone are employed to validate the proposed model. The results show that the bi-level model performs well with regard to the objective of reducing travel time costs for all travelers and balancing transit service level among all bus lines. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Bus lane distribution Bi-level programming Benefit equilibrium column generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-class classification using a signomial function

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2015年第3期66卷 434-449页

作者： Hwang, Kyoungmi Lee, Kyungsik Lee, Chungmok Park, Sungsoo Korea Adv Inst Sci & Technol Taejon 305701 South Korea Seoul Natl Univ Seoul 151742 South Korea Hankuk Univ Foreign Studies Yongin South Korea IBM Res Ireland Dublin Ireland

We propose two multi-class classification methods using a signomial function. Each of these methods directly constructs a multi-class classifier by solving a single optimization problem. Since the number of possible signomial terms is extremely large, we propose a column generation method that iteratively generates good signomial terms. Both of these methods obtain better or comparable classification accuracies than existing methods and also provide more sparse classifiers.

关键词： multi-class classification signomial function sparse classifier column generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Large Margin Discriminative Projection

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 2011年第9期22卷 1446-1456页

作者： Wang, Fei Zhao, Bin Zhang, Changshui IBM TJ Watson Res Ctr Healthcare Transformat Grp Hawthorne NY 10532 USA Carnegie Mellon Univ Dept Machine Learning Pittsburgh PA 15213 USA Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

We propose a new dimensionality reduction method called maximum margin projection (MMP), which aims to project data samples into the most discriminative subspace, where clusters are most well-separated. Specifically, MMP projects input patterns onto the normal of the maximum margin separating hyperplanes. As a result, MMP only depends on the geometry of the optimal decision boundary and not on the distribution of those data points lying further away from this boundary. Technically, MMP is formulated as an integer programming problem and we propose a column generation algorithm to solve it. Moreover, through a combination of theoretical results and empirical observations we show that the computation time needed for MMP can be treated as linear in the dataset size. Experimental results on both toy and real-world datasets demonstrate the effectiveness of MMP.

关键词： column generation algorithm maximum margin clustering maximum margin projections

来源：评论

学校读者我要写书评

暂无评论

Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2009年第3期43卷 345-364页

作者： Lu, Chung-Cheng Mahmassani, Hani S. Zhou, Xuesong Northwestern Univ Dept Civil & Environm Engn Evanston IL 60208 USA Natl Kaohsiung First Univ Sci & Technol Kaohsiung 811 Taiwan Univ Utah Dept Civil & Environm Engn Salt Lake City UT 84112 USA

A variety of analytical and Simulation-based models and algorithms have been developed for the dynamic user equilibrium (DUE) traffic assignment problem. This paper aims to develop a theoretically sound simulation-based DUE model and its solution algorithm, with particular emphasis on obtaining solutions that satisfy the DUE conditions. The DUE problem is reformulated, via a gap function, as a nonlinear minimization problem (NMP). The NMP is then solved by a column generation-based optimization procedure which embeds (i) a simulation-based dynamic network loading model to capture traffic dynamics and determine experienced path travel costs for a given path flow pattern and (ii) a path-swapping descent direction method to solve the restricted NMP defined by a subset of feasible paths. The descent direction method circumvents the need to compute the gradient of the objective function in finding search directions, or to determine suitable step sizes, which is especially valuable for large-scale simulation-based DUE applications. Computational results for both small and large real road networks confirm that the proposed formulation and solution algorithm are effective in obtaining near-optimal solutions to the DUE problem. (C) Elsevier Ltd. All rights reserved.

关键词： Dynamic traffic assignment Dynamic user equilibrium Gap function column generation algorithm Traffic simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：