•  
  •  
 

Journal of System Simulation

Abstract

Aiming at transportation-assembly collaborative optimization problems,an integer programming model is established, and a learning variable neighborhood search with decomposition strategy (LVNS_DS) is proposed. To reduce the difficulty of solving the problem, a decomposition strategy is designed to decompose the original problem into a path planning problem and an assembly line balance problem. LVNS is used to solve the two subproblems, and the subproblem solutions are merged to obtain the complete solution of the original problem.Compared with the conventional VNS, LVNS transforms the neighborhood structure according to the neighborhood action probability value, and dynamically updates the probability value according to the contribution of neighborhood action. Therefore, LVNS algorithm can select the neighborhood action suitable for the current search stage with high probability value to easily find the high-quality solution of the subproblem. Through the simulation experiments of different scale examples, the importance of transportation assembly collaborative optimization and the effectiveness of LVNS_DS are verified.

First Page

1260

Revised Date

2022-05-23

Last Page

1277

CLC

TP391.9

Recommended Citation

Tengfei Zhang, Rong Hu, Bin Qian, Lü Yang. Learning Variable Neighborhood Search Algorithm for Transportation-assembly Collaborative Optimization Problem[J]. Journal of System Simulation, 2023, 35(6): 1260-1277.

DOI

10.16182/j.issn1004731x.joss.22-0132

Share

COinS