Manuel J. C. S. Reis^*

CMC-Computers, Materials & Continua, Vol.85, No.2, pp. 3023-3039, 2025, DOI:10.32604/cmc.2025.066390 - 23 September 2025

Abstract The Vehicle Routing Problem with Time Windows (VRPTW) presents a significant challenge in combinatorial optimization, especially under real-world uncertainties such as variable travel times, service durations, and dynamic customer demands. These uncertainties make traditional deterministic models inadequate, often leading to suboptimal or infeasible solutions. To address these challenges, this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms (GA) with Local Search (LS), while incorporating stochastic uncertainty modeling through probabilistic travel times. The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance. This adaptivity enhances the algorithm’s… More >

Qinhui Liu, Zhijie Gao, Jiang Li^*, Shuo Li, Laizheng Zhu

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2503-2530, 2023, DOI:10.32604/cmc.2023.040505 - 30 August 2023

Abstract With the rapid development of intelligent manufacturing and the changes in market demand, the current manufacturing industry presents the characteristics of multi-varieties, small batches, customization, and a short production cycle, with the whole production process having certain flexibility. In this paper, a mathematical model is established with the minimum production cycle as the optimization objective for the dual-resource batch scheduling of the flexible job shop, and an improved nested optimization algorithm is designed to solve the problem. The outer layer batch optimization problem is solved by the improved simulated annealing algorithm. The inner double resource More >

Tsung-Yin Ou¹, Chen-Yang Cheng², Chun Hsiung Lai³, Hsin-Pin Fu^1,*

Computer Systems Science and Engineering, Vol.40, No.3, pp. 895-911, 2022, DOI:10.32604/csse.2022.018432 - 24 September 2021

Abstract This paper proposes a solution to the open vehicle routing problem with time windows (OVRPTW) considering third-party logistics (3PL). For the typical OVRPTW problem, most researchers consider time windows, capacity, routing limitations, vehicle destination, etc. Most researchers who previously investigated this problem assumed the vehicle would not return to the depot, but did not consider its final destination. However, by considering 3PL in the B2B e-commerce, the vehicle is required back to the nearest 3PL location with available space. This paper formulates the problem as a mixed integer linear programming (MILP) model with the objective More >

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 - 30 June 2020

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… More >