A hyper-heuristic algorithm for VRP problem and its application in highway construction
by Wen Zhong; Zhijun Xie; Mai Li; Qi Zhang; Shaomiao Chen
International Journal of Embedded Systems (IJES), Vol. 16, No. 2, 2023

Abstract: Many problems can be described as vehicle routing problems (VRPs) in engineering applications. More and more scholars have been paying attention to VRP optimisation in recent years, especially for large-scale VRPs, with the development of logistics business. In this paper, a hyper-heuristic algorithm for large-scale VRPs is proposed. It uses the diversity of strategic space to improve the diversity of algorithms. In contrast, most of the current VPR optimisation methods only pay attention to the characteristics of solution space. The proposed algorithm consists of two layers, a high-level heuristic selection strategy and a low-level heuristic policy pool. The higher-level strategy adjusts the algorithm's weight and guides the search direction dynamically based on the historical performance of the lower-level local search strategy. Simulation experiments show that, compared to the other two state-of-the-art algorithms, the proposed algorithm is more stable and performs more efficiently under most GWKC instances. Additionally, the proposed algorithm is practically applied to a material distribution problem in highway construction, and better performance is achieved.

Online publication date: Wed, 31-Jan-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com