Sustainable optimization of waste management network over extended planning time horizon

This study proposes a multiperiod mixed integer linear programming model for the management of a single municipal solid waste (MSW) treatment plant with sustainability as the objective. Discrete and continuous variables define the capacity selections for diverse MSW technologies, and the operation of the MSW network, respectively. The economic target is considered to maximize the net present value. The environmental impact is the minimization of a normalized environmental objective function (NEOF). The social target is the maximization of jobs. An interesting feature about the research work is the requirement of biodrying technologies for MSW moisture content control. Due to the conflicted nature among the sustainability components, a multiobjective optimization (MO) is carried out to find the Pareto optimal solutions. The MO results show that the Pareto optimal solutions vary around profit range of $4.9–8.5 billion, NEOF impact range of 3.2–3.6 units, and social benefit range of 2700–4828 jobs.     

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

Effects of Smart Charging of Multiple Electric Vehicles in Reducing Power Generation Fuel Cost

The high penetration of variable sources of renewable power generation will lead to operational difficulties in supply/demand balancing in the entire power system. The mass deployment of electric vehicles (EVs) and plug‐in hybrid vehicles (PHEVs) will also cause significant changes in electricity demand. Therefore, controlling and managing the charging time of EVs/PHEVs are effective approaches that are imperative for improving balancing in power system operation. We assumed travel patterns for EVs in a model of the future Tokyo power system and analyzed the power system loads, including the charging load of the EVs, under several charging control scenarios. We verified that charging time controls are substantially effective for reducing the fuel costs in the power system. Further, we found that load leveling under a multicar charging management scenario gave the best results in terms of the fuel costs in all cases.     

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation,a Benders decomposition and a CP-based algorithm

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free; (ii) there is an upper bound on the number of times an item type may appear in the cutting pattern; (iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

Design and analysis of an aging‐aware energy management system for islanded grids using mixed‐integer quadratic programming

The rapid increase of renewable energy sources made coordinated control of the distributed and intermittent generation units a more demanded task. Matching demand and supply is particularly challenging in islanded microgrids. In this study, we have demonstrated a mixed‐integer quadratic programming (MIQP) method to achieve efficient use of sources within an islanded microgrid. A unique objective function involving fuel consumption of diesel generator, degradation in a lithium‐ion battery energy storage system, carbon emissions, load shifting, and curtailment of the renewable sources is constructed, and an optimal operating point is pursued using the MIQP approach. A systematic and extensive methodology for building the objective function is given in a sequential and explicit manner with an emphasis on a novel model‐based battery aging formulation. Performance of the designed system and a sensitivity analysis of resulting battery dispatch, diesel generator usage, and storage aging against a range of optimization parameters are presented by considering real‐world specifications of the Semakau Island, an island in the vicinity of Singapore.     

Enhancing stability region of time‐delayed smart power grids by non‐integer controllers

In this study, the impacts of non‐integer order controller on the stable parameter space of the microgrid (MG) frequency control system with fixed communication time delay are investigated and discussed with the help of the stability boundary locus (SBL) method. This study proposes a non‐integer order controller for the load frequency control (LFC) of the MG systems. To that end, the load frequency model of the MG is formulated and then the characteristic equations of this model are obtained. Then, with the help of this characteristic equation, the stable parameter space of the non‐integer controller is determined with regard to different time delay (τ ) and fractional integral order values (α ) using the SBL method. In order to show the accuracy of the obtained stable parameter space, time domain and generalized modified Mikhailov (GMM) criterion studies are carried out for different values of (τ ) and (α ). According to the results obtained, the areas of stable parameter space according to different α values and τ = 1.6 are calculated as 444.8860 for α = 0.4 , 342.9728 for α = 0.7 , 259.3578 for α = 1 , 216.2541 for α = 1.3 and 159.6826 for α = 1.6 . In addition, the areas of stable parameter space according to different τ values and α = 1.4 are calculated as 784.5222 for τ = 1 , 106.3219 for τ = 2 , 29.6959 for τ = 3 and 11.5946 for τ = 4 . Despite the extreme variability arising from nature of resources that make up the MG, the designed non integer order controller with the values selected within the stable parameter space stably carries out LFC control of the MG.     

Optimization models for shale gas water management

There are four key aspects for water use in hydraulic fracturing, including source water acquisition, wastewater production, reuse and recycle, and subsequent transportation, storage, and disposal. Water use life cycle is optimized for wellpads through a discrete‐time two‐stage stochastic mixed‐integer linear programming model under uncertain availability of water. The objective is to minimize expected transportation, treatment, storage, and disposal cost while accounting for the revenue from gas production. Assuming freshwater sources, river withdrawal data, location of wellpads, and treatment facilities are given, the goal is to determine an optimal fracturing schedule in coordination with water transportation, and its treatment and reuse. The proposed models consider a long‐time horizon and multiple scenarios from historical data. Two examples representative of the Marcellus Shale play are presented to illustrate the effectiveness of the formulation, and to identify optimization opportunities that can improve both the environmental impact and economical use of water. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3490–3501, 2014     

Optimal maintenance scheduling of a gas engine power plant using generalized disjunctive programming

A new continuous‐time model for long‐term scheduling of a gas engine power plant with parallel units is presented. Gas engines are shut down according to a regular maintenance plan that limits the number of hours spent online. To minimize salary expenditure with skilled labor, a single maintenance team is considered which is unavailable during certain periods of time. Other challenging constraints involve constant minimum and variable maximum power demands. The objective is to maximize the revenue from electricity sales assuming seasonal variations in electricity pricing by reducing idle times and shutdowns in high‐tariff periods. By first developing a generalized disjunctive programming model and then applying both big‐M and hull reformulation techniques, we reduce the burden of finding the appropriate set of mixed‐integer linear constraints. Through the solution of a real‐life problem, we show that the proposed formulations are very efficient computationally, while gaining valuable insights about the system. © 2014 American Institute of Chemical Engineers AIChE J, 60: 2083–2097, 2014