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

Stochastic Bi-level Trading model for an Active Distribution Company with DGs and Interruptible Loads

IET RENEWABLE POWER GENERATION 2017年第2期11卷 277-287页

作者： Cai, Yu Lin, Jin Wan, Can Song, Yonghua Tsinghua Univ Dept Elect Engn State Key Lab Control & Simulat Power Syst & Gene Beijing 100084 Peoples R China Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

With the rapid development of distributed generations (DGs) and interruptible loads (ILs), distribution network company can actively purchase electricity in market instead of playing as a traditional passive purchaser. This study proposes a stochastic bi-level model-based strategic trading model for an active distribution company (ADisCo) which operates the active distribution network (ADN) to maximise its profit in electricity market. Uncertainties pertaining to bidding and offering prices of other market rivals', the imbalance prices in the balance market and the productions of DGs are considered via stochastic programming. Besides, a linear ADN operation model is proposed to ensure ADN operation security within the stochastic programming model. The proposed model is initially formulated as a stochastic bi-level model, where the upper-level problem represents the maximisation of the profit of ADN operator, whereas the lower-level model represents the maximisation of the social welfare in clearing of market from the perspective of independent system operator. On the basis of the complementarity theory, the proposed model can be transformed into a mixed integer linear programming model. Case studies demonstrate the efficiency and effectiveness of the proposed strategic trading model for an ADisCo with DGs and ILs.

关键词： power markets distributed power generation power generation economics power distribution economics stochastic programming pricing power system security profitability ADisCo DG ILs distributed generations interruptible loads distribution network company passive purchaser stochastic bi-level model-based strategic trading model active distribution company active distribution network electricity market imbalance prices stochastic programming linear ADN operation model ADN operation security upper-level problem social welfare maximisation independent system operator complementarity theory mixed integer linear programming model profit maximization

来源：评论

学校读者我要写书评

暂无评论

In the determination of the most efficient decision making unit in data envelopment analysis: A comment

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2017年 104卷 216-218页

作者： Salahi, Maziar Toloo, Mehdi Univ Guilan Fac Math Sci Dept Appl Math Rasht Iran Tech Univ Ostrava Fac Econ Dept Syst Engn Ostrava Czech Republic

In order to deal with finding the most efficient unit problem, Lam (2015) recently built a new integrated mixed integer linear programming model which is nearly close to the super-efficiency model. The suggested model involves a non-Archimedean epsilon as the lower bound for the input and output weights. Selecting a suitable value for epsilon is a challenging issue in DEA (Data Envelopment Analysis). Lam (2015) suggested a value for epsilon which guarantees the feasibility of his model;however, this paper illustrates that the model may fail to find the most efficient unit due to unsuitable selected value for epsilon. To cope with this issue, a new model is formulated which provides the maximum epsilon value for the model of Lam (2015). The built model guarantees that when epsilon is maximum, then Lam's model gives exactly one DMU (Decision Making Unit) as the most efficient unit with the maximum discrimination distance from the other DMUs. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Data envelopment analysis Most efficient DMU Non-Archimedean epsilon mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Multi-haul quasi network flow model for vertical alignment optimization

引用

ENGINEERING OPTIMIZATION 2017年第10期49卷 1777-1795页

作者： Beiranvand, Vahid Hare, Warren Lucet, Yves Hossain, Shahadat Univ British Columbia Dept Comp Sci Kelowna BC Canada Univ British Columbia Dept Math Kelowna BC Canada

The vertical alignment optimization problem for road design aims to generate a vertical alignment of a new road with a minimum cost, while satisfying safety and design constraints. A new model called multi-haul quasi network flow (MH-QNF) for vertical alignment optimization is presented with the goal of improving the accuracy and reliability of previous mixed integer linear programming models. The performance of the new model is compared with two state-of-the-art models in the field: the complete transportation graph (CTG) and the quasi network flow (QNF) models. The numerical results show that, within a 1% relative error, the proposed model is robust and solves more than 93% of test problems compared to 82% for the CTG and none for the QNF. Moreover, the MH-QNF model solves the problems approximately eight times faster than the CTG model.

关键词： Vertical alignment road design optimization mixed integer linear programming model earthwork allocation variable hauling costs

来源：评论

学校读者我要写书评

暂无评论

A MILP model for an integrated project scheduling and multi-skilled workforce allocation with flexible working hours

引用

IFAC-PapersOnLine 2017年第1期50卷 13964-13969页

作者： Karam, Ahmed Attia, El-Awady Duquenne, Philippe Benha University Cairo Egypt Industrial Engineering Department Toulouse University INPT Toulouse cedex 4 France

In this paper, we integrate two decision problems arising in various applications such as production planning and project management: the project scheduling problem, which consists in scheduling a set of precedence-constrained tasks, where each task requires executing a set of skills to be performed, and the workforce allocation problem which includes assigning workers as scarce resources to the skills of each task. These two problems are interrelated as the tasks durations are not predefined, but depend on the number of workers assigned to that task as well as their skill levels. We here present a mixed integer linear programming model that considers important real life aspects related to the flexibility in the use of human resources, such as multi-skilled workers whose skill levels are different and measured by their efficiencies. Hence, execution times of the same workload by different workers vary according to these efficiencies. Moreover, the model considers the flexible working time of employees; i.e. the daily and weekly workload of a given worker may vary from one period to another according to the work required. Furthermore, efficient team building is incorporated in this model; i.e. assigning an expert worker and one or more apprentice worker(s) together with the purpose of skill development thanks to knowledge transfer. A numerical example is provided to check the performance of the model. © 2017

关键词： Scheduling Efficiency Human resource management integer programming Knowledge management Multitasking Production control Allocation problems mixed integer linear programming mixed integer linear programming model Production Planning Project scheduling problem Skilled workers Workforce flexibility Working time

来源：评论

学校读者我要写书评

暂无评论

Platform Allocation to Trains for Prague Main Station 21

Platform Allocation to Trains for Prague Main Station

引用

21st International Scientific Conference on Transport Means (Transport Means)

作者： Akyol, E. Bulicek, J. Sarac, Tugba Univ Pardubice Studentska 95 Pardubice 53210 Czech Republic

In this study, we deal with a version of train platforming problem for Prague Main Station. We propose an assignment model to allocate platform tracks to trains with regard to the train timetable and operational restrictions of station. If a train departs late from the scheduled time, a delay is occurred. Delays are caused by possible conflicts. The objective of the model is to minimize the total weighted delay of trains. After solving the problem, if the objective function value is equal to zero, it means that the timetable is evaluated as robust. Total elimination of conflicts is basic presumption for quality operation in practice. To show efficiency of model implemented in GAMS, they are tested on the base of data related to the Prague main railway station. Computational results of models are presented and discussed.

关键词： mixed integer linear programming model platform track assignment railway infrastructure capacity railway optimization models

来源：评论

学校读者我要写书评

暂无评论

Exact methods for sensor deployment problem with connectivity constraint in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2016年第3期21卷 157-168页

作者： Rebai, Maher Afsar, Hasan Murat Snoussi, Hichem Univ Technol Troyes CNRS UMR 6281 ICD LM2S BP2060 F-10010 Troyes France Univ Technol Troyes CNRS UMR 6281 ICD LOSI BP2060 F-10010 Troyes France Univ Technol Troyes CNRS UMR 6281 ICD LM2S BP2060 F-10010 Troyes France

In wireless sensor networks, coverage and connectivity are two essential issues. They indicate how all the points of an area of interest are covered and how the sensor devices of the wireless sensor network are connected in an efficient way. In this study, the problem of minimising total grid coverage cost with connectivity constraint is considered. The connectivity constraint means that each deployed sensor has to find a path, composed of connected sensors, until to reach the base station (the sink). The problem may be reduced to a 2-dimensional critical grid coverage problem which is anNP-Complete problem. We propose mixed integer linear programming models to solve the problem optimally. We verify by computational experiments that the developed approaches can provide the optimal solution of grid sizes of (15 x 15) (width x length) in a reasonable time. We also show that one of the proposed methods is more efficient than some methods developed for similar problems.

关键词： wireless sensor networks total grid coverage problem mixed integer linear programming model location problem

来源：评论

学校读者我要写书评

暂无评论

Optimisation-based switch allocation to improve energy losses and service restoration in radial electrical distribution systems

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第11期10卷 2792-2801页

作者： Lopez, Juan Camilo Franco, John Fredy Rider, Marcos J. UNICAMP Univ Estadual Campinas Dept Sistemas Energia Eletr Fac Engn Engn Eletr & Comp Sao Paulo Brazil UNESP Univ Estadual Paulista Dept Engn Eletr Fac Engn Ilha Solteira Sao Paulo Brazil

This study presents a new methodology for the optimal allocation of switching devices in radial electrical distribution systems (EDSs). A specialised greedy randomised adaptive search procedure (GRASP) algorithm defines the location of a number of switching devices in order to simultaneously improve the following optimisation subproblems related to the use of the allocated switches: (i) the optimal reconfiguration of EDS and (ii) the optimal service restoration of EDS. Eventually, the objective function of the proposed switch allocation algorithm minimises the cost of the total expected energy not supplied, computed after deploying the service restoration, plus the cost of the total annual energy loss computed for every load level in a year, plus the investment costs associated with the number of installed switches. Both optimisation subproblems, i.e. the reconfiguration and the restoration of EDS, are represented by mixed-integer non-linear programming (MINLP) models and transformed into mixed-integer linear programming (MILP) models, using linearisation strategies. MILP models guarantee convergence to optimality by using convex optimisation techniques. Finally, all tests were carried out using a real 136-node distribution system, considering dispatchable and non-dispatchable distributed generation resources.

关键词： power system restoration power distribution reliability search problems randomised algorithms greedy algorithms power distribution economics cost reduction integer programming linear programming linearisation techniques convex programming power generation dispatch distributed power generation power generation economics optimisation-based switch allocation energy loss improvement radial electrical distribution system greedy randomised adaptive search procedure algorithm optimisation subproblem EDS optimal reconfiguration EDS optimal service restoration cost minimisation switch allocation algorithm objective function investment cost mixed integer nonlinear programming model mixed integer linear programming model MILP model linearisation strategy convex optimisation tools 136-node distribution system dispatchable DG resource nondispatchable DG resource

来源：评论

学校读者我要写书评

暂无评论

An MILP model for Scheduling Multistage, Multiproducts Milk Processing

引用

IFAC-PapersOnLine 2016年第12期49卷 869-874页

作者： Touil, A. Echchatbi, A. Charkaoui, A. Faculty of Science and Technology BP: 577 Settat Morocco

In this paper, a mixed integer linear programming (MILP) model is developed to address production scheduling problems in multistage, multiproduct milk processing. Our model includes several technological constraints typically arising in the dairy industry, such as dependent sequence changeover time, machine speed, and taking into account the packaging timing and capacity constraints. The objective is to minimize the makespan. Numerical results with small instances are presented to demonstrate the efficiency of the proposed model for an industrial case study of a leading company of the dairy industry in Morocco. © 2016

关键词： integer programming Dairies Dairy products Production control Scheduling Capacity constraints Dairy industry Industrial case study Milk production mixed integer linear programming (MILP) mixed integer linear programming model Production scheduling problems Technological constraints

来源：评论

学校读者我要写书评

暂无评论

A Production Inventory Routing Planning for Perishable Food with Quality Consideration

引用

IFAC-PapersOnLine 2016年第3期49卷 407-412页

作者： LI, Yantong CHU, Feng YANG, Zhen Calvo, Roberto Wolfler Laboratory IBISC University of Evry-Val d'Essonne Evry France School of Management Xi'an Jiaotong University Xi'an China Université Paris 13 Sorbonne Paris Citè Villetaneuse France

We formulate the production inventory routing planning with an integrated mixed integer linear programming (MILP) model where the food quality level is explicitly traced throughout the supply chain. The objective of the proposed model is to maximize the total profit, which equals the selling revenue minus the summation of the production, inventory and transportation cost. We then use illustrative examples to show the effectiveness of the model and to investigate the impact of perishability. Analyses based on the computational results of a set of randomly generated instances are given. © 2016

关键词： integer programming Optimization Supply chains Computational results Food quality MILP mixed integer linear programming model Production inventories Total profits Transportation cost

来源：评论

学校读者我要写书评

暂无评论

A column generation algorithm for the Buffer Allocation Problem approximated by the Time Buffer concept

引用

IFAC-PapersOnLine 2016年第12期49卷 739-744页

作者： Alfieri, A. Matta, A. Pastore, E. Department of Management and Production Engineering Politecnico di Torino 24 c.so Duca degli Abruzzi Torino10129 Italy Shanghai200240 China

The Buffer Allocation Problem deals with buffer sizing in production systems. In particular, the objective is to find an optimal buffer size configuration achieving some target performance measure. It has two main tasks to accomplish: searching for an optimal system configuration and assessing the system performance. In real setting, simulation-optimization is the common technique to approach this problem. Recently, an approximated mathematical programming approach has been developed for BAP simulation-optimization. The approximation consists in modeling queues with temporal lags (time buffer) and allows to devise linear programming (LP) instead of mixed integer linear programming (MILP) models. This latter makes easier the solution process, which remains a challenge due to the models huge and complex dimension solution space topology. In this paper, we propose an exact method for the solution of the time buffer approximated BAP. Tests on randomly generated instances showed that the proposed method is computationally more efficient than standard LP solver in most of the cases. © 2016

关键词： integer programming Reservation systems Buffer sizing Exact methods Manufacturing process mixed integer linear programming model Optimal system configuration Performance measure simulation Simulation optimization

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：