Jinhui Ge¹, Xiaoliang Liu^{2, *}, Guo Liang³

CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1945-1958, 2020, DOI:10.32604/cmc.2020.010977

Abstract With the expansion of the application scope of social computing problems, many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes, cultures, and the emotional needs of customers. The actual soft time window vehicle routing problem, speeding up the response of customer needs, improving distribution efficiency, and reducing operating costs is the focus of current social computing problems. Therefore, designing fast and effective algorithms to solve this problem has certain theoretical and practical significance. In this paper, considering the time delay problem of customer demand, the… More >

Tao Wu¹, Lei Xie¹, Xi Chen², Amir Homayoon Ashrafzadeh³, Shu Zhang^{4, *}

CMC-Computers, Materials & Continua, Vol.63, No.2, pp. 873-890, 2020, DOI:10.32604/cmc.2020.07478

Abstract The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs. Quantum-behaved Particle Swarm Optimization (QPSO) algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling. This paper analyzed the motion pattern of particles in a square potential well, given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well (BCQSPSO). In this novel algorithm, the intrinsic cognitive link between particles’ experience information and group sharing information was created by using normal Copula function. After… More >