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 >

He Huang, Jin Zhu^*

CMES-Computer Modeling in Engineering & Sciences, Vol.144, No.2, pp. 1717-1748, 2025, DOI:10.32604/cmes.2025.068384 - 31 August 2025

Abstract Automated guided vehicles (AGVs) are key equipment in automated container terminals (ACTs), and their operational efficiency can be impacted by conflicts and battery swapping. Additionally, AGVs have bidirectional transportation capabilities, allowing them to move in the opposite direction without turning around, which helps reduce transportation time. This paper aims at the problem of AGV scheduling and bidirectional conflict-free routing with battery swapping in automated terminals. A bi-level mixed integer programming (MIP) model is proposed, taking into account task assignment, bidirectional conflict-free routing, and battery swapping. The upper model focuses on container task assignment and AGV… More >

Thi My Binh Nguyen^#, Thi Hoa Hue Nguyen^#, Thi Ngoc Huyen Do^*

CMC-Computers, Materials & Continua, Vol.84, No.3, pp. 5063-5076, 2025, DOI:10.32604/cmc.2025.064610 - 30 July 2025

Abstract Efficient warehouse management is critical for modern supply chain systems, particularly in the era of e-commerce and automation. The Multi-Picker Robot Routing Problem (MPRRP) presents a complex challenge involving the optimization of routes for multiple robots assigned to retrieve items from distinct locations within a warehouse. This study introduces optimized metaheuristic strategies to address MPRRP, with the aim of minimizing travel distances, energy consumption, and order fulfillment time while ensuring operational efficiency. Advanced algorithms, including an enhanced Particle Swarm Optimization (PSO-MPRRP) and a tailored Genetic Algorithm (GA-MPRRP), are specifically designed with customized evolutionary operators to More >

Eric Bourreau¹, Gérard Fleury², Philippe Lacomme^2,*

Journal of Quantum Computing, Vol.6, pp. 25-51, 2024, DOI:10.32604/jqc.2024.048792 - 25 October 2024

Abstract The paper presents a novel quantum method for addressing two fundamental routing problems: the Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP), both central to routing challenges. The proposed method, named the Indirect Quantum Approximate Optimization Algorithm (IQAOA), leverages an indirect solution representation using ranking. Our contribution focuses on two main areas: 1) the indirect representation of solutions, and 2) the integration of this representation into an extended version of QAOA, called IQAOA. This approach offers an alternative to QAOA and includes the following components: 1) a quantum parameterized circuit designed to simulate… More >

Y. M. Mahaboob John^1,*, G. Ravi²

Computer Systems Science and Engineering, Vol.46, No.3, pp. 3653-3666, 2023, DOI:10.32604/csse.2023.036916 - 03 April 2023

Abstract Mobile Ad-hoc Network (MANET) routing problems are thoroughly studied several approaches are identified in support of MANET. Improve the Quality of Service (QoS) performance of MANET is achieving higher performance. To reduce this drawback, this paper proposes a new secure routing algorithm based on real-time partial ME (Mobility, energy) approximation. The routing method RRME (Real-time Regional Mobility Energy) divides the whole network into several parts, and each node’s various characteristics like mobility and energy are randomly selected neighbors accordingly. It is done in the path discovery phase, estimated to identify and remove malicious nodes. In… More >

R. Shanthakumari¹, Yun-Cheol Nam², Yunyoung Nam^3,*, Mohamed Abouhawwash^4,5

Intelligent Automation & Soft Computing, Vol.36, No.2, pp. 1991-2005, 2023, DOI:10.32604/iasc.2023.033696 - 05 January 2023

Abstract Smart cities make use of a variety of smart technology to improve societies in better ways. Such intelligent technologies, on the other hand, pose significant concerns in terms of power usage and emission of carbons. The suggested study is focused on technological networks for big data-driven systems. With the support of software-defined technologies, a transportation-aided multicast routing system is suggested. By using public transportation as another communication platform in a smart city, network communication is enhanced. The primary objective is to use as little energy as possible while delivering as much data as possible. The… More >

Zakir Hussain Ahmed^1,*, Naif Al-Otaibi¹, Abdullah Al-Tameem², Abdul Khader Jilani Saudagar²

CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1575-1605, 2023, DOI:10.32604/cmc.2023.031325 - 22 September 2022

Abstract We study the capacitated vehicle routing problem (CVRP) which is a well-known NP-hard combinatorial optimization problem (COP). The aim of the problem is to serve different customers by a convoy of vehicles starting from a depot so that sum of the routing costs under their capacity constraints is minimized. Since the problem is very complicated, solving the problem using exact methods is almost impossible. So, one has to go for the heuristic/metaheuristic methods and genetic algorithm (GA) is broadly applied metaheuristic method to obtain near optimal solution to such COPs. So, this paper studies GAs… More >

Mariem Belhor^1,2,3, Adnen El-Amraoui^1,*, Abderrazak Jemai², François Delmotte¹

Computer Systems Science and Engineering, Vol.45, No.1, pp. 1-19, 2023, DOI:10.32604/csse.2023.029058 - 16 August 2022

Abstract This research focuses on the home health care optimization problem that involves staff routing and scheduling problems. The considered problem is an extension of multiple travelling salesman problem. It consists of finding the shortest path for a set of caregivers visiting a set of patients at their homes in order to perform various tasks during a given horizon. Thus, a mixed-integer linear programming model is proposed to minimize the overall service time performed by all caregivers while respecting the workload balancing constraint. Nevertheless, when the time horizon become large, practical-sized instances become very difficult to More >

Daqing Wu^1,2, Jiye Cui^1,*, Dan Li³, Romany Fouad Mansour⁴

Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1553-1569, 2022, DOI:10.32604/iasc.2022.028780 - 25 May 2022

Abstract Under the fierce market competition and the demand of low-carbon economy, the freshness of fresh products directly determines the degree of customer satisfaction. Cold chain logistics companies must pay attention to the freshness and carbon emissions of fresh products to obtain better service development. In the cold chain logistics path optimization problem, considering the cost, product freshness and carbon emission environmental factors at the same time, based on the cost-benefit idea, a comprehensive cold chain vehicle routing problem optimization model is proposed to minimize the unit cost of product freshness and the carbon trading mechanism… More >

Daqing Wu^1,2, Ziwei Zhu¹, Dong Hu^3,*, Romany Fouad Mansour⁴

CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 2079-2095, 2022, DOI:10.32604/cmc.2022.027794 - 18 May 2022

Abstract With the rapid development of the fresh cold chain logistics distribution and the prevalence of low carbon concept, this paper proposed an optimization model of low carbon fresh cold chain logistics distribution route considering customer satisfaction, and combined with time, space, weight, distribution rules and other constraints to optimize the distribution model. At the same time, transportation cost, penalty cost, overloading cost, carbon tax cost and customer satisfaction were considered as the components of the objective function, and the thought of cost efficiency was taken into account, so as to establish a distribution model based More >