NSGA-II is an evolutionary multi-objective optimization algorithm that has been applied to a wide variety of search and optimization problems since its publication in 2000. This study presents a review and bibliometric analysis of numerous NSGA-II adaptations in addressing scheduling problems. This paper is divided into two parts. The first part discusses the main ideas of scheduling and different evolutionary computation methods for scheduling and provides a review of different scheduling problems, such as production and personnel scheduling. Moreover, a brief comparison of different evolutionary multi-objective optimization algorithms is provided, followed by a summary of state-of-the-art works on the application of NSGA-II in scheduling. The next part presents a detailed bibliometric analysis focusing on NSGA-II for scheduling applications obtained from the Scopus and Web of Science (WoS) databases based on keyword and network analyses that were conducted to identify the most interesting subject fields. Additionally, several criteria are recognized which may advise scholars to find key gaps in the field and develop new approaches in future works. The final sections present a summary and aims for future studies, along with conclusions and a discussion.

/pdf/scheduling-by-nsga-ii-review-and-bibliometric-analysis-1byzdtaa.pdf

Scheduling by NSGA-II: Review and Bibliometric Analysis

Dynamic reconfiguration optimization of intelligent manufacturing system with human-robot collaboration based on digital twin

Urban agglomerations (UA) are attracting increasing research attention as a global emergent phenomenon, whereby regional collaborative linkages between cities attracts and agglomerates development. However, these studies also acknowledge that ecological values may be negatively impacted by re-development, ecological fragmentation, and proximity or downstream impacts. Sustainable development, therefore, requires balancing forces from economic attraction and ecological repulsion. Forces similar to economic ones may also operate in attracting ecological enhancement towards higher-valued ecological regions; however, research regarding the role of the self-collaborative gravity-like forces shaping UA is limited in land use optimization. To assist planners, this study developed a new multi-objective land use optimization of UA that explored the intensity of economic ties and ecological gradients using the multi-objective NSGA-II algorithm. In this model, economic linkage intensity (ELI) and accessibility were used to calculate a modified GDP (gross domestic product), while the NDVI (normalized difference vegetation index) was used for the modified ESV (ecosystem services value). Spatial allocation with implicit economic accessibility relationships was enhanced through a two-step mutation operator, including a “gravity flip” spatial orientation factor. Compared to the standard NSGA-II algorithm, models of future land use of the Guangdong-Hong Kong-Macao Greater Bay Area (GBA) in 2030 have shown that the modified GDP value in our model increased by 7.41%, while the conversion rate of high-density vegetation reduced by 7.92%. The results highlighted the importance of linkage and accessibility factors in enhancing the clustering of cities. In tandem, the modified ESV also enhances ecosystem services contributions of higher value vegetated land through decentralized built-up developments. The proposed model provides managers with a comprehensive and efficient land use solution model that accounts for intrinsic linkage factors shaping the development of compact urban agglomerations.

https://www.mdpi.com/2073-445X/11/7/1003/pdf?version=1656667896

Land Use Optimization for Coastal Urban Agglomerations Based on Economic and Ecological Gravitational Linkages and Accessibility

An intelligent layout planning model for underground space surrounding metro stations based on NSGA-II

Performance prediction and multi-objective optimization of metal seals in roller cone bits

This paper provides an extensive review of the popular multi-objective optimization algorithm NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem. It is identified that based on the manner in which NSGA-II has been implemented for solving the aforementioned group of problems, there can be three categories: Conventional NSGA-II, where the authors have implemented the basic version of NSGA-II, without making any changes in the operators; the second one is Modified NSGA-II, where the researchers have implemented NSGA-II after making some changes into it and finally, Hybrid NSGA-II variants, where the researchers have hybridized the conventional and modified NSGA-II with some other technique. The article analyses the modifications in NSGA-II and also discusses the various performance assessment techniques used by the researchers, i.e., test instances, performance metrics, statistical tests, case studies, benchmarking with other state-of-the-art algorithms. Additionally, the paper also provides a brief bibliometric analysis based on the work done in this study.

/pdf/a-comprehensive-review-on-nsga-ii-for-multi-objective-4ihlcswg3c.pdf

Shanu Verma

Papers

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems