Harmony Search Method with Global Sharing Factor Based on Natural Number Coding for Vehicle Routing Problem

Abstract

This paper proposes an improved Harmony Search algorithm, and gives the definition of the Global Sharing Factor of the Harmony Search (HS) algorithm. In the definition, the number of creations of the HS algorithm is applied to the sharing factor and calculated. In this algorithm, the natural harmony encoding method is used to encode the initial harmony, and the total path length of all vehicles is taken as the optimization objective function. A new harmony generation strategy is proposed as follows: each tone component in an evolution is calculated separately using the new learning strategy and update strategy. In the calculation process, the tone component is judged by whether it needs to be adjusted according to the adjustment strategy. In this way, the problems of singularity and randomness of the new harmony generation strategy of basic HS are solved to improve the diversity of algorithm solutions. Then, a new Harmony Search method with Global Sharing Factor based on natural number coding and decoding for the Vehicle Routing Problem (GSF-HS-VRP) is proposed. The improved Global Sharing Factor-Harmony Search-Vehicle Routing Problem (GSF-HS-VRP) algorithm is applied to capacity-limited vehicle path optimization problems compared with the HS, Improved Harmony Search (IHS), Global-best Harmony Search (GHS), and Self-adaptive Global Best Harmony Search (SGHS) algorithms. The small-scale data and Solomon examples were adopted as the experimental data. Compared with the other four algorithms, the GSF-HS-VRP algorithm has the shortest running time, more rapid convergence speed, and higher efficiency. In the multi-vehicle test, with the increase of the number of vehicles, the optimized path of the vehicle is more satisfied in relation to the actual needs of customers. The results showed that this method could effectively improve the optimization performance of the capacity-limited vehicle routing problem.

Towards Dynamic Fuzzy Rule Interpolation with Harmony Search

“…The computational complexity of HS-FRI can be divided into two core parts, O HS−F RI = O HS +O P romotion . From [31], the time complexity of harmony search algorithm can be derived as O HS (T max × D BS ), where T max is the total number of improvisations and D BS is the dimension of the best harmony vector…”

Multi-Circle Detection Guided by Multimodal Optimization Scheme

“…The computational complexity of the DE variant in the experimental study; DE/rand/1/bin is computed as O(n • d • K) [38]. Also, the computational complexity of the HS algorithm is O(n • d • K) [39]. As it can be shown, either the algorithmic structures of DE and HS are not complex, which makes efficient alternatives to implement to solve multiple optimization problems.…”

Trajectory Planning for Coal Gangue Sorting Robot Tracking Fast-Mass Target under Multiple Constraints

“…However, it is difficult to constrain the speed and acceleration of the manipulator in the planning, which often leads to the over-limit problem of the manipulator's joints in pursuit of time optimization. For such problems, trajectory planning models need to be built, and then relevant constraints are added in combination with actual problems, and optimization algorithms are used to solve them, such as MOABC [12], MOHS [13], PSO [14], MOSFLA [15], PHD [16], etc.…”