Rotation and translation selective Pareto optimal solution to the box-pushing problem by mobile robots using NSGA-II

2009 ◽  
Author(s):  
Jayasree Chakraborty ◽  
Amit Konar ◽  
Atulya Nagar ◽  
Swagatam Das
Keyword(s):  
Mobile Robots ◽  
Optimal Solution ◽  
Pareto Optimal Solution ◽  
Pareto Optimal ◽  
Nsga Ii

Simulation Optimization of Multi-Objective Flexible Job Shop Scheduling

2013 ◽  
Vol 365-366 ◽  
pp. 602-605
Author(s):  
Gui Cong Wang ◽  
Chuan Peng Li ◽  
Huan Yong Cui
Keyword(s):  
Simulation Model ◽  
Job Shop ◽  
Simulation Optimization ◽  
Optimal Solution ◽  
Pareto Optimal Solution ◽  
Pareto Optimal ◽  
Flexible Job Shop ◽  
Final Solution ◽  
Nsga Ii ◽  
Multi Objective

Current scheduling approach for multiple objective flexible job shop problem (FJSP) cannot construct a precise scheduling model and obtain a satisfactory scheduling result at the same time. To deal with this problem, a simulation optimization scheduling approach was presented which was composed of two basic modules: the Fast non-dominated Sorting Genetic Algorithm (NSGA-II) module and Witness simulation module. Firstly, a multi-objective mathematical model was found for FJSP and NSGA-II was applied to solve. Then, a set of Pareto optimal solution was obtained by NSGA-II module. In order to select the final solution from the Pareto optimal solution for FJSP, the simulation model was set up by Witness, every Pareto solution was as input for simulation model. Finally, the final solution can be selected according other performance indicators.

Hybrid Multi-objective Optimization Approach in Water Flooding

2021 ◽  
pp. 1-22
Author(s):  
Mohammed Al-Aghbari ◽  
Ashish M. Gujarathi ◽  
Majid Al-Wadhahi ◽  
Nirupam Chakraborti
Keyword(s):  
Neural Network ◽  
Water Injection ◽  
Optimal Solution ◽  
Pareto Optimal Solution ◽  
Data Driven ◽  
Water Flooding ◽  
Real Field ◽  
Pareto Optimal ◽  
Nsga Ii ◽  
Evolutionary Neural Network

Abstract Non-dominated Sorting Genetic Algorithm, second version (NSGA-II) is used as a stochastic optimization technique successfully in different engineering applications. In this study, a data-driven optimization strategy based upon evolutionary neural network algorithm (EvoNN) is developed for providing input into NSGA-II optimization. Evolutionary neural-network data-driven model is built and trained using initial solutions generated by NSGA-II optimization coupled with the reservoir simulation model. Evolutionary optimization incorporated in the EvoNN strategy is applied in the trained data-driven model to generate the Pareto optimal solution, which is then used as a guiding input into NSGA-II optimization. The described method is applied in two case studies (i.e. Brugge field model & water injection pattern model). The Pareto optimal solutions obtained with data-driven model guided NSGA-II in both models show improvement in convergence and diversity of the solution. The convergence to the Pareto optimal solution has improved by 9% for case-1 (i.e. Brugge field) and by 43% for case-2 (i.e. water injection pattern model). In addition, the Pareto optimal solution obtained by the proposed hybridization has shown improvement in the water oil ratio (WOR) up to 6% in the Brugge field and up to 97% in the water injection pattern model. This improvement can lead to wide applications in using evolutionary optimizations in real field simulation models at acceptable computation time.

Multi-Objective Optimization Algorithm Design and Implementation of Mobile Base Station Site Selection

2010 ◽  
Vol 29-32 ◽  
pp. 2496-2502
Author(s):  
Min Wang ◽  
Jun Tang
Keyword(s):  
Site Selection ◽  
Engineering Application ◽  
Optimal Solution ◽  
Base Station ◽  
Pareto Optimal Solution ◽  
Antibody Concentration ◽  
Pareto Optimal ◽  
Memory Cells ◽  
Multi Objective Optimization ◽  
Multi Objective

The number of base station location impact the network quality of service. A new method is proposed based on immune genetic algorithm for site selection. The mathematical model of multi-objective optimization problem for base station selection and the realization of the process were given. The use of antibody concentration selection ensures the diversity of the antibody and avoiding the premature convergence, and the use of memory cells to store Pareto optimal solution of each generation. A exclusion algorithm of neighboring memory cells on the updating and deleting to ensure that the Pareto optimal solution set of the distribution. The experiments results show that the algorithm can effectively find a number of possible base station and provide a solution for the practical engineering application.

Sign in / Sign up

Export Citation Format

Share Document