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

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 addition, Trusted Forwarding Factor (TFF)… 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

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 Attribute Decision Making with Capacitated… 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

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 to find solution to the… 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

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 solve in a reasonable computational… 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

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 for calculating the cost of… 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

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 on the ratio of minimum… More >

G. Niranjani^1,*, K. Umamaheswari²

Intelligent Automation & Soft Computing, Vol.33, No.1, pp. 457-472, 2022, DOI:10.32604/iasc.2022.024264

Abstract COVID-19 pandemic has imposed many threats. One among them is the accumulation of waste in hospitals. Waste should be disposed regularly and safely using sustainable methods. Sustainability is self development with preservation of society and its resources. The main objective of this research is to achieve sustainability in waste collection by minimizing the cost factor. Minimization of sustainable-cost involves minimization of three sub-components – total travel-cost representing economical component, total emission-cost representing environmental component and total driver-allowance-cost representing social component. Most papers under waste collection implement Tabu search algorithm and fail to consider the environmental and social aspects involved. We… 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

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 of minimizing the total travel… More >

Zonglin Fu¹, Pei Hu¹, Wei Li², Jeng-Shyang Pan^1,*, Shuchuan Chu¹

Intelligent Automation & Soft Computing, Vol.27, No.1, pp. 233-247, 2021, DOI:10.32604/iasc.2021.014192

Abstract The Equilibrium Optimizer (EO) algorithm is a novel meta-heuristic algorithm based on the strength of physics. To achieve better global search capability, a Parallel Equilibrium Optimizer algorithm, named PEO, is proposed in this paper. PEO is inspired by the idea of parallelism and adopts two different communication strategies between groups to improve EO. The first strategy is used to speed up the convergence rate and the second strategy promotes the algorithm to search for a better solution. These two kinds of communication strategies are used in the early and later iterations of PEO respectively. To check the optimization effect of… More >

Yi-Chih Hsieh¹, Peng-Sheng You^2,*

Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 703-713, 2020, DOI:10.32604/iasc.2020.010104

Abstract In this study we present a generalized museum visitor routing problem considering the preferences and congestion of multiple groups with each group having its own must-see and select-see exhibition rooms based on their preferences in exhibits. The problem aims to minimize the makespan of all groups. An effective encoding scheme is proposed to simultaneously determine the scheduling of exhibition rooms for all groups and an immune-based algorithm (IBA) is developed. Numerical results, compared with those of a genetic algorithm and particle swarm optimization, on a museum in Taiwan are reported and discussed to show the performance of the IBA. More >