Results 21 to 30 of about 413 (166)
Two models of the capacitated vehicle routing problem
The aim of the Capacitated Vehicle Routing Problem (CVRP) is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers.
Zuzana Borčinova
doaj +1 more source
Kernel Search for the Capacitated Vehicle Routing Problem
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics.
Zuzana Borčinová
doaj +1 more source
Capacitated Vehicle Routing Problem (CVRP) is one of the most popular VRP variants. Nearest Neighbour (NN) is a very simple and very easy heuristic. The basic concept of Nearest Neighbour is to choose the closest point that has never been visited. Russian CVRP Instances created by the author based on Russian history and places in Russia.
Sanggala, Ekra, Bisma, Muhammad Ardhya
openaire +2 more sources
A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case
The Capacitated Vehicle Routing Problem (CVRP) is a well known optimization problem applied in numerous applications. It consists of delivering items to some geographically dispersed customers using a set of vehicles operating from a single depot. As the
Sami Faiz +2 more
doaj +1 more source
Vehicle Routing Problem (VRP) merupakan penentuan sebuah set rute yang dilakukan oleh sebuah kendaraan dimulai perjalanan dari depot untuk memenuhi permintaan konsumen. Salah satu jenis dari VRP adalah Capacitated Vehicle Routing Problem (CVRP) yaitu VRP
Mutia Rohmah +2 more
doaj +1 more source
Dynamic Intercity Ride‐Sharing Optimisation Based on Two‐Stage Information Feedback
The article introduces a novel two‐stage scheduling approach for intercity dynamic ridesharing that separates the process into a coarse scheduling phase (with online and offline vehicle matching) and a fine scheduling phase that refines the solution using a large neighbourhood search algorithm. By integrating deep Q‐learning to dynamically trigger fine
Cheng Wang, Shangyu Gao, Jin Jiang
wiley +1 more source
In this paper, we introduce a new variant of large-scale vehicle routing problem that arises in the goods distribution of city e-commerce logistics, the multi-depot vehicle routing problem with order split and allocation (MD-CVRP-OSA), which incorporates
Yi Tao, Changhui Lin, Lijun Wei
doaj +1 more source
VND in CVRP, MDVRP, and VRPTW cases
Abstract Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to the customer, to get the minimum cost delivery route. To get optimal results, it is necessary to improve route from the initial solution.
D Satyananda, S Wahyuningsih
openaire +1 more source
Trajectory Optimisation for UAV Data Collection in IoT‐Based WSN: A Lévy Flight‐Based Approach
In large‐scale IoT and WSN deployments, data transmission to base stations is often limited by restricted network coverage, and drones can help extend connectivity by collecting data from cluster head nodes. This work proposes an energy‐efficient drone‐assisted data collection approach that jointly optimises system costs and energy consumption, taking ...
Hamayadji Abdoul Aziz +6 more
wiley +1 more source
Improved Approximations for a CVRP with Unsplittable Demands
In this paper, we present improved approximation algorithms for the (unsplittable) capacitated vehicle routing problem (CVRP) in general metrics. In the CVRP, we are given a set of points (clients) V together with a depot r in a metric space, with each [Formula: see text] having a demand [Formula: see text] and a vehicle of bounded capacity Q.
Zachary Friggstad +3 more
openaire +2 more sources

