Results 51 to 60 of about 413 (166)
A hybrid approach for energy‐efficient routing in IoT using duty cycling and improved ant colony
The proposed approach poses the empirical notion to manage the energy consumption of the IoT network by considering the key performance indicators (KPI) like energy consumption, average residual energy, mobility factor, distance, throughput, and network lifespan to accomplish the tangible outputs.The proposed approach is modelled using DFD's and ...
Bharti Rana +4 more
wiley +1 more source
A Parallel Hybrid Genetic Search for Solving the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP) and its variant, the Capacitated VRP (CVRP), are significant optimization challenges in transportation and logistics, impacting fleet management and delivery services.
Mohammad Jamshidi +3 more
doaj +1 more source
Genetic algorithm approach to asymmetric capacitated vehicle routing: A case study on bread distribution in Istanbul, Türkiye [PDF]
Conveying the products to the customers under optimized circumstances is as crucial for the companies as the production itself. One optimization strategy to consider is transportation with the minimum quantity of vehicles and the selection of ...
Büşra Meniz, Fatma Tiryaki
doaj +1 more source
Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days, considering the wide usage of routing algorithms in multiple fields such as transportation domain, food delivery, network routing, ... Capacitated vehicle routing problem is classified as an NP-Hard problem, hence normal optimization algorithm ...
openaire +2 more sources
Electric Vehicle Routing With Recharging Stations: Trade‐Offs in Last‐Mile Delivery
This study addresses the capacitated electric vehicle Routing Problem (CEVRP) in last‐mile logistics by considering charging stations and various charging strategies (full charge, partial charge, and charging at 20–80% state of charge (SoC)). The adaptive large neighbourhood search (ALNS) algorithm is proposed and proven to be effective for large‐scale
Sinem Bozkurt Keser +2 more
wiley +1 more source
Innovative hybrid algorithm for efficient routing of limited capacity vehicles
This study addresses the critical challenges posed by the capacitated vehicle routing problem (CVRP), particularly in the logistics of cement transportation under capacity constraints.
Vu Hong Son Pham +2 more
doaj +1 more source
Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem [PDF]
The goal of this paper is to present a two-phase convex hull-based algorithm for the capacitated vehicle routing problem $(CVRP)$, consisting of clustering and routing phases.
M. Afsharirad, A. Hashemi Borzabadi
doaj +1 more source
The Capacitated Vehicle Routing Problem (CVRP) is a special variant of the Vehicle Routing Problem which has been extensively addressed in the literature of Operations Research.
M. K. D. D. Sandaruwan +2 more
doaj +1 more source
Improving neighborhood exploration into MOEA/D framework to solve a bi‐objective routing problem
Abstract Local search (LS) algorithms are efficient metaheuristics to solve combinatorial problems. The performance of LS highly depends on the neighborhood exploration of solutions. Many methods have been developed over the years to improve the efficiency of LS on different problems of operations research.
Clément Legrand +3 more
wiley +1 more source
The study presents a novel hybrid gray wolf and whale optimization algorithm (hGWOAM) for the capacitated vehicle routing problem (CVRP). By integrating the enhanced whale optimization algorithm (EWOA) and gray wolf optimizer (GWO) with tournament selection, opposition‐based learning, and mutation techniques, hGWOAM enhances routing efficiency under ...
Vu Hong Son Pham +3 more
wiley +1 more source

