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

Fair cost distribution among smart homes with microgrid

ENERGY CONVERSION AND MANAGEMENT 2014年 80卷 498-508页

作者： Zhang, Di Liu, Songsong Papageorgiou, Lazaros G. UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

Microgrid is composed of a set of distributed energy resources (DER) and is considered as an alternative energy providing system to the current centralised energy generation. Smart homes equipped with smart grid technology, such as smart meter and communication system, are becoming popular for their lower energy cost and provision of comfort. Flexible energy-consuming household tasks can be scheduled coordinately among multiple homes which share the common microgrid. When local DERs cannot fulfill the whole demand, smart homes will compete with each other to obtain energy from local DERs and achieve their respective lowest energy cost. In this paper, a mathematical programming formulation is presented for the fair cost distribution among smart homes with microgrid. The proposed model is based on the lexicographic minimax method using a mixed integer linear programming (MILP) approach. One-day forecasted energy cost of each smart home is minimised under fairness concern. DER operation, DER output sharing among smart homes and electricity consumption household tasks are scheduled. Two numerical examples with 10 and 50 smart homes are studied. The computational results illustrate that the proposed approach can obtain obvious cost savings (30% and 24% respectively) and fair cost distribution among multiple homes under given fairness scenario. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Lexicographic minimax method Fair planning/scheduling Smart homes Microgrid mixed integer linear programming Real-time pricing

来源：评论

学校读者我要写书评

暂无评论

Coordinated road-network search route planning by a team of UAVs

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2014年第5期45卷 825-840页

作者： Oh, Hyondong Kim, Seungkeun Tsourdos, Antonios White, Brian A. Cranfield Univ Dept Engn Phys Cranfield MK43 0AL Beds England Chungnam Natl Univ Dept Aerosp Engn Taejon South Korea

This paper presents a road-network search route planning algorithm by which multiple autonomous vehicles are able to efficiently visit every road identified in the map in the context of the Chinese postman problem. Since the typical Chinese postman algorithm can be applied solely to a connected road-network in which ground vehicles are involved, it is modified to be used for a general type of road map including unconnected roads as well as the operational and physical constraints of unmanned aerial vehicles (UAVs). For this, a multi-choice multi-dimensional knapsack problem is formulated to find an optimal solution minimising flight time and then solved via mixed integer linear programming. To deal with the dynamic constraints of the UAVs, the Dubins theory is used for path generation. In particular, a circular-circular-circular type of the Dubins path is exploited based on a differential geometry to guarantee that the vehicles follow the road precisely in a densely distributed road environment. Moreover, to overcome the computational burden of the multi-choice multi-dimensional knapsack algorithm, a nearest insertion and auction-based approximation algorithm is newly introduced. The properties and performance of the proposed algorithm are evaluated via numerical simulations operating on a real village map and randomly generated maps with different parameters.

关键词： road-network search route dubins path unmanned aerial vehicles mixed integer linear programming auction negotiation

来源：评论

学校读者我要写书评

暂无评论

Possibility of the most cost efficient choice: A divided process approach to method and location selection for municipal solid waste management

引用

WASTE MANAGEMENT & RESEARCH 2014年第11期32卷 1073-1082页

作者： Korucu, M. Kemal Cihan, Ahmet Alkan, Atakan Ozbay, Ismail Karademir, Aykan Aladag, Zerrin Kocaeli Univ Dept Environm Engn TR-41380 Kocaeli Turkey Kocaeli Univ Dept Ind Engn TR-41380 Kocaeli Turkey

As studies on municipal solid waste management increased in recent years, many new mathematical models and approaches with a focus on determining the best treatment and disposal scenario were developed and applied. In this study, a mixed integer linear programming model was developed to be used as a facilitative tool for the cost minimisation of municipal solid waste management practices. Since municipal solid waste mass is a mixed composition of various types of waste components with different physical and chemical properties, the model was designed to include all the suitable treatment and disposal methods for these different waste components. The method alternatives with multiple waste inputs, such as aerobic biological treatment and the thermal processes, were divided into a number of inputs to remove their non-linear structures. This way, linear programming could be used, and the linear cost function could be minimised over a set of linear constraints with integer variables. The model was applied to the city of Kocaeli, which will require a new waste management application in the future, beginning from 2015. The results obtained for different haul distance constraints in the study area were presented and assessed. The results showed that all the information required for a comprehensive management task could be modelled by a linear optimisation model with a divided processes approach easily.

关键词： Divided process approach decision making mixed integer linear programming method selection municipal solid wastes

来源：评论

学校读者我要写书评

暂无评论

Capacity planning for batch and perfusion bioprocesses across multiple biopharmaceutical facilities

引用

BIOTECHNOLOGY PROGRESS 2014年第3期30卷 594-606页

作者： Siganporia, Cyrus C. Ghosh, Soumitra Daszkowski, Thomas Papageorgiou, Lazaros G. Farid, Suzanne S. UCL Dept Biochem Engn London WC1E 7JE England Bayer Healthcare Biotechnol Controlling Berkeley CA USA Bayer AG Proc Dev & Optimisat Leverkusen Germany UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

Production planning for biopharmaceutical portfolios becomes more complex when products switch between fed-batch and continuous perfusion culture processes. This article describes the development of a discrete-time mixed integer linear programming (MILP) model to optimize capacity plans for multiple biopharmaceutical products, with either batch or perfusion bioprocesses, across multiple facilities to meet quarterly demands. The model comprised specific features to account for products with fed-batch or perfusion culture processes such as sequence-dependent changeover times, continuous culture constraints, and decoupled upstream and downstream operations that permit independent scheduling of each. Strategic inventory levels were accounted for by applying cost penalties when they were not met. A rolling time horizon methodology was utilized in conjunction with the MILP model and was shown to obtain solutions with greater optimality in less computational time than the full-scale model. The model was applied to an industrial case study to illustrate how the framework aids decisions regarding outsourcing capacity to third party manufacturers or building new facilities. The impact of variations on key parameters such as demand or titres on the optimal production plans and costs was captured. The analysis identified the critical ratio of in-house to contract manufacturing organization (CMO) manufacturing costs that led the optimization results to favor building a future facility over using a CMO. The tool predicted that if titres were higher than expected then the optimal solution would allocate more production to in-house facilities, where manufacturing costs were lower. Utilization graphs indicated when capacity expansion should be considered. (c) 2013 The Authors Biotechnology Progress published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers Biotechnol. Prog., 30:594-606, 2014

关键词： capacity planning scheduling business decision-making mixed integer linear programming rolling time horizon

来源：评论

学校读者我要写书评

暂无评论

Minimal counterexamples for linear-time probabilistic verification

引用

THEORETICAL COMPUTER SCIENCE 2014年第C期549卷 61-100页

作者： Wimmer, Ralf Jansen, Nils Abraham, Erika Katoen, Joost-Pieter Becker, Bernd Univ Freiburg Chair Comp Architecture D-79110 Freiburg Germany Rhein Westfal TH Aachen Chairfor Software Modeling & Verificat Aachen Germany Rhein Westfal TH Aachen Aachen Germany

Counterexamples for property violations have a number of important applications like supporting the debugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement. In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markov decision processes as counterexamples for violated omega-regular properties. Minimality can thereby be defined in terms of the number of states or transitions. This problem is known to be NP-complete for Markov decision processes. We show how to compute such subsystems using mixed integer linear programming and evaluate the practical applicability in a number of experiments. They show that our method yields substantially smaller counterexample than using existing techniques. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Markov chain Markov decision process Counterexample omega-Regular property mixed integer linear programming SAT-modulo-theories

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming for medical waste reverse logistics network design

A mixed integer linear programming for medical waste reverse...

引用

International Conference on Management Science and Engineering (ICMSE)

作者： Li-hong Shi Transportation Management College Dalian Maritime University China

The medical waste management is of great importance due to its potential environmental hazards and public health risks. Manufacturers have to collect the medical waste and control its recovery or disposal. Medical waste recovery, which encompasses reuse, remanufacturing and materials recycling, requires a specially structured reverse logistic network in order to collect medical waste efficiently. This paper has attempted to apply the basic theories of reverse logistics to improve the effect of medical waste management. We presents a mixed integer linear programming model of reverse logistics networks for returned medical waste. The efficiency and practicability of the proposed model is validated by an application to an illustrative example dealing with medical waste returned from some hospitals to a given medical materials producer.

关键词： mixed integer linear programming Reverse logistics Waste management Waste materials Hazards Public healthcare Manufacturing Waste recovery Recycling Hospitals

来源：评论

学校读者我要写书评

暂无评论

Reliability assessment of incentive- and priced-based demand response programs in restructured power systems

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2014年 56卷 83-96页

作者： Nikzad, Mehdi Mozafari, Babak Islamic Azad Univ Dept Elect Engn Islamshahr Branch Tehran Iran Islamic Azad Univ Dept Elect & Comp Engn Sci & Res Branch Tehran Iran

Fostering demand response (DR) through incentive-based and priced-based programs has always great impact on improvement of efficiency and reliability of the power systems. The use of DR lowers undesirable effects of failures that usually impose financial costs and inconveniences to the customers. Hence, quantifying the impact of demand response programs (DRPs) on reliability improvement of the restructured power systems is an important challenge for the independent system operators and the regional transmission organizations. In this paper, the DR model which treats consistently the main characteristics of the demand curve is developed for modeling. In proposed model, some penalties for customers in case of no responding to load reduction and incentives for customers who respond to reducing their loads are considered. In order to make analytical evaluation of the reliability, a mixed integer DC optimal power flow is proposed by which load curtailments and generation re-dispatches for each contingency state are determined. Both transmission and generation failures are considered in contingency enumeration. The proposed technique is modeled in the GAMS software and solved using CPLEX as a powerful mixed integer linear programming (MILP) solver. Both supply-side reliability for generation companies and demand-side reliability for customers are calculated using this technique. In order to simulate customers' behavior to different DRPs in a real power network, the proposed DR model is used and evaluated over Iranian power network. In order to investigate the reliability effects of DRPs based on proposed reliability method. DRPs based on the DR model are implemented over the IEEE RTS 24-bus test system, and reliability indices for generation companies, transmission network and customers are calculated. Using proposed performance index, the priority of the DRPs are determined from view point of customers, generation companies, transmission network and the whole system in I

关键词： Demand response programs Analytical reliability evaluation techniques mixed integer linear programming Expected energy not supplied Expected interruption cost

来源：评论

学校读者我要写书评

暂无评论

On d-regular schematization of embedded paths

引用

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2014年第3期47卷 381-406页

作者： Delling, Daniel Gemsa, Andreas Noellenburg, Martin Pajor, Thomas Rutter, Ignaz Microsoft Res Silicon Valley Mountain View CA USA Karlsruhe Inst Technol D-76021 Karlsruhe Germany

Motivated by drawing route sketches, we consider the d-regular path schematization problem. For this problem we are given an embedded path P (e.g., a route in a road network) and a positive integer d. The goal is to find a d-schematized embedding of P in which the orthogonal order of all vertices in the input is preserved and in which every edge has a direction that is an integer multiple of (90/d)(o). We show that deciding whether a path can be d-schematized is NP-complete for any positive integer d. Despite the NP-hardness of the problem we still want to be able to generate route sketches and thus need to solve the d-regular path schematization problem. We explore two different algorithmic approaches, both of which consider two additional quality constraints: We require that every edge is drawn with a user-specified minimum length and we want to maximize the number of edges that are drawn with their preferred direction. The first algorithmic approach restricts the input paths to be axis-monotone. We show that there exists a polynomial-time algorithm that solves the d-regular path schematization problem for this restricted class of embedded paths. We extend this approach by a heuristic such that it can handle arbitrary simple paths. However, for the second step we cannot guarantee that the orthogonal order of the input embedding is maintained. The second approach is a formulation of the d-regular path schematization problem as a mixed integer linear program. Finally, we give an experimental evaluation which shows that both approaches generate reasonable route sketches for real-world data. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Path schematization NP-hardness mixed integer linear programming Dynamic programming Graph drawing

来源：评论

学校读者我要写书评

暂无评论

Modeling and scheduling no-wait open shop problems

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2014年 158卷 256-266页

作者： Naderi, B. Zandieh, M. Kharazmi Univ Fac Engn Dept Ind Engn Tehran Iran Shahid Beheshti Univ Accounting & Management Fac Dept Ind Management Tehran Iran

This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling problems arise in many realistic production environments such as hot metal rolling, the plastic molding, chemical and pharmaceutical, food processing and several other industries. To tackle such problems, we first develop three different mathematical models, mixed integer linear programs, by which we can solve the problem to optimality. Besides the models, we propose novel metaheuristics based on genetic and variable neighborhood search algorithms to solve the large-sized problems in an acceptable computational time. The key point in any scheduling solver is the procedure of encoding and decoding schemes. In this paper, we propose a simple yet effective tailor-made procedure of encoding and decoding schemes for no-wait open shop problems. The operators of the proposed metaheuristics are designed so as to consider the specific encoding scheme of the problem. To evaluate the performance of models and metaheuristics, we conduct two computational experiments. The first includes small-sized instances by which we compare the mathematical models and assess general performance of the proposed metaheuristics. In the second experiment, we further evaluate the potential of metaheuristics on solving some benchmarks in the literature of pure open shops. The results show that the models and metaheuristics are effective to deal with the no-wait open shop problems. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Scheduling Open shop No-wait mixed integer linear programming Genetic algorithm Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2014年第11期65卷 1735-1747页

作者： Belo-Filho, Marcio A. F. Toledo, Franklina M. B. Almada-Lobo, Bernardo Univ Sao Paulo BR-13566590 Sao Paulo Brazil Univ Porto P-4100 Oporto Portugal

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing problem with backlogging and setup carryover and crossover. The first is in line with other models from the literature, whereas the second considers a disaggregated setup variable, which tracks the starting and completion times of the setup operation. This innovative approach permits a more compact formulation. Computational results show that the proposed models have outperformed other state-of-the-art formulation.

关键词： lot sizing setup carryover setup crossover mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：