Multi-product pipelines are a significant and extensive mean of transporting petroleum based products from refineries to distribution centers. Previous contributions on tree-like pipeline scheduling problem have consi...
详细信息
Multi-product pipelines are a significant and extensive mean of transporting petroleum based products from refineries to distribution centers. Previous contributions on tree-like pipeline scheduling problem have considered a simple structure with a single refinery connected to a mainline and some secondary lines only emerged from the mainline. In practice, however, a tree-like pipeline may also have several branches on a secondary line resulting in a complex structure, the so called multi-level tree-like pipeline. This paper addresses the short-term scheduling of multi-level tree-like pipelines with multiple refineries through a continuous time mixed-integer linear programming (MILP) model that considers multiple intermediate due dates for product demands. The objective is to satisfy product demands on time at the minimum operational costs, such as pumping, interface and backorder costs. The proposed model performance's is shown by solving four examples.
This paper describes a method for solving task planning and motion planning problems simultaneously. We target a fetch-and-carry of a small item by a single-arm mobile manipulator and introduce a method that can gener...
详细信息
This article addresses two different pickup and delivery routing problems. In the first one, called the one-commodity pickup and delivery traveling salesman problem, a known amount of a single product is supplied or d...
详细信息
ISBN:
(纸本)9783030310196;9783030310189
This article addresses two different pickup and delivery routing problems. In the first one, called the one-commodity pickup and delivery traveling salesman problem, a known amount of a single product is supplied or demanded by a set of two different types of locations (pickup or delivery nodes). Therefore, a capacitated vehicle must visit each location once at a minimum cost. We also deal with the relaxed case where locations can be visited several times. In the last problem, the pickup or delivery operation can be split into several smaller pickups or deliveries, and also locations can be used as temporal storage points with the aim of reducing the cost of the route. To solve these problems, we present two mixed-integer linear programming models and we solve them via commercial solver. We analyze how several visits to a single location may improve solution quality and we also show that our simple strategy has a good performance for instances with up to 60 locations.
In a society where the demand for multimedia applications and data exchange is experiencing an unstoppable growth, multibeam systems have proven to be one of the most relevant solutions for satellite-based communicati...
详细信息
ISBN:
(纸本)9781467395199
In a society where the demand for multimedia applications and data exchange is experiencing an unstoppable growth, multibeam systems have proven to be one of the most relevant solutions for satellite-based communication systems. Though already well represented among the geostationary satellites today, there are still several unresolved design optimization challenges for these complex systems that could lead to improved performances and to better system costs. The satellite platform, the repeater, and the antennas are examples of subsystems that should be designed jointly in order to reach an optimized technical solution that fulfills the service requirements. Traditionally, such complex tasks are addressed through a decomposition of the overall system design into a sequence of smaller decision problems. In this article, we propose to rely on operations research techniques to, on the one hand, take into account explicitly the interdependencies of these decomposed problems, and on the other hand, to handle the own constraints of each subsystem and their interactions. In this paper, the focus is laid on the optimization of the beam layouts of the multibeam satellites. Indeed, in addition to being a perfect example of the aforementioned importance of dealing with subsystem constraints, this problem appears early in the chain of design of a multibeam satellite system and is therefore critical for the quality of the telecommunication system: the weaknesses of a beam layout cannot be made up for later on in the system design. For this crucial optimization phase, the strength of the methodology we propose in this paper is to use mixed-integer linear programming to incorporate explicitly technological feasibility constraints of the subsystems involved, while preparing at best the subsequent design problems. Most importantly, our approach allows to overcome several resisting flaws of the already existing algorithms.
This paper presents a mixed-integer linear programming model for the maintenance scheduling of generating units in the power system. The proposed model is investigated for weekly scheduling for one year addressing the...
详细信息
ISBN:
(纸本)9781665485371
This paper presents a mixed-integer linear programming model for the maintenance scheduling of generating units in the power system. The proposed model is investigated for weekly scheduling for one year addressing the crew availability constraint. The maintenance scheduling problem is modeled as an optimization problem to determine the optimal timing for handling the technical constraints of the power generation sector. In addition, the technical constraints for optimal scheduling of the tasks, like sequential tasks and rest time of the crews have been addressed in the scheduling management framework. The weekly peak power and spinning reserve have been considered in line with the economic issues for power generation in the whole system. The historical market clearing price (MCP) and mid-term load forecasting have been considered in the developed model.
In this paper, we study the optimization of coordinated train timetable in an urban rail network under the consideration of time-dependent passenger demands. This problem arises in large urban rail networks with multi...
详细信息
ISBN:
(纸本)9781538670248
In this paper, we study the optimization of coordinated train timetable in an urban rail network under the consideration of time-dependent passenger demands. This problem arises in large urban rail networks with multiple lines that the passengers may transfer among different lines to arrive at their destinations. We propose an exact formulation to generate the optimal train timetables of all the involved lines in a rail transit network synchronously, and our objective is to minimize the maximal level of crowdedness of stations. In particular, we introduce several sets of passenger flow variables that enable to model this complex problem as a mixed-integer linear programming (MILP) that is possible to be solved to the optimal solution. By considering the number of boarding and alighting passengers as passenger flow variables, we explicitly incorporates the number of in-vehicle passengers in the modelling framework to capture the train carrying capacity constraints. The formulated models first extend the passenger-oriented train timetabling models in existing literature from a single transit line to a whole connected network. Case studies are conducted to verify the effectiveness of the proposed model.
Background: Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands ...
详细信息
Background: Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Results: Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Conclusions: Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.
The integration of distributed generation units and microgrids in the current grid infrastructure requires an efficient and cost effective local energy system design. A mixed-integer linear programming model is presen...
详细信息
The integration of distributed generation units and microgrids in the current grid infrastructure requires an efficient and cost effective local energy system design. A mixed-integer linear programming model is presented to identify such optimal design. The electricity as well as the space heating and cooling demands of a small residential neighbourhood are satisfied through the consideration and combined use of distributed generation technologies, thermal units and energy storage with an optional interconnection with the central grid. Moreover, energy integration is allowed in the form of both optimised pipeline networks and microgrid operation. The objective is to minimise the total annualised cost of the system to meet its yearly energy demand. The model integrates the operational characteristics and constraints of the different technologies for several scenarios in a South Australian setting and is implemented in GAMS. The impact of energy integration is analysed, leading to the identification of key components for residential energy systems. Additionally, a multi-microgrid concept is introduced to allow for local clustering of households within neighbourhoods. The robustness of the model is shown through sensitivity analysis, up-scaling and an effort to address the variability of solar irradiation. (C) 2015 Elsevier Ltd. All rights reserved.
In this paper, we propose a flexible mixed-integer linear programming formulation of the AC OPF problem for distribution systems, using convexification and linearization techniques. The proposed formulation allows the...
详细信息
In this paper, we propose a flexible mixed-integer linear programming formulation of the AC OPF problem for distribution systems, using convexification and linearization techniques. The proposed formulation allows the representation of discrete decisions via integer decision variables, captures the nonlinear behavior of the electrical network via approximations of controllable accuracy, and can be solved to global optimality with commercial optimization solvers. The formulation is based on conventional variables that describe network behavior, which ensures its flexibility and the possibility of application to various distribution system problems, as we indicate with case studies.
As environmental problems become serious, many countries have been striving to change fossil-based energy to renewable and sustainable hydrogen energy. However, there are large capacity differences for each country...
详细信息
As environmental problems become serious, many countries have been striving to change fossil-based energy to renewable and sustainable hydrogen energy. However, there are large capacity differences for each country's hydrogen production, making hydrogen trading necessary. Although extensive research has investigated hydrogen technologies and economics, to the best of our knowledge, no study has examined the optimization of the overall hydrogen supply chain, from overseas supply to domestic consumption, considering various feasibility scenarios. This is a case study on the hydrogen supply chain for South Korea, which is expected to be one of the major hydrogen-importing countries, considering the decarbonized hydrogen requirements of the importing country and the production capacities of exporting countries over two decades. This study's optimized results for a hydrogen supply chain via mixed-integer linear programming reveal that it is most feasible for South Korea to import blue hydrogen from Qatar and Russia and green hydrogen from UAE and India, using liquefied hydrogen in the near term. This is because of the significantly lesser resource prices compared to other countries. The share of blue hydrogen supply dominates in the near term, while the green hydrogen supply is expected to gradually prevail over blue hydrogen due to an exponential drop in the renewable electricity price. With the price drop of green hydrogen, green hydrogen purchases from other countries in tandem with the UAE are predicted, rather than the blue hydrogen supply, considering that long-term demand will exceed the UAE's predicted capacity.
暂无评论