Longda Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Longda Wang has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Xingcheng Wang
College of Marine Electrical Engineering, Dalian Maritime University, Dalian, China
6 shared publications - Chuanfang Xu
School of Electrical Engineering, Dalian Jiaotong University, Dalian, China
5 shared publications - Gang Liu
College of Engineering, Inner Mongolia Minzu University, Tongliao 028000, China
5 shared publications - Yan Chen
School of Mechanical and Electrical Engineering, Chizhou University, Chizhou 247000, China
5 shared publications - Gang Liu
College of Engineering, Inner Mongolia Minzu University, Tongliao 028000, China
3 shared publications - Shuang Che
School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China
3 shared publications
Latest Publications
- Open Access
- 3 April 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (4) , 245
Improved Immune Moth–Flame Algorithm for Intelligent Vehicle Parking Path Optimization
Intelligent parking systems have been recognized as a core technological intervention for resolving parking garage shortages and advancing traffic safety. Nevertheless, it remains challenging to generate a smooth, accurate, and optimal parking trajectory when employing conventional intelligent path optimization algorithms. Hence, building upon a newly designed optimization model for intelligent vehicle parking path planning, this study develops an improved immune moth–flame optimization algorithm (IIMFO). Specifically, aiming at the shortest path length and smooth enough trajectory, we leverage a cubic spline interpolation-driven path planning model to resolve the complex automatic parking trajectory optimization problem. To significantly strengthen the optimization effect, we introduce immune concentration selection, nonlinear decaying adaptive inertia weight adjustments, and elite opposition-based learning mechanisms to improve the immune moth–flame algorithm. Based on the evaluation results of the test functions, as well as the simulation and semi-automatic experiments of the real-world scenario of intelligent vehicle parking path optimization, the results indicate that the improved strategy can achieve better parking trajectories.
- 3 April 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (4) , 245
Open AccessImproved Immune Moth–Flame Algorithm for Intelligent Vehicle Parking Path Optimization
Intelligent parking systems have been recognized as a core technological intervention for resolving parking garage shortages and advancing traffic safety. Nevertheless, it remains challenging to generate a smooth, accurate, and optimal parking trajectory when employing conventional intelligent path optimization algorithms. Hence, building upon a newly designed optimization model for intelligent vehicle parking path planning, this study develops an improved immune moth–flame optimization algorithm (IIMFO). Specifically, aiming at the shortest path length and smooth enough trajectory, we leverage a cubic spline interpolation-driven path planning model to resolve the complex automatic parking trajectory optimization problem. To significantly strengthen the optimization effect, we introduce immune concentration selection, nonlinear decaying adaptive inertia weight adjustments, and elite opposition-based learning mechanisms to improve the immune moth–flame algorithm. Based on the evaluation results of the test functions, as well as the simulation and semi-automatic experiments of the real-world scenario of intelligent vehicle parking path optimization, the results indicate that the improved strategy can achieve better parking trajectories.
- Open Access
- 10 January 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (1) , 60
Optimized Model Predictive Controller Using Multi-Objective Whale Optimization Algorithm for Urban Rail Train Tracking Control
With the rapid development of urban rail transit, train operation control is required to meet increasingly stringent demands in terms of energy consumption, comfort, punctuality, and precise stopping. The optimization and tracking control of speed profiles are two critical issues in ensuring the performance of automatic train operation systems. However, conventional model predictive control (MPC) methods are highly dependent on parameter settings and show limited adaptability, while heuristic optimization approaches such as the whale optimization algorithm (WOA) often suffer from premature convergence and insufficient robustness. To overcome these limitations, this study proposes an optimized model predictive controller using the multi-objective whale optimization algorithm (MPC-MOWOA) for urban rail train tracking control. In the improved optimization algorithm, a nonlinear convergence mechanism and the Tchebycheff decomposition method are introduced to enhance convergence accuracy and population diversity, which enables effective optimization of the initial parameters of the MPC. During real-time operation, the MPC is further enhanced by integrating a fuzzy satisfaction function that adaptively adjusts the softening factor. In addition, the control coefficients are corrected online according to the speed error and its rate of change, thereby improving adaptability of the control system. Taking the section from Lvshun New Port to Tieshan Town on Dalian Metro Line 12 as the study case, the proposed control algorithm was deployed on a TMS320F28335 embedded processor platform, and hardware-in-the-loop simulation experiments (HILSEs) were conducted under the same simulation environment, a unified train dynamic model, consistent operating conditions, and an identical evaluation index system. The results indicate that, compared with the Fuzzy-PID control method, the proposed control strategy reduces the integral of time-weighted absolute error nearly by 39.6% and decreases energy consumption nearly by 5.9%, while punctuality, stopping accuracy, and comfort are improved nearly by 33.2%, 12.4%, and 7.1%, respectively. These results not only verify the superior performance of the proposed MPC-MOWOA, but also demonstrate its capability for real-time implementation on embedded processors, thereby overcoming the limitations of purely MATLAB-based offline simulations and exhibiting strong potential for practical engineering applications in urban rail transit.
- 10 January 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (1) , 60
Open AccessOptimized Model Predictive Controller Using Multi-Objective Whale Optimization Algorithm for Urban Rail Train Tracking Control
With the rapid development of urban rail transit, train operation control is required to meet increasingly stringent demands in terms of energy consumption, comfort, punctuality, and precise stopping. The optimization and tracking control of speed profiles are two critical issues in ensuring the performance of automatic train operation systems. However, conventional model predictive control (MPC) methods are highly dependent on parameter settings and show limited adaptability, while heuristic optimization approaches such as the whale optimization algorithm (WOA) often suffer from premature convergence and insufficient robustness. To overcome these limitations, this study proposes an optimized model predictive controller using the multi-objective whale optimization algorithm (MPC-MOWOA) for urban rail train tracking control. In the improved optimization algorithm, a nonlinear convergence mechanism and the Tchebycheff decomposition method are introduced to enhance convergence accuracy and population diversity, which enables effective optimization of the initial parameters of the MPC. During real-time operation, the MPC is further enhanced by integrating a fuzzy satisfaction function that adaptively adjusts the softening factor. In addition, the control coefficients are corrected online according to the speed error and its rate of change, thereby improving adaptability of the control system. Taking the section from Lvshun New Port to Tieshan Town on Dalian Metro Line 12 as the study case, the proposed control algorithm was deployed on a TMS320F28335 embedded processor platform, and hardware-in-the-loop simulation experiments (HILSEs) were conducted under the same simulation environment, a unified train dynamic model, consistent operating conditions, and an identical evaluation index system. The results indicate that, compared with the Fuzzy-PID control method, the proposed control strategy reduces the integral of time-weighted absolute error nearly by 39.6% and decreases energy consumption nearly by 5.9%, while punctuality, stopping accuracy, and comfort are improved nearly by 33.2%, 12.4%, and 7.1%, respectively. These results not only verify the superior performance of the proposed MPC-MOWOA, but also demonstrate its capability for real-time implementation on embedded processors, thereby overcoming the limitations of purely MATLAB-based offline simulations and exhibiting strong potential for practical engineering applications in urban rail transit.
- Open Access
- 8 September 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (9) , 566
Improved Active Disturbance Rejection Speed Tracking Control for High-Speed Trains Based on SBWO Algorithm
To address the problems of random noise interference, inadequate disturbance estimation and compensation, and the difficulty in controller parameter tuning in speed tracking control of high-speed trains, an improved Active Disturbance Rejection Control (ADRC) strategy combined with a Sobol-based Black Widow Optimization (SBWO) algorithm is proposed. An improved Tracking Differentiator (TD) is adopted by integrating a novel optimal control synthesis function with a phase compensator to suppress input noise and ensure a smooth transition process. A novel Extended State Observer (ESO) using a nonlinear saturation function is designed to improve the observation accuracy and decrease chattering. An enhanced Nonlinear State Error Feedback (NLSEF) law that incorporates an error integral and adaptive parameter update laws is developed to reduce steady-state error and achieve self-tuned proportional and derivative gains. A feedforward compensation term is added to provide real-time dynamic compensation for ESO estimation errors. Finally, an enhanced Black Widow Optimization (BWO) algorithm, which initializes its population with Sobol sequences to improve its global search capability, is employed for parameter optimization. The simulation results demonstrate that compared with the control methods based on Proportional–Integral–Derivative (PID) control and conventional ADRC, the proposed strategy achieves higher steady-state tracking accuracy, better adaptability to dynamic operating conditions, stronger anti-disturbance ability, and more precise stopping precision.
- 8 September 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (9) , 566
Open AccessImproved Active Disturbance Rejection Speed Tracking Control for High-Speed Trains Based on SBWO Algorithm
To address the problems of random noise interference, inadequate disturbance estimation and compensation, and the difficulty in controller parameter tuning in speed tracking control of high-speed trains, an improved Active Disturbance Rejection Control (ADRC) strategy combined with a Sobol-based Black Widow Optimization (SBWO) algorithm is proposed. An improved Tracking Differentiator (TD) is adopted by integrating a novel optimal control synthesis function with a phase compensator to suppress input noise and ensure a smooth transition process. A novel Extended State Observer (ESO) using a nonlinear saturation function is designed to improve the observation accuracy and decrease chattering. An enhanced Nonlinear State Error Feedback (NLSEF) law that incorporates an error integral and adaptive parameter update laws is developed to reduce steady-state error and achieve self-tuned proportional and derivative gains. A feedforward compensation term is added to provide real-time dynamic compensation for ESO estimation errors. Finally, an enhanced Black Widow Optimization (BWO) algorithm, which initializes its population with Sobol sequences to improve its global search capability, is employed for parameter optimization. The simulation results demonstrate that compared with the control methods based on Proportional–Integral–Derivative (PID) control and conventional ADRC, the proposed strategy achieves higher steady-state tracking accuracy, better adaptability to dynamic operating conditions, stronger anti-disturbance ability, and more precise stopping precision.
- Open Access
- 4 September 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (9) , 559
Research on Dual-Loop ADRC for PMSM Based on Opposition-Based Learning Hybrid Optimization Algorithm
To enhance the speed regulation accuracy and robustness of permanent magnet synchronous motor (PMSM) drives under complex operating conditions, this paper proposes a dual-loop active disturbance rejection control strategy optimized by an opposition-based learning hybrid optimization algorithm (DLADRC-OBLHOA). First, the vector control system and ADRC model of the PMSM are established. Then, a nonlinear function, ifal, is introduced to improve the performance of the speed-loop ADRC. Meanwhile, an active disturbance rejection controller is also introduced into the current loop to suppress current disturbances. To address the challenge of tuning multiple ADRC parameters, an opposition-based learning hybrid optimization algorithm (OBLHOA) is developed. This algorithm integrates chaotic mapping for population initialization and employs opposition-based learning to enhance global search capability. The proposed OBLHOA is utilized to optimize the speed-loop ADRC parameters, thereby achieving high-precision speed control of the PMSM system. Its optimization performance is validated on 12 benchmark functions from the IEEE CEC2022 test suite, demonstrating superior convergence speed and solution accuracy compared to conventional heuristic algorithms. The proposed strategy achieves superior speed regulation accuracy and reliability under complex operating conditions when deployed on high-performance processors, but its effectiveness may diminish on resource-limited hardware. Moreover, simulation results show that the DLADRC-OBLHOA control strategy outperforms PI control, traditional ADRC, and ADRC- in terms of tracking accuracy and disturbance rejection capability.- 4 September 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (9) , 559
Open AccessResearch on Dual-Loop ADRC for PMSM Based on Opposition-Based Learning Hybrid Optimization Algorithm
To enhance the speed regulation accuracy and robustness of permanent magnet synchronous motor (PMSM) drives under complex operating conditions, this paper proposes a dual-loop active disturbance rejection control strategy optimized by an opposition-based learning hybrid optimization algorithm (DLADRC-OBLHOA). First, the vector control system and ADRC model of the PMSM are established. Then, a nonlinear function, ifal, is introduced to improve the performance of the speed-loop ADRC. Meanwhile, an active disturbance rejection controller is also introduced into the current loop to suppress current disturbances. To address the challenge of tuning multiple ADRC parameters, an opposition-based learning hybrid optimization algorithm (OBLHOA) is developed. This algorithm integrates chaotic mapping for population initialization and employs opposition-based learning to enhance global search capability. The proposed OBLHOA is utilized to optimize the speed-loop ADRC parameters, thereby achieving high-precision speed control of the PMSM system. Its optimization performance is validated on 12 benchmark functions from the IEEE CEC2022 test suite, demonstrating superior convergence speed and solution accuracy compared to conventional heuristic algorithms. The proposed strategy achieves superior speed regulation accuracy and reliability under complex operating conditions when deployed on high-performance processors, but its effectiveness may diminish on resource-limited hardware. Moreover, simulation results show that the DLADRC-OBLHOA control strategy outperforms PI control, traditional ADRC, and ADRC- in terms of tracking accuracy and disturbance rejection capability. - Open Access
- 9 June 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (6)
An Improved Whale Optimization Algorithm via Angle Penalized Distance for Automatic Train Operation
This study proposes a novel effective improved whale optimization algorithm via angle penalized distance (IWOA-APD) for automatic train operation (ATO) to effectively improve the ATO quality. Specifically, aiming at the high-quality target speed curve of urban rail trains, a target speed curve multi-objective optimization model for ATO is established with energy saving, punctuality, accurate stopping, and comfort as the indexes; and the comprehensive evaluation strategy utilizing angle-penalized distance as the evaluation index is proposed to enhance the assessment’s rationality and applicability. On this basis, the IWOA-APD is proposed using strategies of non-linear decreasing convergence factor, solutions of out-of-bounds eliminating via combination of reflection and refraction, mechanisms of genetic evolution with variable probability, and elite maintenance based on fusion distance and crowding degree distance. In addition, the detailed design scheme of IWOA-APD is given. The test results show that the proposed IWOA-APD achieves significant performance improvements compared to traditional MOWOA. In the optimization scenario from Lvshun New Port Station to Tieshan Town Station of Dalian urban rail transit line No.12, the IGD value shows a remarkable 69.1% reduction, while energy consumption decreases by 12.5%. The system achieves a 64.6% improvement in punctuality and a 76.5% enhancement in parking accuracy. Additionally, comfort level improves by 15.9%.
- 9 June 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (6)
Open AccessAn Improved Whale Optimization Algorithm via Angle Penalized Distance for Automatic Train Operation
This study proposes a novel effective improved whale optimization algorithm via angle penalized distance (IWOA-APD) for automatic train operation (ATO) to effectively improve the ATO quality. Specifically, aiming at the high-quality target speed curve of urban rail trains, a target speed curve multi-objective optimization model for ATO is established with energy saving, punctuality, accurate stopping, and comfort as the indexes; and the comprehensive evaluation strategy utilizing angle-penalized distance as the evaluation index is proposed to enhance the assessment’s rationality and applicability. On this basis, the IWOA-APD is proposed using strategies of non-linear decreasing convergence factor, solutions of out-of-bounds eliminating via combination of reflection and refraction, mechanisms of genetic evolution with variable probability, and elite maintenance based on fusion distance and crowding degree distance. In addition, the detailed design scheme of IWOA-APD is given. The test results show that the proposed IWOA-APD achieves significant performance improvements compared to traditional MOWOA. In the optimization scenario from Lvshun New Port Station to Tieshan Town Station of Dalian urban rail transit line No.12, the IGD value shows a remarkable 69.1% reduction, while energy consumption decreases by 12.5%. The system achieves a 64.6% improvement in punctuality and a 76.5% enhancement in parking accuracy. Additionally, comfort level improves by 15.9%.
- Open Access
- 22 May 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (6) , 299
Improved Directional Mutation Moth–Flame Optimization Algorithm via Gene Modification for Automatic Reverse Parking Trajectory Optimization
Automatic reverse parking (ARP) faces challenges in finding ideal reference trajectories that avoid collisions, maintain smoothness, and minimize path length. To address this, we propose an improved directional mutation moth–flame optimization algorithm with gene modification (IDMMFO-GM). We develop a practical reference trajectory optimization model by combining cubic spline interpolation with a standardized parking plane coordinate system. To effectively address the infeasible solutions encountered when parking in a garage, we apply gene modification for collision avoidance and berthing tilt generated from the reference trajectory optimization to enhance the preservation of optimization information. Furthermore, we introduce a non-linear decreasing weight coefficient and a directional mutation strategy into the moth–flame optimization algorithm to significantly improve its overall optimization performance. Taking the automatic parking garage space No. 155 in Dalian Shell Museum as the actual vehicle test object, which is situated within Dalian Xinghai Square, test results demonstrate that the proposed algorithm achieves an accelerated optimization speed, enhanced precision in trajectory optimization, and superior tracking control performance.
- 22 May 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (6) , 299
Open AccessImproved Directional Mutation Moth–Flame Optimization Algorithm via Gene Modification for Automatic Reverse Parking Trajectory Optimization
Automatic reverse parking (ARP) faces challenges in finding ideal reference trajectories that avoid collisions, maintain smoothness, and minimize path length. To address this, we propose an improved directional mutation moth–flame optimization algorithm with gene modification (IDMMFO-GM). We develop a practical reference trajectory optimization model by combining cubic spline interpolation with a standardized parking plane coordinate system. To effectively address the infeasible solutions encountered when parking in a garage, we apply gene modification for collision avoidance and berthing tilt generated from the reference trajectory optimization to enhance the preservation of optimization information. Furthermore, we introduce a non-linear decreasing weight coefficient and a directional mutation strategy into the moth–flame optimization algorithm to significantly improve its overall optimization performance. Taking the automatic parking garage space No. 155 in Dalian Shell Museum as the actual vehicle test object, which is situated within Dalian Xinghai Square, test results demonstrate that the proposed algorithm achieves an accelerated optimization speed, enhanced precision in trajectory optimization, and superior tracking control performance.
- 16 April 2025
- Published by Elsevier in Neurocomputing
- Vol. 639
An improved predictive function control algorithm via wavelet neural network for urban rail train tracking control
- 16 April 2025
- Published by Elsevier in Neurocomputing
- Vol. 639
An improved predictive function control algorithm via wavelet neural network for urban rail train tracking control
- Open Access
- 11 July 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (7) , 308
Automatic Vertical Parking Reference Trajectory Based on Improved Immune Shark Smell Optimization
Parking path optimization is the principal problem of automatic vertical parking (AVP); however, it is difficult to determine a collision avoiding, smooth, and accurate optimized parking path using traditional parking reference trajectory optimization methods. In order to implement high-performance automatic parking reference trajectory optimization, we establish an automatic parking reference trajectory optimization model using cubic spline interpolation, and we propose an improved immune shark smell optimization (IISSO) to solve it. Firstly, we take the length of the parking reference trajectory as the optimization objective, and we introduce an intelligent automatic parking path optimization model using cubic spline interpolation. Secondly, the improved immune shark optimization algorithm combines the immune, refraction, and Gaussian variation mechanisms, thus effectively improving its global optimization ability. The simulation results for the parking path optimization experiments indicate that the proposed IISSO has a higher optimization accuracy and faster calculation speed; hence, it can obtain a parking path with higher optimization performance.
- 11 July 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (7) , 308
Open AccessAutomatic Vertical Parking Reference Trajectory Based on Improved Immune Shark Smell Optimization
Parking path optimization is the principal problem of automatic vertical parking (AVP); however, it is difficult to determine a collision avoiding, smooth, and accurate optimized parking path using traditional parking reference trajectory optimization methods. In order to implement high-performance automatic parking reference trajectory optimization, we establish an automatic parking reference trajectory optimization model using cubic spline interpolation, and we propose an improved immune shark smell optimization (IISSO) to solve it. Firstly, we take the length of the parking reference trajectory as the optimization objective, and we introduce an intelligent automatic parking path optimization model using cubic spline interpolation. Secondly, the improved immune shark optimization algorithm combines the immune, refraction, and Gaussian variation mechanisms, thus effectively improving its global optimization ability. The simulation results for the parking path optimization experiments indicate that the proposed IISSO has a higher optimization accuracy and faster calculation speed; hence, it can obtain a parking path with higher optimization performance.
- Open Access
Improved Immune Moth–Flame Optimization Based on Gene Correction for Automatic Reverse Parking
During the process of reverse parking, it is difficult to achieve the ideal reference trajectory while avoiding collision. In this study, with the aim of establishing reference trajectory optimization for automatic reverse parking that smooths and shortens the trajectory length and ensures the berthing inclination angle is small enough, an improved immune moth–flame optimization method based on gene correction is proposed. Specifically, based on the standard automatic parking plane system, a reasonable high-quality reference trajectory optimization model for automatic parking is constructed by combining the cubic spline-fitting method and a boundary-crossing solution based on gene correction integrated into moth–flame optimization. To enhance the model’s global optimization performance, nonlinear decline strategies, including crossover and variation probability and weight coefficient, and a high-quality solution-set maintenance mechanism based on fusion distance are also designed. Taking garage No.160 of the Dalian Shell Museum located in Dalian, Xinghai Square, as the experimental site, experiments on automatic parking reference trajectory optimization and tracking control were carried out. The results show that the proposed optimization algorithm provides higher accuracy for reference trajectory optimization and can achieve better tracking control of the reference trajectory.
Open AccessImproved Immune Moth–Flame Optimization Based on Gene Correction for Automatic Reverse Parking
During the process of reverse parking, it is difficult to achieve the ideal reference trajectory while avoiding collision. In this study, with the aim of establishing reference trajectory optimization for automatic reverse parking that smooths and shortens the trajectory length and ensures the berthing inclination angle is small enough, an improved immune moth–flame optimization method based on gene correction is proposed. Specifically, based on the standard automatic parking plane system, a reasonable high-quality reference trajectory optimization model for automatic parking is constructed by combining the cubic spline-fitting method and a boundary-crossing solution based on gene correction integrated into moth–flame optimization. To enhance the model’s global optimization performance, nonlinear decline strategies, including crossover and variation probability and weight coefficient, and a high-quality solution-set maintenance mechanism based on fusion distance are also designed. Taking garage No.160 of the Dalian Shell Museum located in Dalian, Xinghai Square, as the experimental site, experiments on automatic parking reference trajectory optimization and tracking control were carried out. The results show that the proposed optimization algorithm provides higher accuracy for reference trajectory optimization and can achieve better tracking control of the reference trajectory.
- Open Access
- 6 March 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (3) , 110
Electric Vehicle Ordered Charging Planning Based on Improved Dual-Population Genetic Moth–Flame Optimization
This work discusses the electric vehicle (EV) ordered charging planning (OCP) optimization problem. To address this issue, an improved dual-population genetic moth–flame optimization (IDPGMFO) is proposed. Specifically, to obtain an appreciative solution of EV OCP, the design for a dual-population genetic mechanism integrated into moth–flame optimization is provided. To enhance the global optimization performance, the adaptive nonlinear decreasing strategies with selection, crossover and mutation probability, as well as the weight coefficient, are also designed. Additionally, opposition-based learning (OBL) is also introduced simultaneously. The simulation results show that the proposed improvement strategies can effectively improve the global optimization performance. Obviously, more ideal optimization solution of the EV OCP optimization problem can be obtained by using IDPGMFO.
- 6 March 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (3) , 110
Open AccessElectric Vehicle Ordered Charging Planning Based on Improved Dual-Population Genetic Moth–Flame Optimization
This work discusses the electric vehicle (EV) ordered charging planning (OCP) optimization problem. To address this issue, an improved dual-population genetic moth–flame optimization (IDPGMFO) is proposed. Specifically, to obtain an appreciative solution of EV OCP, the design for a dual-population genetic mechanism integrated into moth–flame optimization is provided. To enhance the global optimization performance, the adaptive nonlinear decreasing strategies with selection, crossover and mutation probability, as well as the weight coefficient, are also designed. Additionally, opposition-based learning (OBL) is also introduced simultaneously. The simulation results show that the proposed improvement strategies can effectively improve the global optimization performance. Obviously, more ideal optimization solution of the EV OCP optimization problem can be obtained by using IDPGMFO.