Compact Sine Cosine Algorithm applied in vehicle routing problem with time window

• Published in: Telecommunication systems Vol. 78; no. 4; pp. 609 - 628
• Main Authors: Pan, Jeng-Shyang, Yang, Qing-yong, Chu, Shu-Chuan, Chang, Kuo-Chi
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.12.2021; Springer Nature B.V
• Subjects: Algorithms; Artificial Intelligence; Business and Management; Computer Communication Networks; IT in Business; Probability Theory and Stochastic Processes; Route planning; Sampling; Telecommunications systems; Trigonometric functions; Vehicle routing; Windows (intervals); Intergeneration sampling; Sine Cosine Algorithm; Compact optimization; VRPTW
• ISSN: 1018-4864; 1572-9451
• DOI: 10.1007/s11235-021-00833-7

In this paper, the compact Sine Cosine Algorithm (cSCA) is proposed. The cSCA algorithm is not based on population, but simulates the behavior of the actual population through a probability model called virtual population. Compared with the original algorithm, the cSCA algorithm takes up less memory space. However, frequent sampling may lead to poor solution quality. In view of this situation, this paper introduces the intergenerational generation sampling mechanism to improve the cSCA algorithm. Through the CEC2013 function set test, compared with the original SCA algorithm and other compact algorithms, the algorithm proposed in this paper can show strong solving ability. Finally, this paper describes how to apply the proposed algorithm and the SCA algorithm to solve the vehicle routing problem with time window in transportation. The quality of the solution is further improved by introducing the relocate operator. Through Solomon standard test data, the calculation performance of the algorithms is verified.