Origin-Oriented Shuffled Frog Leaping Vehicle Routing Multiobjective Optimization Algorithm

Origin-Oriented Shuffled Frog Leaping Vehicle Routing Multiobjective Optimization Algorithm

Liqun Liu, Renyuan Gu, Jiuyuan Huo, Yubo Zhou
Copyright: © 2023 |Pages: 24
DOI: 10.4018/JDM.321549
Article PDF Download
Open access articles are freely available for download

Abstract

Shuffled frog leaping algorithm is a biological swarm intelligent optimization algorithm and improved into capacity-limited vehicle routing problem. However, the optimization performance is limited with improvement strategies in major of the improvement algorithm. A novel framework of algorithm is proposed to solve capacity-limited vehicle routing problem, including three modules such as origin oriented shuffled frog leaping algorithm strategy, origin oriented shuffled frog leaping vehicle routing multiobjective optimization algorithm strategy, and output module. The frog individuals gather near the origin with the maximum probability and in the area circle, with the frog leaping radius or frog-oriented radius, as the neighborhood. The negative value of the maximum entropy and the shortest total path length of the vehicle are selected as the fitness. The performance test shows that it overcomes the defect of slow convergence compared with other five algorithms. It performs well to solve vehicle routing problems.
Article Preview
Top

Introduction

The shuffled frog leaping algorithm (SFLA) originated from the biological swarm intelligent optimization algorithm. The authors of Eusuff et al. (2003) and Sun et al. (2021) showed in their previous work that it has the advantages of the frog swarm optimization strategy of cyclic sorting and grouping and the frog individual jump optimization in the Group. He et al. (2021) discuss it has been largely applied to solve numerical problems. The results in the research of Lei et al. (2021) showed SFLA has the shortcomings of relying on the inertial guidance of the original position and the limitation of step size. The capacity-limited vehicle routing problem (CVRP) is a non-deterministic polynomial problem, usually be considered as a multiobjective optimization problem. However, most of existing technology using heuristic algorithm to solve CVRP has the defects of long running time and easy to fall into premature convergence.

Scholars have improved the defects of SFLA and applied it to different fields. In the research of Wang et al. (2021), it introduced the intermediate factor and acceleration factor based on the idea of dichotomy search in mathematics. Shen et al. (2021) proposed a personalized tourism route recommendation method based on an improved hybrid leapfrog algorithm. Al-Ghussain et al. (2020) used shuffled frog leaping and pattern search to model a photovoltaic system. Cai et al. (2021) proposed a modified shuffled frog leaping algorithm with a ternary quantum. You et al. (2020) used an improved hybrid leapfrog algorithm to optimize fault diagnosis in a support vector machine.

The above research adopted different strategies to improve the performance of SFLA. However, the above methods all have defects of themselves. In this article, in the view of a local mechanism in the area with the origin as the center and the individual step size as the radius, the definitions of the frog leaping radius and frog oriented radius are defined. The frog's current position inertia and jump step in the local search are discarded so that the frog individuals gather near the origin with the maximum probability and in the area circle with the frog leaping radius or frog oriented radius as the neighborhood.

Complete Article List

Search this Journal:
Reset
Volume 35: 1 Issue (2024)
Volume 34: 3 Issues (2023)
Volume 33: 5 Issues (2022): 4 Released, 1 Forthcoming
Volume 32: 4 Issues (2021)
Volume 31: 4 Issues (2020)
Volume 30: 4 Issues (2019)
Volume 29: 4 Issues (2018)
Volume 28: 4 Issues (2017)
Volume 27: 4 Issues (2016)
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing