Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (10)
  • Open Access


    Efficient Network Selection Using Multi-Depot Routing Problem for Smart Cities

    R. Shanthakumari1, Yun-Cheol Nam2, Yunyoung Nam3,*, Mohamed Abouhawwash4,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 >

  • Open Access


    Genetic Crossover Operators for the Capacitated Vehicle Routing Problem

    Zakir Hussain Ahmed1,*, Naif Al-Otaibi1, Abdullah Al-Tameem2, Abdul Khader Jilani Saudagar2

    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 >

  • Open Access


    A New Route Optimization Approach of Fresh Agricultural Logistics Distribution

    Daqing Wu1,2, Jiye Cui1,*, Dan Li3, Romany Fouad Mansour4

    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 >

  • Open Access


    Optimizing Fresh Logistics Distribution Route Based on Improved Ant Colony Algorithm

    Daqing Wu1,2, Ziwei Zhu1, Dong Hu3,*, Romany Fouad Mansour4

    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 >

  • Open Access


    Sustainable Waste Collection Vehicle Routing Problem for COVID-19

    G. Niranjani1,*, K. Umamaheswari2

    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 >

  • Open Access


    Deep Reinforcement Learning Model for Blood Bank Vehicle Routing Multi-Objective Optimization

    Meteb M. Altaf1,*, Ahmed Samir Roshdy2, Hatoon S. AlSagri3

    CMC-Computers, Materials & Continua, Vol.70, No.2, pp. 3955-3967, 2022, DOI:10.32604/cmc.2022.019448

    Abstract The overall healthcare system has been prioritized within development top lists worldwide. Since many national populations are aging, combined with the availability of sophisticated medical treatments, healthcare expenditures are rapidly growing. Blood banks are a major component of any healthcare system, which store and provide the blood products needed for organ transplants, emergency medical treatments, and routine surgeries. Timely delivery of blood products is vital, especially in emergency settings. Hence, blood delivery process parameters such as safety and speed have received attention in the literature, as well as other parameters such as delivery cost. In this paper, delivery time and… More >

  • Open Access


    A Coordination-Based Algorithm for Dedicated Destination Vehicle Routing in B2B E-Commerce

    Tsung-Yin Ou1, Chen-Yang Cheng2, Chun Hsiung Lai3, Hsin-Pin Fu1,*

    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 >

  • Open Access


    Exploring Hybrid Genetic Algorithm Based Large-Scale Logistics Distribution for BBG Supermarket

    Yizhi Liu1,2, Rutian Qing1,2,*, Liangran Wu1,2, Min Liu1,2, Zhuhua Liao1,2, Yijiang Zhao1,2

    Journal on Artificial Intelligence, Vol.3, No.1, pp. 33-43, 2021, DOI:10.32604/jai.2021.016565

    Abstract In the large-scale logistics distribution of single logistic center, the method based on traditional genetic algorithm is slow in evolution and easy to fall into the local optimal solution. Addressing at this issue, we propose a novel approach of exploring hybrid genetic algorithm based large-scale logistic distribution for BBG supermarket. We integrate greedy algorithm and hillclimbing algorithm into genetic algorithm. Greedy algorithm is applied to initialize the population, and then hill-climbing algorithm is used to optimize individuals in each generation after selection, crossover and mutation. Our approach is evaluated on the dataset of BBG Supermarket which is one of the… More >

  • Open Access


    Parallel Equilibrium Optimizer Algorithm and Its Application in Capacitated Vehicle Routing Problem

    Zonglin Fu1, Pei Hu1, Wei Li2, Jeng-Shyang Pan1,*, Shuchuan Chu1

    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 >

  • Open Access


    Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm

    Jinhui Ge1, Xiaoliang Liu2, *, Guo Liang3

    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 >

Displaying 1-10 on page 1 of 10. Per Page  

Share Link