Journal of System Simulation ›› 2023, Vol. 35 ›› Issue (6): 1260-1277.doi: 10.16182/j.issn1004731x.joss.22-0132

• Papers • Previous Articles     Next Articles

Learning Variable Neighborhood Search Algorithm for Transportation-assembly Collaborative Optimization Problem

Tengfei Zhang1(), Rong Hu1(), Bin Qian1,2, Lü Yang1   

  1. 1.School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    2.School of Mechanical and Electrical Engineering, Kunming University of Science and Technology, Kunming 650500, China
  • Received:2022-02-24 Revised:2022-05-23 Online:2023-06-29 Published:2023-06-20
  • Contact: Rong Hu E-mail:869959588@qq.com;ronghu@vip.163.com

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.

Key words: collaborative optimization, coupling, assembly line balance, vehicle routing optimization, variable neighborhood search, decomposition strategy

CLC Number: