z-logo
open-access-imgOpen Access
Learning Whale Optimization Algorithm for Open Vehicle Routing Problem with Loading Constraints
Author(s) -
Nai K. Yu,
Wen Jiang,
Rong Hu,
Bin Qian,
Ling Wang
Publication year - 2021
Publication title -
discrete dynamics in nature and society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 39
eISSN - 1607-887X
pISSN - 1026-0226
DOI - 10.1155/2021/8016356
Subject(s) - computer science , vehicle routing problem , skyline , mathematical optimization , block (permutation group theory) , algorithm , whale , quality (philosophy) , routing (electronic design automation) , population , mathematics , data mining , computer network , philosophy , geometry , demography , epistemology , fishery , biology , sociology
This paper addresses the two-dimensional loading open vehicle routing problem with time window (2L-OVRPTW). We propose a learning whale optimization algorithm (LWOA) to minimize the total distance; an improved skyline filling algorithm (ISFA) is designed to solve the two-dimensional loading problem. In LWOA, the whale optimization algorithm is used to search the solution space and get the high-quality solution. Then, by learning and accumulating the block structure and customer location information in the high-quality solution individuals, a three-dimensional matrix is designed to guide the updating of the population. Finally, according to the problem characteristics, the local search method based on fleet and vehicle is designed and performed on the high-quality solution region. IFSA is used to optimize the optimal individual. The computational results show that the proposed algorithm can effectively solve 2L-OVRPTW.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom