Heterogeneous-vehicle distribution logistics planning for assembly line station materials with multiple time windows and multiple visits

Abstract

Aiming at distribution logistics planning in green manufacturing, heterogeneous-vehicle vehicle routing problems are identified for the first time with multiple time windows that meet load constraints, arrival time window constraints, material demand, etc. This problem is expressed by a mathematical model with the characteristics of the vehicle routing problem with split deliveries by order. A hybrid ant colony optimization algorithm based on tabu search is designed to solve the problem. The search time is reduced by a peripheral search strategy and an improved probability transfer rule. Parameter adaptive design is used to avoid premature convergence, and the local search is enhanced through a variety of neighborhood structures. Based on the problem that the time window cannot be violated, the time relaxation rule is designed to update the minimum wait time. The algorithm has the best performance that meets the constraints by comparing with other methods.

Quad Tournament Optimizer: A Novel Metaheuristic Based on Tournament Among Four Strategies

“…Eq. (11) states that the selected candidate replaces the current solution if this candidate is better than the current solution.…”

“…In the biomedical works, metaheuristic has been used to optimize the detection of COVID-19 severity [5], lung cancer [6], brain tumor [7], anterior cruciate ligament deficiency [8], melanoma [9], and so on. In the manufacturing and logistics, metaheuristic has been used to optimize the parallel machine scheduling [10], vehicle distribution logistics [11], pickup and delivery problem [12], inventory management and assortment planning [13], logistic distribution center [14], and so on. In transportation sector, metaheuristic has been used to optimize the maintenance scheduling of highway networks [15], forecast the traffic flow [16], and so on.…”