Results 31 to 40 of about 4,867 (222)
Kernel Search for the Capacitated Vehicle Routing Problem
Applied Sciences, 2022 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
Jurnal Teknik Industri TerintegrasiCapacitated 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
The two-echelon capacitated vehicle routing problem: models and math-based heuristics [PDF]
, 2011 Multiechelon distribution systems are quite common in supply-chain and logistics. They are used by public administrations in their transportation and traffic planning strategies, as well as by companies, to model own distribution systems.
Barros A. I. +10 more
core +1 more source
The effects of equitability policies on the ZEV market: Evidence from California’s Clean Vehicle Rebate Project [PDF]
, 2020 California’s Clean Vehicle Rebate Program (CVRP) is the largest zero-emissions vehicle (ZEV) incentive program in the United States. This policy brief summarizes how changes to the CVRP incentive structure may have affected California's ZEV ...
Brown, Austin, Fuller, Sam
core
Dynamic Intercity Ride‐Sharing Optimisation Based on Two‐Stage Information Feedback
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.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
Journal of Advanced Transportation, 2022 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
Journal of Physics: Conference Series, 2019 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
IET Smart Cities, Volume 8, Issue 1, January/December 2026.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
Mathematics of Operations ResearchIn 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
Penyelesaian CVRP dengan Menggunakan Savings Algorithm & VBA Excel
Jurnal Media Teknik dan Sistem Industri, 2020 Capacitated Vehicle Routing Problem (CVRP) merupakan sebuah masalah logistik yang banyak diteliti oleh para ilmuwan. Salah satu algoritma yang populer untuk menyelesaikannya adalah Algoritma Savings. Jika perhitungan Algoritma Savings dilakukan secara manual tentu akan banyak menghabiskan waktu, oleh karena itu diperlukan sebuah aplikasi untuk membantu
openaire +3 more sources