Abstract

This study presents an improved version of the Driving Training-Based Optimization (DTBO) algorithm, the Improved Driving Training-Based Optimization (IDTBO). The work addresses fundamental issues in selecting drivers and learners for the conventional DTBO, which substantially impact the algorithm's accuracy and convergence speed. Two significant improvements are proposed: including the crowding distance technique for more diverse driver and learner selection and incorporating the Levy Flight distribution for better exploration and local optima avoidance. The IDTBO's performance is evaluated using twelve benchmark functions, including unimodal and high-dimensional multimodal optimization functions. The results indicate that IDTBO performs exceptionally well, with more extraordinary exploitation ability on unimodal functions and consistent achievement of the global optima. The proposed IDTBO demonstrated exceptional exploration capabilities on high-dimensional multimodal functions and performed competitively with other algorithms in the literature. From six functions, the IDTBO obtained zero optimal values. Again, the rate of convergence analysis demonstrates that IDTBO finds optimal solutions in fewer iterations, demonstrating its capacity to balance exploration and exploitation. To assess the strength of the IDTBO in solving real-world problems, the improved DTBO is further tested on two practical benchmark engineering problems. The IDTBO again produced a competitive performance against other algorithms in the literature. The study shows that IDTBO is a valuable metaheuristic algorithm that can tackle various real-world optimization problems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.