This paper presents a model which simultaneously optimises the selection and operation of technologies for distributed energy systems in buildings. The Technology Selection and Operation (TSO) model enables a new appr...
详细信息
This paper presents a model which simultaneously optimises the selection and operation of technologies for distributed energy systems in buildings. The Technology Selection and Operation (TSO) model enables a new approach for the optimal selection and operation of energy system technologies that encompasses whole life costing, carbon emissions as well as real-time energy prices and demands;thus, providing a more comprehensive result than current methods. Utilizing historic metered energy demands, projected energy prices and a portfolio of available technologies, the mathematical model simultaneously solves for an optimal technology selection and operational strategy for a determined building based on a preferred objective: minimizing cost and/or minimizing carbon emissions. The TSO is a comprehensive and novel techno-economic model, capable of providing decision makers an optimal selection from a portfolio of available energy technologies. The current portfolio of available technologies is composed of various combined heat and power (CHP) and organic Rankine cycle (ORC) units. The TSO model framework is data-driven and therefore presents a high level of flexibility with respect to time granularity, period of analysis and the technology portfolio. A case study depicts the capabilities of the model;optimisation results under different temporal arrangements and technology options are showcased. Overall, the TSO model provides meaningful insights that allow stakeholders to make technology investment decisions with greater assurance. (C) 2016 Elsevier Ltd. All rights reserved.
This study addresses a real-life multiship routing and scheduling application with inventory constraints that arises in pickup and delivery operations of different types of crude oil from various offshore oil rigs (pl...
详细信息
This study addresses a real-life multiship routing and scheduling application with inventory constraints that arises in pickup and delivery operations of different types of crude oil from various offshore oil rigs (platforms) to coastal terminals. Oil transportation largely results from the need to maintain inventories at each supply point (platform) between minimum and maximum levels, considering production rates in these operational points, and to meet demands of different oils in the terminals within the planning time horizon. Routing and scheduling of the available fleet aims to obtain solutions of minimum total costs, subject to various constraints such as the maximum volume of cargo carried on each ship, simultaneous cargo unloading in some terminals, conditions that rule ship docking in offshore platforms and terminal berths, among others. In this research, we modify and extend inventory constrained maritime routing and scheduling models to appropriately represent the problem of a case study at a Brazilian company and to solve small-to-moderate instances based on real data. We also present a matheuristic to deal with larger problem instances. Solution evaluation by company experts indicates that the model and this hybrid heuristic properly represent the problem and highlights the potential of their application in practice.
Combined heat and power (CHP) plants are characterized by high fuel efficiency and are therefore usually the thermal power producing units of choice within a district heating network. The operation of CHP units is typ...
详细信息
Combined heat and power (CHP) plants are characterized by high fuel efficiency and are therefore usually the thermal power producing units of choice within a district heating network. The operation of CHP units is typically controlled by the current heat demand and thus delimits the range of electricity production. Heat storage devices are a promising alternative to uncouple the heat load of the district heating network from the commitment of the units and to allow for price-oriented electricity production. In this paper we present numerical results for the combined optimization of the operation of nineteen existing power plant units and the design of six proposed heat accumulators which supply the district heating network of Berlin. A mixed-integer programming problem (MIP) is formulated in GAMS and solved with CPLEX. This paper focuses on the potential for increasing profitability through the addition of heat accumulators in the energy system described above, on the optimal storage capacities for different price scenarios (variation of fuel costs, prices for carbon dioxide emission certificates, and electricity price time series) as well as on the adjustment of the operation of the power plants due to heat storage. (C) 2011 Elsevier Ltd. All rights reserved.
Due to the increasing amount of goods transported by vessels and the resulting increased size of the vessels, waterway scheduling becomes a challenging task. Waterways can often only be expanded with enormous costs an...
详细信息
Due to the increasing amount of goods transported by vessels and the resulting increased size of the vessels, waterway scheduling becomes a challenging task. Waterways can often only be expanded with enormous costs and environmental damage. Therefore, this paper investigates a scheduling problem on a restricted waterway. Wide vessels are only allowed to pass in a passing box and vessels with deep draught can only pass the waterway in a time window around high tide. We present a mixed-integer program (MIP) for the problem setting and develop techniques which allow us to fix variables and reduce the number of variables and constraints of the model. The resulting model formulations are evaluated in a comprehensive computational study on a real-world setting at the river Elbe next to Hamburg (Germany).
In this paper, we address a resource-constrained project scheduling problem involving a single resource. The resource can be applied at varying consumption rates to the activities of the project. The duration of each ...
详细信息
In this paper, we address a resource-constrained project scheduling problem involving a single resource. The resource can be applied at varying consumption rates to the activities of the project. The duration of each activity is defined by a convex, non-increasing time-resource trade-off function. In addition, activities are not preemptable (ie, the resource consumption rate of an activity cannot be altered while the activity is being processed). We explicitly consider variation of the rate at which an activity is performed with variation in resource consumption rate. We designate the number of units (amount of an activity) performed per unit time with variation in resource consumption rate as the processing rate function, and assume this function to be concave. We present a tree-search-based method in concert with the solution of a nonlinear program and the use of dominance properties to determine: (i) the sequence in which to perform the activities of the project, and (ii) the resource consumption rate to allocate to each activity so as to minimize the project duration (makespan). We also present results of an experimental investigation that reveal the efficacy of the proposed methodology Finally, we present an application of this methodology to a practical setting.
The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper...
详细信息
The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs' safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems. (C) 2018 Elsevier Ltd. All rights reserved.
We propose a Branch-and-Cut algorithm for the robust influence maximization problem. The influence maximization problem aims to identify, in a social network, a set of given cardinality comprising actors that are able...
详细信息
We propose a Branch-and-Cut algorithm for the robust influence maximization problem. The influence maximization problem aims to identify, in a social network, a set of given cardinality comprising actors that are able to influence the maximum number of other actors. We assume that the social network is given in the form of a graph with node thresholds to indicate the resistance of an actor to influence, and arc weights to represent the strength of the influence between two actors. In the robust version of the problem that we study, the node thresholds and arc weights are affected by uncertainty and we optimize over a worst-case scenario within given robustness budgets. We study properties of the robust solution and showthat even computing theworst-case scenario for given robustness budgets is NP-hard. We implement an exact Branch-and-Cut as well as a heuristic Branch-Cut-and-Price. Numerical experiments show that we are able to solve to optimality instances of size comparable to other exact approaches in the literature for the non-robust problem, and we can tackle the robust version with similar performance. On larger instances (= 2000 nodes), our heuristic Branch-Cutand-Price significantly outperforms a 2-opt heuristic. An extended abstract of this paper appeared in the proceedings of IPCO 2019.
We develop a technique for refining the unit commitment solution obtained from solving the Lagrangian. Our model is an integer program with nonlinear constraints. It can be solved to optimality using branch-and-bound....
详细信息
We develop a technique for refining the unit commitment solution obtained from solving the Lagrangian. Our model is an integer program with nonlinear constraints. It can be solved to optimality using branch-and-bound. Numerical results indicate a significant improvement in the quality of the solution obtained.
The problem of sequencing and scheduling airplanes landing and taking off on a runway is a major challenge for air traffic management. This difficult real-time task is still carried out by human controllers, with litt...
详细信息
The problem of sequencing and scheduling airplanes landing and taking off on a runway is a major challenge for air traffic management. This difficult real-time task is still carried out by human controllers, with little help from automatic tools. Several methods have been proposed in the literature, including mixed-integer programming (MlP)-based approaches. However, there is an opinion that MIP is unattractive for real-time applications, since computation times are likely to grow too large. In this paper, we reverse this claim, by developing a MIP approach able to solve to optimality real-life instances from congested airports in the stringent times allowed by the application. To achieve this, it was mandatory to identify new classes of strong valid inequalities, along with developing effective fixing and lifting procedures.
This article presents a three-phase methodology for scheduling assembly and test operations for semiconductor devices. The facility in which these operations are performed is a re-entrant flow shop consisting of sever...
详细信息
This article presents a three-phase methodology for scheduling assembly and test operations for semiconductor devices. The facility in which these operations are performed is a re-entrant flow shop consisting of several dozen to several hundred machines and up to a 1000 specialized tools. The semiconductor devices are contained in lots, and each lot follows a specific route through the facility, perhaps returning to the same machine multiple times. Each step in the route is referred to as a "pass." In the first phase of the methodology an extended assignment model is solved to simultaneously assign tooling and lots to the machines. Four prioritized objectives are considered: minimize the weighted sum of key device shortages, maximize the weighted sum of lots processed, minimize the number of machines used, and minimize the makespan. In the second phase, lots are optimally sequenced on their assigned machines using the same prioritized objectives. Due to the precedent relations induced by the pass requirements, some lots may have to be delayed or removed from the assignment model solution to ensure that no machine runs beyond the planning horizon. In the third phase, machines are reset to allow additional lots to be processed when tooling is available. The methodology was tested using data provided by the Assembly and Test facility of a leading manufacturer. The results indicate that high-quality solutions can be obtained within 1hour when compared with those obtained with a greedy randomized adaptive search procedure. Cost reductions were observed across all objectives and averaged 62% in the aggregate.
暂无评论