Technology progress is a cause of industrial hazardous wastes increasing in the whole world. Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be...
详细信息
Technology progress is a cause of industrial hazardous wastes increasing in the whole world. Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixedinteger programing model for location- routing industrial hazardous waste with two objectives is developed. First objective is total cost minimization including transportation cost, operation cost, initial investment cost, and cost saving from selling recycled waste. Second objective is minimization of transportation risk. Risk of population exposure within bandwidth along route is used to measure transportation risk. This model can help decision makers to locate treatment, recycling, and disposal centers simultaneously and also to route waste between these facilities considering risk and cost criteria. The results of the solved problem prove conflict between two objectives. Hence, it is possible to decrease the cost value by marginally increasing the transportation risk value and vice versa. A weighted summethod is utilized to combine two objectives function into one objective function. To solve the problem GAMS software with CPLEX solver is used. The problem is applied in Markazi province in Iran.
In this note, we point out that the mixedintegerprogramming model of a hybrid flowshop scheduling problems presented by Behnamian and Zandieh [Expert Syst. Appl. 38 (2011) 14490–14498] is incorrect. We also point o...
详细信息
In this note, we point out that the mixedintegerprogramming model of a hybrid flowshop scheduling problems presented by Behnamian and Zandieh [Expert Syst. Appl. 38 (2011) 14490–14498] is incorrect. We also point out that some responses from the authors are mistake.
In view of the forthcoming large-scale RES penetration, physical markets should check the feasibility of the electricity market clearing against their internal (intra-zonal) transmission network constraints, consideri...
详细信息
ISBN:
(纸本)9781479925582
In view of the forthcoming large-scale RES penetration, physical markets should check the feasibility of the electricity market clearing against their internal (intra-zonal) transmission network constraints, considering full network topology. Three methods for the solution of a market-splitting problem in a Europe-wide level are implemented in this paper. Two iterative processes are employed, iterating between the overall optimization algorithm and intra-zonal power flows of the countries/regions that identify possible internal congestions;the iterative processes terminate when all internal transmission constraints are satisfied. The results of the iterative processes are compared with the results of a one-stage solution of the overall problem, which incorporates the full set of transmission constraints of all European electricity markets. The proposed algorithms are also compared in terms of computational efficiency using the full UCTE network.
The integration of the European electricity market constitutes a critical and contemporary issue, expected to take place within year 2015. In view of the forthcoming RES penetration, physical markets with unit-based o...
详细信息
ISBN:
(纸本)9781479902002
The integration of the European electricity market constitutes a critical and contemporary issue, expected to take place within year 2015. In view of the forthcoming RES penetration, physical markets with unit-based offers -either power pools or Power Exchanges (PXs)- check the feasibility of the electricity market solution against their intra-zonal transmission capacity constraints. An iterative process is examined, with two variations, differentiating only in the way that the internal network of each physical market is represented. In each iteration of the proposed algorithm, intra-zonal power flows are calculated, possible violations of internal transmission limits are identified and additional constraints are incorporated in the centralized market splitting problem, in order to avoid the overloading of internal transmission lines. The attained results are compared to those of a centralized market-splitting problem, considering the full European network configuration. The above methods are compared in terms of (a) solution efficiency, (b) correct pricing and (c) computational efficiency.
Several mixed integer linear programming problems present a formulation based on a great number of knapsack constraints. Problems widely addressed in literature with this structure are, among others, Generalized Assig...
详细信息
ISBN:
(纸本)9781479903146
Several mixed integer linear programming problems present a formulation based on a great number of knapsack constraints. Problems widely addressed in literature with this structure are, among others, Generalized Assignment, Multiple Knapsack, Bin Packing, Capacitated P-median and Single Source Capacitated Facility Location. In general knapsack constraints make these problems very hard to solve. The state of the art on these problems requires to use approaches besed on Lagrangean Relaxation or decomposition approaches like Dantzig-Wolfe and Column Generation tenchniques. In this paper, we present an approach based on the generation of general cutting planes of the polyhedron associated with each knapsack constraints. This approach yelds a lower bound for the LP-relaxation that is the same obtained by the Dantzig-Wolfe decomposition and henceforth stronger than the LP-relaxation. We use this aproach in the solution of the Single Source Capacitated Facility Location problem (SSCFLP) using a Branch-and-Cut algorithm. Computational experience is reported on a large set of test instances available in literature.
Cache partitioning is a promising technique to reduce energy consumption of the cache subsystem for MPSoCs. Currently, most existing techniques focus primarily on static partition on core level. In this paper, we pres...
详细信息
ISBN:
(纸本)9781479904945
Cache partitioning is a promising technique to reduce energy consumption of the cache subsystem for MPSoCs. Currently, most existing techniques focus primarily on static partition on core level. In this paper, we present a task-level approach and show that it outperforms core-level strategies. By taking the interference patterns of individual tasks into account, our approach generates optimal task-level cache partition schemes as well as feasible schedules at compilation time by means of a mixed integer linear programming formulation. We also present techniques to prune the exploration space of our formulation. Experimental results using real-world benchmarks demonstrate that our approach achieves 33% energy savings on average compared to core-based cache partition approaches.
Summary form only given. This paper presents a stochastic mixed-integerlinearprogramming (SMILP) approach to maximize total expected profit of one price-maker hydro producer in a pool-based electricity market. Head ...
详细信息
Summary form only given. This paper presents a stochastic mixed-integerlinearprogramming (SMILP) approach to maximize total expected profit of one price-maker hydro producer in a pool-based electricity market. Head dependence, commitment decisions, discharge ramping, startup costs and forbidden zones are all effectively handled in our approach. Uncertainty about the competitors' offers is adequately represented by residual demand curves (RDCs) scenarios. The management of risk is suitably addressed by conditional value-at-risk (CVaR) to provide the efficient frontier, i.e, the solutions set for which the expected profit may not be augmented without enlarging the variance of profit. Appropriate offering strategies to the pool are also developed, consisting of supply functions built for different risk levels. A representative cascaded hydro system with 7 reservoirs is considered to analyze and compare risk-neutral vs. risk-averse results.
In this study, we consider the single machine scheduling problem with release dates to minimize total weighted completion time. This problem is known to be strongly NP-hard. First, we present five different formulatio...
详细信息
In this study, we consider the single machine scheduling problem with release dates to minimize total weighted completion time. This problem is known to be strongly NP-hard. First, we present five different formulations based on mixed integer linear programming different definitions of decision variables. Second, new recursive weights decomposition-based lower bounds are proposed, then we generalize an improved split-based lower bound from literature. A constructive greedy heuristic is proposed based on evaluation function with partially lower bound assessment. A first improvement procedure using Hill Climbing search is presented. Experimental study shows promising results.
Traffic signal control is a key ingredient in intelligent transportation systems (ITS) to increase the capacity of existing urban transportation infrastructure. However, to achieve optimal system-wide operation it is ...
详细信息
ISBN:
(纸本)9781479929153
Traffic signal control is a key ingredient in intelligent transportation systems (ITS) to increase the capacity of existing urban transportation infrastructure. However, to achieve optimal system-wide operation it is essential to coordinate traffic signals at various intersections. In this paper we model the multiple-intersections traffic signal control problem using the cell transmission model. For its solution, we propose two online distributed strategies, which are based on spatially and temporally decomposing the problem into subproblems associated with different intersections and iteratively solving them by exchanging information between neighboring intersections. Simulation results for a four intersection topology indicate that the proposed strategies achieve distributed, online and close to optimal signal timing plans.
With the developments in linearprogramming code, a mixed integer linear programming (MILP)-based approaches have started to attract more attention in the word, some new linearization methods have been proposed. In th...
详细信息
With the developments in linearprogramming code, a mixed integer linear programming (MILP)-based approaches have started to attract more attention in the word, some new linearization methods have been proposed. In this paper, MILP formulation of short-term scheduling for cascaded plants with pumped-storage units is established, for the nonlinear factors such as nonlinear hydroelectric production function, the characteristics of pumped-storage units, minimum/maximum down/up time of hydro units, etc. A new practical and systematic linearization approach is proposed. Some integer variables are introduced such that the problem is formulated as MILP. Numerical testing results show that the MILP formulation given in this paper is efficient and effective.
暂无评论