Algorithm for solving single-depot time-varying associated logistics transportation vehicle routing problem

Abstract

The invention discloses an algorithm for solving a single-depot time-varying associated logistics transportation vehicle routing problem. The algorithm includes that a chaos taboo search algorithm is adopted, the algorithm takes speed time-varying influence in the process of vehicle traveling into consideration, an association form is added into a target function in a manner of associating penalty cost, and a math model of the single-depot time-varying associated logistics transportation vehicle routing problem is built; on the basis of the math model, the chaos taboo search algorithm is provided to solve the problem. A taboo search algorithm is improved by utilizing advantages, of a chaos search mechanism, like globality, randomness and ergodicity. A 2-opt mode and a routing point two-point exchange mode are used in the process of neighborhood structuring. Finish criteria of specified iteration steps and optimal solution maximum unchanged times are used to finish the algorithm, so that solving quality and convergence speed of the algorithm are improved to some extent.

Description

technical field [0001] The invention belongs to the technical field of engineering, and relates to a chaotic taboo search algorithm for the time-varying associated logistics transportation vehicle path problem of a bicycle yard. Background technique [0002] Distribution is the core link of the logistics system, and it is an inevitable market behavior born with the market. With the increasingly fierce market competition and the continuous improvement of customer requirements, distribution will play a pivotal role in the future market competition. In the distribution business, the optimal scheduling of distribution vehicles involves a wide range of factors, and there are many factors to be considered. It also has a great impact on the distribution companies to improve service quality, reduce operating costs, and increase economic benefits. Scholars at home and abroad focus on the study of vehicle routing, mainly because it is the core issue of logistics distribution and trans...

AI Technical Summary

Problems solved by technology

[0003] At present, the main methods used in the research of domestic vehicle routing problems mainly have the following problems: the loading of all vehicles and goods does not consider the associated constraints between goods

Some scholars have used the sequence insertion heuristic algorithm to solve the vehicle routing problem of the single-car park, but it is difficult to apply to the time-varying associated logistics and transportation scheduling problem of the single-car park with multiple constraints

Images