Optimization Study of Line Planning for High Speed Railway Based on an Improved Multi-Objective Differential Evolution Algorithm

Environmental/economic power dispatch problem using multi-objective differential evolution algorithm

Simultaneous optimization of two or more objectives is an instance of multi-objective optimization (MOO). However, for most of the Multi-Objective Problems (MOPs), no single solution can optimize all the objective functions simultaneously. Evolutionary algorithms are a type of optimization algorithm used for constructing a well-distributed optimal front more quickly than a much more efficient approach. One of the most commonly used algorithms in this regard is differential evolution (DE). To solve the problem of non-dominated sorting for Multi-Objective DE (MODE), an approach is proposed that reduces the time complexity. DE is commonly recognized as one of the best methods for solving the MOPs. Several versions of DEs have been proposed for MOPs. This article proposes a novel mutation technique, named Environmental Parameter-based Multi-Objective Differential Evolution (EP-MODE) that acquires two additional environmental parameters to preserve diversity and accelerate the convergence. The proposed approach also reduces the time complexity of non-dominated sorting for Multi-Objective DE (MODE). The proposed mutation's performance has been evaluated on DTLZ series and ZDT series benchmark test functions on the Pareto-optimal front and compared with existing multi-objective algorithms (MODE and MODE-RMO). The solution comparatively verifies that the proposed EP-MODE outperforms most of the MODEs for lower dimension functions and higher functions. HIGHLIGHTS New environmental parameters-based mutation has been introduced in a differential evolution algorithm to solve multi-objective optimization problems (EP-mode) The addition of two additional environmental parameters to EP-mode has been found to be appropriate for maintaining diversity while also accelerating the convergence rate EP-MODE evaluated on bi-objective (DTLZ series) and tri-objective (ZDT series) benchmark test functions on the Pareto-optimal front and found EP-MODE's efficiency is higher than that of the MODE algorithm and the MODE algorithm with a ranking-based mutation operator GRAPHICAL ABSTRACT

Naphtha pyrolysis is one of the important routes for simultaneous production of ethylene and propylene. With recent increase in demand of both ethylene and propylene, understanding of naphtha pyrolysis becomes important for producing with increasing yield of these valuable products. Simultaneous maximization of yield of these two products is mathematically formulated as a multiobjective optimization (MOO) problem. Improved selected scheme is incorporated in the existing multiobjective differential evolution (MODE) algorithm and a new evolutionary algorithm is proposed. Both the evolutionary algorithms [i.e., MODE III and MODE-III with improved selection scheme (MODE III-ISS)] are used for MOO of industrial naphtha cracker unit. Two objectives (maximization of ethylene yield and propylene yield) and decision variables [pressure of the reactor tube (P), temperature of the reactor (T), initial flow rate of naphtha (F 0), and steam to naphtha ratio (SOR)] are considered for MOO study. MODE III and MODE III-ISS algorithms results are compared and presented, which clearly shows that the proposed MODE III-ISS algorithm possesses certain advantages over the MODE III algorithm (such as number of successful selections and percentage convergence with respect to initial number of population points, the quality of the obtained nondominated [ND] solutions).

SUMMARYA general new methodology using evolutionary algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-objective Differential Evolution (MODE), for obtaining optimal trajectory planning of an industrial robot manipulator (PUMA 560 robot) in the presence of fixed and moving obstacles with payload constraint is presented. The problem has a multi-criterion character in which six objective functions, 32 constraints and 288 variables are considered. A cubic NURBS curve is used to define the trajectory. The average fuzzy membership function method is used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find computational effort of the NSGA-II and MODE algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed. Both NSGA-II and MODE are best for this problem.

This paper presents an application of the Multiobjective Differential Evolution (MoDE) algorithm for the optimal operation of a complex multipurpose reservoir system. The developed algorithm (MoDE) is compared with the Genetic Algorithm (NSGA-II) using a set of common test problems and the case study. The case study includes part of a complex water supply system located in southwest Brazil that provides water for approximately 20 million people in the Sao Paulo metropolitan area (SPMA). 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. MoDE is applied to the case study using two inflow scenarios: (1) a drought period with inflows below historical average; and (2) a wet period with inflows above historical average. Multiobjective analysis is done by comparing two pairs of objective functions: minimization of demand shortage versus minimization of pumping cost and minimization of demand shortage versus minimization of the deviation from water quality standards. The constraints for the analysis are reservoir capacity, tunnels and channel limitations, and minimum downstream flow for all reservoirs. The proposed MoDE algorithm is outperforming NSGA-II as it converges closer to and provides better spread coverage of the true Pareto front.

MODENAR: Multi-objective differential evolution algorithm for mining numeric association rules

Mapping of time-consuming multitask applications on a cloud system by multiobjective Differential Evolution

Particle swarm optimization (PSO) and differential evolution (DE) are meta-heuristics which have been found to be successful in a wide variety of optimization tasks. The high speed of convergence and the relative simplicity of PSO make it a highly viable candidate to be used in multi-objective optimization problems (MOPs). Therefore, several PSO approaches capable to handle MOPs (MOPSOs) have appeared in the past. There are some problems, however, where PSO-based algorithms have shown a premature convergence. On the other hand, multi- objective DEs (MODE) have shown lower speed of convergence than MOPSOs but they have been successfully used in problems where MOPSO have mistakenly converged. In this work, we have developed experiments to observe the convergence behavior, the online convergence, and the diversity of solutions of both meta-heuristics in order to have a better understanding about how particles and solutions move in the search space. To this end, MOPSO and MODE algorithms under (to our best effort) similar conditions were used. Moreover, the ZDT test suite was used on all experiments since it allows to observe Pareto fronts in two-dimensional scatter plots (more details on this are presented on the experiments section). Based on the observations found, modifications to two PSO-based algorithms from the state of the art were proposed resulting in a rise on their performance. It is concluded that MOPSO presents a poor distributed scheme that leads to a more aggressive search. This aggressiveness showed to be detrimental for the selected problems. On the other hand, MODE seemed to generate better distributed points on both decision and objective space allowing it to produce better results.

Delivering ready-mixed concrete (RMC) efficiently to construction sites is a practical concern and one of the most challenging tasks for RMC batch managers. Batch plant managers must consider both time and order factors in order to set an RMC truck dispatch schedule that successfully balances batch plant (supplier) and construction site (customer) priorities. This paper develops an optimization framework that integrates discrete event simulation (DES) and multiobjective differential evolution (MODE) to determine the solutions for RMC truck dispatch scheduling. The model takes into consideration uncertainties as well as unexpected situations such as truck breakdowns during delivery. In addition, the chaotic initialized opposition multiobjective differential evolution (COMODE) algorithm is used to optimize the dispatching schedule, which minimizes the total waiting duration both of RMC trucks at construction sites and of construction sites for trucks. A batch plant case study is used to illustrate t...

This paper proposes two multi-objective trajectory planning optimization algorithms, namely, Multi-objective differential evolution (MODE) and Elitist Non-dominated sorting genetic algorithm (NSGA-II). They are applied for a differential drive wheels mobile robot (DDWMR). A cubic NURBS curve is utilized to constitute the mobile robot’s path. The objective functions considered are travel time, traveled length, and actuators efforts. All objective functions are to be minimized. The constraints considered are mobile robot’s kinematic limits, obstacle avoidance, and dynamic limits. Two stationary and five moving obstacles are present around the robot. Numerical simulation results are examined and compared.

Parameter estimation of a pressure swing adsorption model for air separation using multi-objective optimisation and support vector regression model

Due to climatic changes, the probability of occurrence and the intensity of extreme weather events increase day by day which leads to power outages. The probability of failure events is calculated using Monte Carlo simulation technique which is used to identify the most frequent failure events. The least eigenvalues of the inverse reduced Jacobian matrix decide the sensitive buses for load shedding using V-Q sensitivity analysis. This work presents the multi-objective differential evolution (MODE) algorithm for solving resilient constrained optimal power flow (RCOPF) in a deregulated power system. The control variables namely the real power of generators in a base case and under event, generator bus voltage magnitude, the real and reactive power demand of the selected load buses, tap settings and capacitor bank ratings. This algorithm is validated in IEEE 30 bus test system and the Indian 62 bus utility test system to show the effectiveness in four different cases including tie lines and distributed generation.

This paper reports a mathematical modeling and convergence analysis of a continuous multi-objective differential evolution (C-MODE) algorithm that is proposed very recently. This C-MODE is studied in the context of global random search. The convergence of the population to the Pareto optimal solutions with probability one is developed. In order to facilitate the understanding of the C-MODE operators in a continuous space, a mathematical analysis of the operators is conducted based upon a Gaussian distributed initial population. A set of guidelines is derived for the parameter setting of the C-MODE based on the theoretical results from the mathematical analysis. A simulation analysis on a specific numerical example is conducted to validate the mathematical analytical results and parameter-setting guidelines. The performance comparison based on a suite of complex benchmark functions also demonstrates the merits of such parameter-setting guidelines

Translation control of an immersed tunnel element using a multi-objective differential evolution algorithm

This paper presents a new multi-objective differential evolution algorithm (MODEMR) to solve the QoS multicast routing problem, which is a well-known NP-hard problem in mobile Ad Hoc networks. In the MODEMR, the network lifetime, cost, delay, jitter and bandwidth are considered as five objectives. Furthermore, three QoS constraints which are maximum allowed delay, maximum allowed jitter, and minimum requested bandwidth are included. In addition, we modify the crossover and mutation operators to build the shortest-path multicast tree to maximize network lifetime and bandwidth, minimize cost, delay and jitter. In order to evaluate the performance and the effectiveness of MODEMR, the experiments are conducted and compared with other algorithms for these problems. The simulation results show that our proposed method is capable of achieving faster convergence and more preferable for multicast routing in mobile Ad Hoc networks.