Search

Reservoir systems are essential for water resources management. The application and development of optimization techniques for optimal reservoir operation is therefore a valuable undertaking. This paper presents a modified firefly algorithm (MFA) and applies it to optimally solve reservoir operation problems. Three well-known benchmark multireservoir operation problems are optimized for energy production. The results of the MFA are compared with results obtained with other mathematical programming approaches, such as linear programming (LP), differential dynamic programming (DDP), and discrete DDP (DDDP), the genetic algorithm (GA), the multicolony ant algorithm (MCAA), the honey-bee mating optimization (HBMO) algorithm, the water cycle algorithm (WCA), the bat algorithm (BA), and the biogeography-based optimization (BBO) algorithm. The MFA was found to be more effective than alternative optimization methods in solving the test problems demonstrating its strong potential to tackle multireservoir operation problems. This paper's results indicate that the MFA differed by 0.01 and 0.79% with the LP global optimal solutions of a continuous four-reservoir problem (CFP) and a continuous 10-reservoir problem (CTP), respectively. The objective function of a discrete four-reservoir problem (DFP) obtained with the MFA is equal to the LP's objective function. This paper demonstrates that the MFA is a competitive optimization method with which to solve a variety of reservoir operation problems. [ABSTRACT FROM AUTHOR]

A noncrossover dither creeping mutation-based genetic algorithm (CMBGA) for pipe network optimization has been developed and is analyzed in this paper. This CMBGA differs from the classic genetic algorithm (GA) optimization in that it does not utilize the crossover operator; instead, it only uses selection and a proposed dither creeping mutation operator. The creeping mutation rate in the proposed dither creeping mutation operator is randomly generated in a range throughout a GA run, rather than being set to a fixed value. In addition, the dither mutation rate is applied at an individual chromosome level rather than at the generation level. The dither creeping mutation probability is set to take values from a small range that is centered about (where = number of decision variables of the optimization problem being considered). This is motivated by the fact that a mutation probability of approximately previously has been demonstrated to be an effective value and is commonly used for the GA. Two case studies are used to investigate the effectiveness of the proposed CMBGA. An objective of this paper is to compare the performance of the proposed CMBGA with four other GA variants and other published results. The results show that the proposed CMBGA exhibits considerable improvement over the considered GA variants, and comparable performance with respect to other previously published results. Two big advantages of the CMBGA are its simplicity and the fact that it requires the tuning of fewer parameters compared with other GA variants. [ABSTRACT FROM AUTHOR]

Intensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem for medium and large-scale projects. This paper presents a new particle swarm optimization method to achieve an advancement in the Pareto front optimization of medium and large-scale construction projects. The proposed Pareto front particle swarm optimizer (PFPSO) is based on a multiobjective optimization environment with novel particle representation, initialization, and position-updating principles that are specifically designed for simultaneous time-cost optimization of large-scale projects. PFPSO brings several benefits for the discrete time-cost optimization, such as an adequate representation of the discrete search space, fast convergence properties, and improved Pareto front optimization capabilities. The computational experiment results reveal that the new particle swarm optimization method outperforms the state-of-the-art methods, both in terms of the number of Pareto front solutions and computation time, especially for medium and large-scale problems. A large number of nondominated solutions are achieved within seconds for the first time, for a problem including 720 activities. The proposed Pareto front particle swarm optimizer provides a fast and effective method for optimal scheduling of construction projects. [ABSTRACT FROM AUTHOR]

In nonlinear construction optimization problems, the capability of current optimization algorithms to find an optimal solution is usually limited by their inability to evaluate the effects of changing the value of each decision variable on reaching the optimal solution. This paper presents fundamental research aimed at developing a novel evolutionary optimization algorithm, named Electimize, that mimics the behavior of electrons flowing, through electric circuit branches with the least electric resistance. In the proposed algorithm, solutions are represented by electric wires and are evaluated on two levels: a global level, using the objective function, and a local level, evaluating the potential of each generated value for every decision variable. The paper presents (1) the research philosophy and scope, (2) the research methodology, and (3) the development of the algorithm. The proposed algorithm has been validated and applied successfully to an NP-hard cash flow optimization problem. The algorithm was able to find a better optimal solution and identified ten alternative optimal solutions for the same problem. This should prove useful in enhancing the optimization of complex large-scale problems. [ABSTRACT FROM AUTHOR]

In this paper, the use of a hybrid evolutionary optimization algorithm is proposed for global optimization of pavement structural parameters through inverse modeling. Shuffled complex evolution (SCE) is a population-based stochastic optimization technique combining the competitive complex evolution with the controlled random search, the implicit clustering, and the complex shuffling. Back-calculation of pavement layer moduli is an ill-posed inverse engineering problem, which involves searching for the optimal combination of pavement layer stiffness solutions in an unsmooth, multimodal, complex search space. SCE is especially considered a robust and efficient approach for global optimization of multimodal functions. A desirable characteristic of the SCE algorithm is that it uses information about the nature of the response surface, extracted using the deterministic Simplex geometric shape, to direct the search into regions with higher posterior probability. The hybrid back-calculation system described in this paper combines the robustness of the SCE in global optimization with the computational efficiency of neural networks and advanced pavement system characterization offered by employing finite-element models. This is the first time the SCE approach is applied to real-time nondestructive evaluation of pavement systems required in the routine maintenance and rehabilitation activities for sustainable transportation infrastructure. [ABSTRACT FROM AUTHOR]

Considerable research has been carried out on the optimization of water distribution systems (WDSs) over the last three decades. In previous research, attention has mainly focused on the minimization of cost, due to the high expenditure associated with the construction and maintenance of such systems. However, the impacts of WDSs on the environment usually have not been considered adequately. The recent increasing awareness of sustainability and climate change, especially global warming, has led to research where greenhouse gas (GHG) emissions are considered. In the study described in this paper a multiobjective genetic algorithm for WDS optimization has been used as an explorative tool to investigate the trade-offs between the traditional economic objective of minimizing costs and an additional environmental objective of minimizing GHG emissions. The impacts of minimizing GHG emissions on the results of WDS optimization have been explored for a case study in this paper. The results indicate that the inclusion of GHG emission minimization as one of the objectives results in significant trade-offs between the economic and environmental objectives. Furthermore, a sensitivity analysis has been conducted by using different discount rates in a present value analysis for computing both ongoing costs and GHG emissions. The results obtained show that the Pareto-optimal front is very sensitive to the discount rates used. As a result, the selection of discount rates has a significant impact on final decision making. [ABSTRACT FROM AUTHOR]

Cost-effective reduction of water loss is a compelling but challenging task for water utilities. This paper presents a model-based optimization method for leakage detection of water distribution systems. Leakage hotspots are assumed to exist at the model nodes identified. Leakage is represented as pressure-dependent demand simulated as emitter flows at selected model nodes. The leakage detection method is formulated to optimize the leakage node locations and their associated emitter coefficients such that the differences between the model predicted and the field observed values for pressure and flow are minimized. The optimization problem is solved by using a competent genetic algorithm. The leakage detection method is developed as an add-on feature of the optimization-based model calibration tool. This enables engineers to undertake leakage hotspot optimization as an independent task or combine the task with hydraulic model calibration, subject to suitably varied field data. Two case studies are discussed in this paper including an example from literature and a district water system in the United Kingdom. The results obtained illustrate that the optimization model for predicting leakage hotspots can be effective despite the recognized challenges of model calibration and the physical measurement limitations from the pressure and flow surveys also referred to as field tests. It is found that the method is effective at being applied for hydraulic conditions that occur in the early hours of the morning, often on water networks with excess design capacity and where hydraulic gradients are slack and loggers may sometimes be working close to their limits of accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an enhanced design methodology for optimal mixture proportion of concrete composition with respect to accuracy in the case of using prediction models based on a limited database. In proposed methodology, the search space is constrained as the domain defined by a limited database instead of constructing the database covering the region represented by the possible ranges of all variables in the input space. A model for defining the search space which is expressed by the effective region in this paper and evaluating whether a mix proportion is effective is added to the optimization process, yielding highly reliable results. To demonstrate the proposed methodology, a genetic algorithm, an artificial neural network, and a convex hull were adopted as an optimum technique, a prediction model for material properties, and an evaluation model for the effective region, respectively. And then, it was applied to an optimization problem wherein the minimum cost should be obtained under a given strength requirement. Experimental test results show that the mix proportion obtained from the proposed methodology considering the regional characteristics of the database is found to be more accurate and feasible than that obtained from a general optimum technique that does not consider this aspect. [ABSTRACT FROM AUTHOR]

The problem of deploying sensors in a large water distribution network is considered, in order to detect the malicious introduction of contaminants. It is shown that a large class of realistic objective functions—such as reduction of detection time and the population protected from consuming contaminated water—exhibits an important diminishing returns effect called submodularity. The submodularity of these objectives is exploited in order to design efficient placement algorithms with provable performance guarantees. The algorithms presented in this paper do not rely on mixed integer programming, and scale well to networks of arbitrary size. The problem instances considered in the approach presented in this paper are orders of magnitude (a factor of 72) larger than the largest problems solved in the literature. It is shown how the method presented here can be extended to multicriteria optimization, selecting placements robust to sensor failures and optimizing minimax criteria. Extensive empirical evidence on the effectiveness of the method presented in this paper on two benchmark distribution networks, and an actual drinking water distribution system of greater than 21,000 nodes, is presented. [ABSTRACT FROM AUTHOR]

The network signal design problem (NSDP) seeks the optimal deployment of traffic signals in a growing urban area. This paper is especially concerned with how signals may be optimally deployed over a very long period of time for the purpose of creating realistic networks for travel forecasting. The NSDP is very difficult to solve for long-range problems because of the large number of possible solutions, the high cost of evaluating the merits of just a single solution, and the complexities of how signal delay affects traffic patterns and how traffic patterns affect signal delay. The paper describes the NSDP, introduces a reasonable set of simplifications based on transportation planning and traffic engineering practice, describes experiences with a possible heuristic algorithm for problem solution, and contrasts this method with current planning practice and other research. The long-range algorithm embeds a “strategic” algorithm for finding an optimal deployment for a single time period with constant travel demands. The strategic algorithm draws upon two well-known techniques of combinatorial optimization: a greedy constructive search coupled with a restricted neighborhood search. The strategic algorithm was able to find exact solutions on a small test network with eight stop-controlled intersections. The long-range algorithm is demonstrated on a full-sized planning network with about 380 stop-controlled intersections that could be signalized. [ABSTRACT FROM AUTHOR]

This paper presents a coupled self-adaptive multiobjective differential evolution and network flow algorithm for the optimal operation of complex multipurpose reservoir systems. The developed algorithm (i.e., self-adaptive multiobjective differential evolution) is compared to nondominated sorting genetic algorithm II using a set of common test problems and a real-world case study. An out-of- kilter method for minimal-cost flow problems is used to optimize the water resource system from self-adaptive multiobjective differential evolution inputs driven by the evolutionary process. Self-adaptive multiobjective differential evolution is then used to evaluate objective functions based on the outputs from out-of-kilter algorithm and the process continues until the stop criterion is met. The advantages of the proposed approach include (1) flexible evolutionary algorithms for solving highly complex objective function, and (2) efficient network flow method for dealing with large and highly constrained problems. The case study includes one part of a complex water supply system located in southwestern Brazil that provides water for almost 20 million people in Sao Paulo metropolitan area. The objectives of the case study include minimization of demand shortage (the difference between demand for water and available water supply), maximization of water quality (or minimization of the deviation from the water quality standards), and minimization of pumping cost. The coupled model is applied to the case study using one inflow scenario representing a drought period with inflows below historical average. Multiobjective analyses are performed by comparing two pairs of objective functions, as follows: (1) minimization of demand shortage versus minimization of pumping cost, and (2) minimization of demand shortage versus minimization of the deviation from the water quality standards. The problem constraints include reservoir capacity, capacity of tunnels, channel flow limitations, and minimum downstream release for all reservoirs within the system. The proposed coupled model (self-adaptive multiobjective differential evolution and out-of-kilter) is outperforming both pure self-adaptive multiobjective differential evolution and nondominated sorting genetic algorithm II, as it requires significantly smaller number of generations to derive the Pareto front. In addition, the proposed approach is capable of handling larger problems without major computational burden. The coupled model and self-adaptive multiobjective differential evolution also converge closer to, and provide better coverage of the true Pareto front than, nondominated sorting genetic algorithm II. [ABSTRACT FROM AUTHOR]

The design of a water distribution network (WDN) is conceptually a multiobjective problem characterized by stringent constraints. Even in its most simple formulation, which requires only the maintenance of minimum pressures, it is difficult to solve, and the simplifications introduced often impair the practicality of the solutions. The paper aims at integrating an engineering approach to the optimization problem by generating pseudofronts in the hydraulically feasible region of the search space. The optimization algorithms provide an entirely feasible trade-off between cost and considered constraints, which may be directly used by a hypothetical decision maker. This engineering approach requires a fast tool to search for feasible solutions: the recently developed genetic heritage by stochastic evolution transmission (GHEST) algorithm, used herein, has proved to be effective and efficient in solving the optimal design problem of WDNs. Tests are carried out on two large-size water distribution networks (Balerma and Modena), using the GHEST algorithm, modified to account for several objectives. [ABSTRACT FROM AUTHOR]

An effective strategy in reducing train-induced vibrations on neighboring structures is to use open trenches on both sides of the railway lines. This paper investigates the effect of the trench's shape on its performance. For this purpose, a V-shaped trench was first modeled using finite-element code, and its efficiency was confirmed in reducing the induced vibrations caused by passing the MD36 passenger bogie in comparison with a rectangular-shaped trench. In this regard, results indicate that the maximum values of the amplitude reduction ratio () for the ground displacement before the V-shaped trench for train speeds of were 1.17 and 1.28, respectively, which were less than the value of 2 obtained for the rectangular trench. In the final stage, an optimization algorithm was used to present the procedure of calculating optimized shape of the proposed V-shaped trench for various train speeds. [ABSTRACT FROM AUTHOR]

The quality of hot mix asphalt is affected by the quality and consistency of input aggregates and the control of the production process. To improve the quality of hot mix asphalt, both the aggregates gradation and the process variables must be considered. Current practice involves taking samples from actual production and analyzing them in the lab. The entire process can take two hours, which, along with being expensive, is not amenable to real time online process control or even in knowing how much product is actually out of specification. In this paper, an online control system is proposed that can be used to significantly decrease the analysis time and adjust production by using discrete time stochastic simulation combined with algorithmic optimization. Additionally, the system can readily show when a mix is out of specification without lag time or physical experimentation. Results show that this approach can effectively control the production process resulting in improved quality. This is the first known such application in hot mix asphalt online process control. [ABSTRACT FROM AUTHOR]

This paper presents a method to locate the global critical slip surface for slope profiles with complex geology. In this method, a readily available concise algorithm based on the Morgenstern-Price method is used to efficiently calculate the factor of safety for a slip surface. This algorithm is combined with an optimization technique to search for global critical slip surfaces based on a set of random initial slip surfaces. The proposed method is applied to analyze three example problems involving slope profiles with various degrees of complexity. This study indicates that the proposed global search strategy can locate the global critical slip surface regardless of the initial slip surface for slope profiles with low to moderate complexity. For more complex geologic slope profiles, however, the proposed search strategy may only be able to identify locally critical slip surfaces depending on the initial slip surface. To ensure that the global critical slip surfaces are identified, more random initial slip surfaces need to be considered. A sound engineering judgment may be combined with the global search algorithm presented in this study to locate global critical slip surfaces more efficiently. [ABSTRACT FROM AUTHOR]

This work presents a postoptimization methodology for refining the solutions found by adaptive search algorithms used in the design of large water distribution networks. The approach uses two heuristics to search for an optimal combination of pipes that, after a reduction of their diameters, will maximize cost savings while continuing to meet design constraints. Adaptive search methods are often used to design urban water distribution networks when the number of pipes in the network is insignificant. For complex, real-world networks, however, such methods are computationally demanding, and they have difficulty finding near-global optima. To identify a solution as close to the global optimum (and in which no pipe can be reduced without violating pressure constraint), requires a high-speed computer potentially running for a long time and also probably some good fortune. The postoptimization approach presented in this paper is shown to be an efficient complement to heuristic search algorithms used in the design of real-world networks. In a network created with the aid of a genetic algorithm, the proposed heuristics found that 4.37% of the pipes with a diameter greater than the minimum could be further reduced without causing hydraulic failure. [ABSTRACT FROM AUTHOR]

This paper presents a multiobjective model for optimization of the activated sludge process (ASP) in a wastewater-treatment plant (WWTP). To minimize the energy consumption of the activated sludge process and maximize the quality of the effluent, three different objective functions are modeled [i.e., the airflow rate, the carbonaceous biochemical oxygen demand (CBOD) of the effluent, and the total suspended solids (TSS) of the effluent]. These models are developed using a multilayer perceptron (MLP) neural network based on industrial data. Dissolved oxygen (DO) is the controlled variable in these objectives. A multiobjective model that included these objectives is solved with a multiobjective particle swarm optimization (MOPSO) algorithm. Computation results are reported for three trade-offs between energy savings and the quality of the effluent. A 15% reduction in airflow can be achieved by optimal settings of dissolved oxygen, provided that energy savings take precedence over the quality of the effluent. [ABSTRACT FROM AUTHOR]

Designing baseline or vertical alignment in railways greatly depends on the designer's experience. An inaccurate design imposes unreasonable costs during construction and operations. This paper presents a program to find the best vertical alignment for a track with a given horizontal layout. First, the vertical alignment is formulated using mathematical equations, and then an algorithm is developed to produce its geometric configuration. Construction and operating costs, which are sensitive to gradient changes, are expressed as vertical alignment variables and included in the model. A direct search method is employed to solve the objective function, and a genetic algorithm encodes solution algorithms in a program, whereas certain heuristic operators are utilized to cover operational situations. The program also provides railway engineers and planners with practical information on the resulting alignment such as time and speed graph, total traction force, and block capacity. Moreover, the model is evaluated using a real example to verify the algorithms' ability to find the optimal alignment. [ABSTRACT FROM AUTHOR]

In this paper, an optimization model for force finding of tensegrity systems with considerations of the geometrical stability condition, the unilateral property of members, and the evenness requirement of internal forces was developed. The simulated annealing algorithm was used to solve this optimization problem. Force finding of several typical tensegrity systems was carried out with the proposed method. It was found that the optimized solutions were very close to the analytical solutions and able to reflect the geometrical symmetry of the structures. It also verified that the proposed method is applicable to tensegrity systems under consideration including simple two-dimensional structures and complex three-dimensional multimodular structures. [ABSTRACT FROM AUTHOR]

Reservoir flood control operation (RFCO) is a large scale multiobjective problem with complex constraints that require powerful algorithms to solve it. As a new metaheuristic evolutionary algorithm, shuffled frog leaping algorithm (SFLA) has the potential ability to solve multiobjective optimization problems because of its group evolution characteristic. In this paper, we present a novel multiobjective shuffled frog leaping algorithm (MOSFLA), which incorporates an archiving strategy based on self-adaptive niche method to maintain the nondominated solutions, and improves the memetic evolution process of SFLA to adapt to the multiobjective optimization problem. The numerical experiments of five Zitzler-Deb-Thiele functions indicate that MOSFLA yields better-spread solutions and converges closer to the true Pareto frontier than non-denominated sorting genetic algorithm (NGSA)-II and SPEA2. Furthermore, MOSFLA is applied to solve RFCO of the Three Gorges Project, and the results demonstrate that this algorithm can generate a solution set with uniform spread and good convergence for the problems with two conflicting objectives, including minimizing the highest reservoir water level and minimizing the peak flood discharge. Additionally, if compared with dynamic programming and NGSA-II, MOSFLA is verified to be more efficient and competitive, and thus can be provided as a new effective alternative for solving the complex reservoir operation problems. [ABSTRACT FROM AUTHOR]

The suitability of genetic algorithms (GAs) for the optimization of water distribution systems (WDSs) has been demonstrated extensively. However, despite many years of application in many different fields, the selection of the GA parameters remains a difficult and time consuming task. In this paper, two methodologies that do not require trial-and-error GA parameter calibration have been tested on a WDS optimization problem to determine their suitability for application in the water resources field and to assess their ability in locating near-optimal solutions. The results indicate that both approaches located solutions that were significantly better than a GA using typical parameter values, while the methodology based on convergence of the GA population located the best solutions overall. This method can be easily applied to assist GA users in identifying suitable GA parameters without requiring a time consuming trial-and-error approach. [ABSTRACT FROM AUTHOR]

Water distribution network is a costly infrastructure and plays a crucial role in supplying water for the consumers especially for those who are living in the urban areas. The importance and huge capital cost of the system leads to considerable attention on seeking the optimal cost design. The necessity for such a sound research attention arises from the complexity associated with the problem. In the recent years, stochastic optimization algorithms like genetic algorithm, simulated annealing, ant colony optimization etc. are found to be successful in exploring the optimal combination of pipe diameters that can satisfy the hydraulic-head requirements with least cost. In this paper, the details on the optimal water distribution network design with a novel technique called honey-bee mating optimization and its validation with two benchmark water distribution networks are presented. From the results, it is observed that the proposed algorithm identifies the optimal solution with relatively less number of evaluations than the other well-established stochastic optimization algorithms. [ABSTRACT FROM AUTHOR]

The paper presents a method for the design of water distribution networks with various network elements such as pipes, pumps, and tanks. A steady-state genetic algorithm is used to solve the proposed single objective model. Minimization of total cost, which includes capital cost and energy cost, is considered as the objective. A new approach for tank sizing is proposed, which does not require explicit consideration of some of the operational constraints, such as the limits on maximum and minimum tank levels. Unlike other methods, the one proposed here conducts extended period simulation for every trial solution in the optimization process. To demonstrate the efficacy of the model, a well-known design example, namely the “Anytown” water distribution network is solved. Designs obtained, using the present method, are cheaper than those proposed by other researchers under similar performance conditions but with different tank sizing methods. Comparison of the results obtained with those published in the literature shows the advantage of using the proposed model in obtaining optimal/near optimal solutions. [ABSTRACT FROM AUTHOR]

Contamination emergency in water distribution systems is a complex situation where optimal operation becomes important for public health. In case of emergency corrective operational actions for flushing the pollutant out of the network are needed, which have to be fast and accurate. Under such a stressful situation, trial-and-error simulation experiments with the hydrodynamic and water quality models cannot be applied since significant number of model evaluations may be required to identify the optimal solution. This paper presents a methodology for finding sets of operational interventions in a supply network for flushing a contaminant by minimizing the impact on the population. The situation is treated as both single- and multiobjective optimization problem, which is solved by using evolutionary optimization approaches, in combination with the EPANET solver engine. The methodology is tested on a simple imaginary network configuration, as well as on a real case study for the city of Villavicencio in Colombia. The results prove the usefulness of the approach for advising the operators and decision makers. [ABSTRACT FROM AUTHOR]

Water distribution network that includes supply reservoirs, overhead tanks, consumer demand nodes, interconnecting pipes, lifting pumps, and control valves is the main mode of water supply for majority of the communities especially in urban areas. Supply of required quantity of water and at right time is the primary objective of water distribution network analysis. The analysis of water distribution networks can be broadly classified into design and operation problems and both problems have been the focus of many researchers over the past three decades. In the water distribution network design problems, the target is attaining the cost effective configuration that satisfies the minimum hydraulic head requirement at the demand nodes. In this paper, a new algorithm for design of water distribution network namely “heuristics-based algorithm” which completely utilizes the implicit information associated with the water distribution network to be designed has been proposed and validated with two water distribution networks. It is found that the proposed algorithm performs well for the least-cost design of water distribution networks. [ABSTRACT FROM AUTHOR]

The short-term optimal hydrogeneration planning is a complicated nonlinear constrained optimization problem with water delay time. To overcome the shortcomings of a standard genetic algorithm, this paper proposes a new real-value encoding self-adaptive chaotic genetic algorithm to solve this problem, which designs a new crossover operator in light of probability distribution function and a self-adaptive chaotic mutation operator combined chaotic dynamic character with artificial neural network theory. Constraints can be dealt with by using a simple direct comparison penalty function method without the need of any penalty coefficient. The feasibility of the proposed method is demonstrated for short-term generation scheduling of two test hydrosystems and the test results are compared with those obtained by the standard genetic algorithm in terms of solution quality and convergence characteristic. The simulation results show that the proposed method is capable of obtaining higher quality solutions. [ABSTRACT FROM AUTHOR]

The writers have come across a difficult stability analysis problem where there are several “strong” local minima. Several well known heuristic global minimum methods fail to locate the global minimum for this case, and the writers finally adopt the artificial fish swarms algorithm to overcome this difficult problem. This optimization algorithm is demonstrated to be effective and efficient for normal problems. To illustrate the effectiveness of the proposed algorithm, three difficult examples are considered. The sensitivity of the proposed algorithm with respect to the parameters used for the global optimization algorithm will also be investigated in this paper. [ABSTRACT FROM AUTHOR]

A common method for assessing the energy potential of hydropower systems in Iran is the sequential streamflow routing with control on the energy-yield reliability. The method results in developing a reliability-based simulation (RBS) model that is used to analyze single-reservoir hydropower systems. In most of the cascade hydropower systems in the country, a single-reservoir RBS model is usually employed in the design and operation of each of the systems reservoirs. This paper presents a multireservoir RBS model considering the integrated operation of the systems. The model employs the general algorithm of the single-reservoir RBS model; however, with a single-period optimization submodel in determining releases from reservoirs during the system simulation. The objective function of the submodels minimizes the sum of reservoir releases and/or maximizes the sum of reservoir storages in each of the time periods, subject to a reliability constraint on the system’s energy yield. The single and multireservoir RBS models are applied in the Khersan hydropower system located in Iran as a case study. The multireservoir RBS, compared to the single-reservoir model, results in 7.9% excess firm-energy yield in reliability of 90%. [ABSTRACT FROM AUTHOR]

A cost effective channel section for a specified flow rate, roughness coefficients, longitudinal slope, and various cost parameters can be determined using an optimization technique. However, the derived optimal channel section may not be feasible for construction because of in situ conditions. The local soil conditions may not support the optimal side slope of the channel and if constructed, the slope may fail. It is therefore necessary to also incorporate the criteria for side slope stability in designing an optimal open channel section. In this paper, a new methodology has been developed to design a stable and optimal channel section using hybrid optimization techniques. A genetic algorithm based optimization model is developed initially to determine the factor of safety of a channel slope for given soil parameters. This optimization model is then externally linked with a separate sequential quadratic programming based optimization model to evaluate the parameters of the stable and optimal channel section. Solution for various example problems incorporating different soil parameters are illustrated to demonstrate the applicability of the developed methodology. [ABSTRACT FROM AUTHOR]

Water distribution systems (WDSs) are costly infrastructure, and much attention has been given to the application of optimization methods to minimize design costs. In previous studies, ant colony optimization (ACO) has been found to perform extremely competitively for WDS optimization. In this paper, five ACO algorithms are tested: one basic algorithm (ant system) and four more advanced algorithms [ant colony system, elitist ant system, elitist-rank ant system (ASrank), and max-min ant system (MMAS)]. Experiments are carried out to determine their performance on four WDS case studies, three of which have been considered widely in the literature. The findings of the study show that some ACO algorithms are very successful for WDS design, as two of the ACO algorithms (MMAS and ASrank) outperform all other algorithms applied to these case studies in the literature. [ABSTRACT FROM AUTHOR]

This paper presents a mathematical stochastic methodology for transit route network optimization. The goal is to provide an effective computational tool for the optimization of a large-scale transit route network to minimize transfers with reasonable route directness while maximizing service coverage. The methodology includes representation of transit route network solution search spaces, representation of transit route and network constraints, and a stochastic search scheme based on an integrated simulated annealing and genetic algorithm solution search method. The methodology has been implemented as a computer program, tested using previously published results, and applied to a large-scale realistic network optimization problem. [ABSTRACT FROM AUTHOR]

Practical optimization of infrastructure preservation works programming has always posed a computational challenge due to the complexity and scale of the problem. Critical to the process is formulations in which the identity of individual projects is preserved. This requirement leads to exponential growth of solution space, often resulting in an unmanageable process using traditional analytical optimization techniques. In this paper, we propose an evolutionary-based multiyear optimization procedure for solving network level infrastructure works programming problems using a relatively new concept known as the shuffled complex evolution algorithm. A case study problem is analyzed to illustrate the robustness of the technique. The findings show convergence characteristics of the solution and demonstrate that the algorithm is very efficient and consistent in simultaneous consideration of the trade-off among various infrastructure preservation strategies. It is concluded that the robust search capability of the shuffled complex evolution technique is well suited for solving the combinatorial problems in network level infrastructure preservation works programming. [ABSTRACT FROM AUTHOR]

A new approach is presented for the optimization of steel lattice towers by combining genetic algorithms and an object-oriented approach. The purpose of this approach is to eliminate the difficulties in the handling of large size problems such as lattice towers. Improved search and rapid convergence are obtained by considering the lattice tower as a set of small objects and combining these objects into a system. This is possible with serial cantilever structures such as lattice towers. A tower consists of panel objects, which can be classified as separate objects, as they possess an independent property as well as inherent properties. This can considerably reduce the design space of the problem and enhance the result. An optimization approach for the steel lattice tower problem using objects and genetic algorithms is presented here. The paper also describes the algorithm with practical design considerations used for this approach. To demonstrate the approach, a typical tower configuration with practical constraints has been considered for discrete optimization with the new approach and compared with the results of a normal approach in which the full tower is considered. [ABSTRACT FROM AUTHOR]

In this paper the authors propose a global-local methodology for optimizing the short-term operation of hydroelectric plants. The authors determine the tradeoffs between minimizing the daily release from the plant and minimizing the number of startups and shutdowns of the generating units. The model is formulated as a mixed integer, nonlinear programming optimization problem with multiple objectives. The authors consider the nonlinearities of the generating units without simplifications or approximations. The authors develop a solution method that combines an evolutionary algorithm for the global search of the integer variables and a gradient-based local optimizer for the continuous variables. The local optimizer is embedded in the global search algorithm. Convergence is achieved by iterating between the global search and the local optimizer. The proposed methodology is applied to a moderately sized Brazilian hydroelectric plant that belongs to the national interconnected system. Additionally, a comparative study was conducted using historical operational records. The results demonstrate that the proposed methodology is feasible for online daily operations and delivers two specific benefits. The first is the efficiency gained, as the model seeks to operate the generating units as close as possible to their most efficient operating points. The second benefit is reduction of the units' maintenance costs, as the model minimizes switching on/off of the generating units. [ABSTRACT FROM AUTHOR]

This paper presents a combined simulation-optimization model for simulating reservoir operations without any detailed operation rules; it features the integration of a nonlinear, multiple-objective function and a heuristic search method, the Shuffled Complex Evolution method, developed at the University of Arizona. The model is applied to optimal water allocations from both Balan Reservoir and Seomjingang Dam in South Korea, an irrigation reservoir and a multipurpose, multioutlet reservoir, respectively, that primarily supply irrigation water. In the case of the optimal operation of Balan Reservoir, the simulation results show that the optimal release patterns are similar to those of historical operations because the demands for irrigation water are accurately predicted and guide optimal reservoir operations. In addition, the model is successfully applied to establishing a long-term reservoir operation plan. As for the optimal operation of Seomjingang Dam, the reservoir operations are affected by the target water stages, and the model provides reasonable results, irrespective of inflow conditions. Moreover, the model is employed to create a new operation rule that is necessary to adapt to changes in the circumstances related to water management. Consequently, it is concluded that the model is useful for assessing reservoirs' irrigation water supply capacities when establishing operation plans and providing feasible alternatives for new operation rules, and it could be applied to real-time reservoir operations. [ABSTRACT FROM AUTHOR]