Results 71 to 80 of about 4,867 (222)

Innovative hybrid algorithm for efficient routing of limited capacity vehicles

open access: yesIntelligent Systems with Applications
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

Genetic algorithm approach to asymmetric capacitated vehicle routing: A case study on bread distribution in Istanbul, Türkiye [PDF]

open access: yesDecision Science Letters
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

An improved two-phased heuristic algorithm for the capacitated vehicle routing problem and a case study

open access: yesCeylon Journal of Science, 2020
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

An exact approach for the vehicle routing problem with two-dimensional loading constraints [PDF]

open access: yes, 2007
We consider a special case of the symmetric capacitated vehicle routing problem, in which a fleet of K identical vehicles must serve n customers, each with a given demand consisting in a set of rectangular two-dimensional weighted items.
D. VIGO   +2 more
core   +1 more source

Electric Vehicle Routing With Recharging Stations: Trade‐Offs in Last‐Mile Delivery

open access: yesIET Intelligent Transport Systems, Volume 19, Issue 1, January/December 2025.
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

Improving neighborhood exploration into MOEA/D framework to solve a bi‐objective routing problem

open access: yesInternational Transactions in Operational Research, Volume 32, Issue 1, Page 117-143, January 2025.
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

Applying a Hybrid Gray Wolf‐Enhanced Whale Optimization Algorithm to the Capacitated Vehicle Routing Problem

open access: yesJournal of Advanced Transportation, Volume 2025, Issue 1, 2025.
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

PENDEKATAN FUZZY CLUSTERING DALAM PENYELESAIAN CVRP [PDF]

open access: yes, 2018
CVRP merupakan salah satu persoalan VRP yang paling dasar, CVRP hanya memiliki satu pembatas berupa kapasitas angkut kendaraan, dan hanya memiliki satu depot.
LUKI PRASETYO, : 143010023
core  

Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem

open access: yes, 2016
Real-world problems are very difficult to optimize. However, many researchers have been solving benchmark problems that have been extensively investigated for the last decades even if they have very few direct applications.
Ahiod, Belaïd, Yafrani, Mohamed El
core   +1 more source

Solving the robust CVRP under demand uncertainty

open access: yes, 2018
In this paper, we propose a Branch-Cut-and-price algorithm for the robust counterpart of the classical Capacitated Vehicle Routing Problem (CVRP). The deterministic version of this problem consists of finding a set of vehicle routes to serve a given set of customers with associated demands such that the sum of demands served by each vehicle does not ...
Pessoa, Artur   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy