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

Comparison of Two integer programming Formulations for a Single Machine Family Scheduling Problem to Minimize Total Tardiness

引用

Procedia CIRP 2014年 19卷 174-179页

作者： Oliver Herr Asvin Goel Jacobs University gGmbH Campus Ring 1 28759 Bremen Germany

This paper studies the single machine family scheduling problem in which the goal is to minimize total tardiness. We analyze two alternative mixed-integer programming (MIP) formulations with respect to the time required to solve the problem using a state-of-the-art commercial MIP solver. The two formulations differ in the number of binary variables: the first formulation has O ( n 2) binary variables whereas the second formulation has O ( n 3) binary variables, where n denotes the number of jobs to be scheduled. Our findings indicate that despite the significant higher number of binary variables, the second formulation leads to significantly shorter solution times for problem instances of moderate size.

关键词： single machine family scheduling problem setup times tardiness mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Intelligent Scheduling for High Bulilding Multi-type Cooling System

引用

Journal of Donghua University(English Edition) 2014年第2期31卷 179-183页

作者：刘楚晖郑毅蔡旭陈烈 School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai Jiankun Information Technology Co . Ltd

In modern giant buildings,in order to improve energy utilization efficiency, cooling systems have developed from conventional chillers alone to smart energy net which includes chillers,ice storage,ground-source heat pump,combined cooling heating and power( CCHP) and so on. The reasonable distribution of load is the key to guarantee such system in economical *** on typical multi-type cooling system,economic models of different devices are presented and real-time intelligent economic scheduling with the approach of mixed integer programming is carried out. This algorithm has been applied in a certain building of Shanghai and results of simulation show that it is able to provide guidance on intelligent economic scheduling for multi-type cooling system.

关键词： cooling system ice storage intelligent economic scheduling mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

mixed integer programming Based Nested Partition Algorithm for Facility Location Optimization Problems

Mixed Integer Programming Based Nested Partition Algorithm f...

引用

IEEE International Conference on Service Operations and Logistics and Informatics

作者： Xia, Li Zhao, Yanjia Xie, Ming Shao, Jinyan Dong, Jin IBM China Res Lab Zhongguancun Software Pk Beijing 100193 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

ISBN: (纸本)9781424420124

Facility location optimization is very important for many retail industries, such as banking network, chain stores, and so on. Maximal covering location problem (MCLP) is one of the well-known models for these facility location optimization problems, which has earned extensive research interests. However, various practical requirements limit the application of the traditional formulation of MCLP, and the NP-hard characteristic makes effective approaches for large scale problems extremely difficult. This paper focuses on a facility location problem motivated by a practical project of bank branching. The traditional MCLP formulation is generalized as a mixed integer programming (MIP) with considerations of various costs and revenues, multi-type of facilities, and flexible coverage functions. A CPLEX-based hybrid nested partition algorithm is developed for large scale problems, and heuristic-based extensions are introduced to deal with extremely large problems. Our formulation and algorithm are embedded into an asset called IFAO-SIMO. Numerical results demonstrate the effectiveness and efficiency of our approach.

关键词： mixed integer programming nested partition facility location optimization maximal covering location problem

来源：评论

学校读者我要写书评

暂无评论

A Multi-agent based Optimal Operation for Microgrid

A Multi-agent based Optimal Operation for Microgrid

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Takeshi Nagata Kazuya Okamoto Hiroshima Institute of Technology Department of Computer Science Hiroshima Institute of Technology Graduate School of Science and Technology

ISBN: (纸本)9781479938414

In this paper, we propose an autonomous microgrid operation by using multi-agent approach. The proposed multi-agent system consists of seven types of agent (AG). In a microgrid, load AGs act as consumers or buyers, generator AGs, photovoltaic AGs and wind-turbine generation AGs act as producers or sellers, and battery AGs act as prosumers or sellers/buyers. In order to verify the performance of the proposed system, it applied to a simple model system with different electrical power prices. From the simulation results, it can be seen the proposed multi-agent system could perform a smart-grid operation efficiently.

关键词： Microgrids Operation Agent Multi-agent mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

正规型纳什均衡点的整数规划计算方法及不动点算法的分布式实现

正规型纳什均衡点的整数规划计算方法及不动点算法的分布式实现

引用

作者：吴征天中国科学技术大学

学位级别：博士

纳什均衡的正式定义第一次出现在文章[1]中,但对它的研究已经具有了很长的历史,并且它在博弈论及其相关应用(比如经济学,计算机科学,管理科学,生物学,社会学等等)中发挥着基石作用。纳什均衡的概念是用来分析多决策者同时做决策时的决... 详细信息

纳什均衡的正式定义第一次出现在文章[1]中,但对它的研究已经具有了很长的历史,并且它在博弈论及其相关应用(比如经济学,计算机科学,管理科学,生物学,社会学等等)中发挥着基石作用。纳什均衡的概念是用来分析多决策者同时做决策时的决策结果,换句话说,它提供了当所有人的决策结果相互依赖时,对决策组的一种提前预测。纳什均衡是以John Forbes Nash命名的,他和博弈论理论学家Reinhard Selten, John Harsanyi在1994共享了诺贝尔经济学奖。在Antoine Augustin Cournot的垄断理论书[2]中,第一次出现了纳什均衡的概念,在Cournot的理论中所有公司都可以选择提高产品数量来提高公司利润,然而,对某一个公司来说,它最佳的生产产品数量依赖于别的公司,如果给定了其他的公司的生产数量,每个公司生产数量都可以使本公司利润最大化,就是一个Cournot均衡点,这是最早的关于纯策略纳什均衡点的研究。在Cournot分析均衡稳定性的时候,最佳动态响应的概念也被用到。当提出混合策略的纳什均衡的概念后,现在博弈论中关于纳什均衡的概念就完全被改变了。在这样的混合策略纳什均衡中,每一个参与者对可能的行动可以以一种概率的方式来选择决策。这种纳什均衡问题在书[3]中第一次被提及,但是书中仅仅考虑了一种零和的特殊类型。文章[1]第一次给出了纳什均衡的正式定义,并证明了任何有限策略博弈中至少存在一个混合策略的纳什均衡。随着纳什均衡概念的发展,一些博弈论研究者发现在一些情况下所做的预测总是有误差,这主要是因为一个博弈中经常存在着多个纳什均衡点,而这些均衡点通常和我的直观概念不同。为了得到更精确的预测,一些被称为改良版纳什均衡的概念在文章[4-7]中被提出来。自从纳什均衡的概念被提出来,纳什均衡已经被应用到了各行各业。书[3]使用纳什均衡的概念扩展了经济学的范围；文章[8]第一次使用纳什均衡的概念来分析敌对情况,比如军备竞赛和战争[10]；纳什均衡可以用来分析不同人之间合作的可能性,分析他们是否会冒险来得到一个合作结果[11]；文章[12]使用纳什均衡的概念来分析货币危机和银行倒闭的概率；其他方面的应用包括交通流[13],如何组织拍卖[14-16],立法管理[17],足球比赛里的点球[18]以及教育过程中多社团竞争效果的分析[19]。在这些纳什均衡的应用中,一个重要的研究课题是如何有效的选择一个纳什均衡点,特别是如何选择一个多人有限策略博弈的均衡点。为了解决这个问题,接下来的文献中做了很多贡献。从计算复杂度方面来说,文章[20,21]证明了仅仅寻找一个纳什均衡点的问题就是PAD-complete问题,所以很难寻找到一个纳什均衡点,寻找所有纳什均衡点就更加困难了。Lemke-Howson算法[26]是计算双矩阵博弈均衡点的第一个方法,这个算法是在用代数方法证明双矩阵博弈至少存在一个均衡点时得到的,在实际应用中,这个算法效率很高,被称为至今计算纳什均衡点最好的方法[27],但是在最坏的情况下,旋转操作的数量会随纯策略数量指数增长[28].后来,文章[29]证明了用Lemke-Howson算法寻找任何一个纳什均衡点都是一个PSPACE-complete问题。文章[30,31]把Lemke-Howson算法扩展为可以求解多人博弈问题。为了估计一个连续映射的不动点,单纯型法第一次在文章[32]提出,并在[33-39]中得到了进一步的发展,这个单纯型法后来被用来计算纳什均衡点[40]。文章[41]很好的处理了非线性互补问题,这篇文章提出来一种很好的求解非合作多人博弈的纳什均衡点的方法。关于单纯型法的进一步研究可以在文章[42,43]中找到,计算结果显示这种方法的迭代次数很少。通过开发文章[44]中的线性追踪过程,一种旋转过程的方法在文章[45,46]中被提出用来计算双人博弈的纳什均衡点,这种旋转过程的方法可以表述如下：所有人开始任选一个策略组,通过考虑初始策略组而对现有策略进行改变,从而达到一个均衡点。更精确的说,初始最优化策略组被选到的概率越来越大,别的策略组被选到的概率越来越小。初始策略组在整个调整过程中发挥了很重要的作用,因为所有的调整都是基于初始策略组,这种方法很容易被计算机实现,同时,这个过程已经被扩展为寻找多人博弈的纳什均衡点[47]。1996年前关于计算纳什均衡点的文献可以在文章[48]中找到,计算两人博弈的纳什均衡点的文献可以在文章[49]中找到。通过研究问题的可微性,一些关于计算纳什均衡的方法已经在以下文献中提出。通过两个系数,一种平滑的对数跟踪过程在文章[50,6]中被开发出来,对每个博弈,这个对数跟踪过程首先在这个博弈的策略组规定一个优先的概率分布,给定优先概率分布,这个过程会在所有纳什均

关键词： Nash Equilibrium mixed integer programming NP-hard Problem Mul-tilinear Term Fixed-Point Iterative Method Distributed Implementation

来源：评论

学校读者我要写书评

暂无评论

Cyclic Scheduling of Cluster Tools with Equipment Front-End Module and Multifunctional Load Locks

Cyclic Scheduling of Cluster Tools with Equipment Front-End ...

引用

第26届中国控制与决策会议

作者： WANG Hao WANG Huan-gang XU Wen-li Department of Automation Tsinghua University

ISBN: (纸本)9781479937097

This paper proposes a cyclic scheduling method for cluster tools in semiconductor manufacturing with equipment front-end module and multifunctional load locks. In this special configured cluster tools, the equipment front-end module consists of an aligner, a signal-arm robot, and two load locks integrated with coolers. Hence, the two load locks both have multifunction of filling, pumping, and cooling wafers. The multifunctional load locks may become scheduling bottleneck for a certain specified recipe. To solve this problem, the Petri net models of the above configured cluster tool is developed first. Then, based on the Petri net models and state equations, a mixed integer programming model is presented, which can efficiently determine the optimal scheduling sequence in steady state. Through experiments, the effectiveness of the cyclic scheduling method proposed in this paper is verified.

关键词： Cluster Tools Cyclic Scheduling Petri Net mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Simultaneous electric vehicles scheduling and optimal charging in the business context: case study

Simultaneous electric vehicles scheduling and optimal chargi...

引用

5th IET Hybrid and Electric Vehicles Conference (HEVC 2014)

作者： O. Sassi-Ben Salah A. Oulamara Universite de Lorraine Nancy Lorraine FR

ISBN: (纸本)9781510800021

Our study deals with the simultaneous Electric Vehicle Scheduling and Optimal Charging Problem (EVSCP) in the business context. More precisely, given a mixed fleet of Electric Vehicles - EVs and Combustion Engine Vehicles - CVs, a set of tours to be processed by vehicles and a charging infrastructure, the problem aims to optimize the assignment of vehicles to tours and, simultaneously, to optimize the charging of EVs in order to avoid costly and carbon-hungry peak demand periods. We consider several operational constraints mainly related to chargers, electricity grid and EVs driving range. The overall objective of this study is to provide an efficient, scalable and generic decision support tool, combining both technical and business considerations, for vehicle fleet managers that are willing to minimize their vehicles ownership costs, to reduce CO 2 emissions and to avoid EVs batteries degradation. This study is promoted in the scope of a French National Project, led by La Poste Group1, ERDF2 and seven other companies and research laboratories. This R&D project aims at designing, with a progressive approach, a smart system that manages the charging infrastructures and allows an economical and ecological sustainable deployment of EVs fleet in the business context. To solve this problem, we provide a mixed-integer linear programming formulation to model the EVSCP problem and we use CPLEX to solve real test instances. Moreover, we propose different business scenarios and extensions to our baseline model. For instance, we consider the impact of EV use on the battery health and we are interested in different charging schemes, charging infrastructure, energy mix and CO 2 emissions.

关键词： Electric vehicle mixed integer programming Assignment problem Charging problem Experiments Electric vehicles optimal charging travel vehicle Intelligent systems Business integer programming CHARGING(ACCOUNTTNG) Power grids

来源：评论

学校读者我要写书评

暂无评论

Optimal Transmission Entry Capacity in Wind-Integrated Power Systems

Optimal Transmission Entry Capacity in Wind-Integrated Power...

引用

IEEE International Energy Conference

作者： Ezgi Uzuncan Mohammad R. Hesamzadeh Electricity Market Research Group KTH Royal Institute of Technology

ISBN: (纸本)9781479924509

Determining optimal transmission entry capacity (TEC) is very crucial for ensuring an optimal usage of transmission network. It is a complex process to determine the correct TEC levels due to high amount of factors involved. A number of policies encourages the penetration of renewable energy sources with special focus on wind and solar power. Due to intermittent nature of wind energy, the process of determining TEC levels gets ever more complex. Besides, the increasing complexity of finding the optimum TEC levels for generators, another problem is that dispatch of conventional generators are affected by wind power productions. Therefore, the dispatch of all generators become uncertain due to uncertain nature of wind. In this conditions, the optimal usage of the transmission network is very important for efficient operation of the electricity markets. The aim of this paper is to find the optimal TEC levels for electricity generating firms. It uses linear optimisation model and mixed integer linear programming model for non-firm and firm dispatch conditions respectively. The derived models are applied to the IEEE 24-Node test system.

关键词： Power generation dispatch Transmission reliability standards for generators Transmission export capacity Wind energy mixed integer programming Linear programming

来源：评论

学校读者我要写书评

暂无评论

Virtual Cellular Multi-period Formation under the Dynamic Environment

Virtual Cellular Multi-period Formation under the Dynamic En...

引用

International Conference on Future Information Engineering(FIE 2014)

作者： Wenmin Han Fang Wang Jie Lv School of Economics and Management Jiangsu University of Science and Technology

Virtual cellular manufacturing is an innovative way of production organization which both in the production of flexibility and efficient to meet today's rapid development of science and technology and replacement of products. The key process of the design of virtual cellular manufacturing system—cell formation is the focus of research. In order to meet the characteristics of small batch and dynamically changing market demand, this paper studies the problems of virtual cellular multi-period dynamic reconfiguration. A reconfigurable system programming model is developed. The model incorporates parameters of the problems of product dynamic demand, machine capacity, operation sequence, balanced workload, alternative routings and batch setting. The objective of mixed integer programming model is to minimize the total costs of operation, moving raw materials, inventory holding and process routes setup. Though a case study, demonstrates the feasibility and validity of the model in reality.

关键词： virtual cellular manufacturing system design reconfigurable system modeling mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Exact and heuristic methods to solve the berth allocation problem in bulk ports

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2013年第Aug.期54卷 14-31页

作者： Umang, Nitish Bierlaire, Michel Vacca, Ilaria Ecole Polytech Fed Lausanne Sch Architecture Civil & Environm Engn ENAC Transport & Mobil Lab TRANSP OR CH-1015 Lausanne Switzerland

In this paper, we study the dynamic hybrid berth allocation problem in bulk ports with the objective to minimize the total service times of the vessels. We propose two exact methods based on mixed integer programming and generalized set partitioning, and a heuristic method based on squeaky wheel optimization, explicitly considering the cargo type on the vessel. The formulations are compared through extensive numerical experiments based on instances inspired from real bulk port data. The results indicate that the set partitioning method and the heuristic method can be used to obtain near-optimal solutions for even larger problem size. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Bulk ports Berth allocation mixed integer programming Set partitioning Squeaky wheel optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：