Results 1 to 10 of about 4,867 (222)
Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)
Applied Artificial Intelligence, 2022 eCommerce, postal and logistics’ planners require to solve large-scale capacitated vehicle routing problems (CVRPs) on a daily basis. CVRP problems are NP-Hard and cannot be easily solved for large problem instances.
Francesco Alesiani +2 more
exaly +2 more sources
A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case
Egyptian Journal of Remote Sensing and Space Science, 2014 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
Saoussen Krichen, Wissem Inoubli
exaly +3 more sources
Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method [PDF]
چشمانداز مدیریت صنعتی, 2020 The vehicle routing problem is one of the most well-known optimization problems, which aims to design an optimum set of routes with the lowest cost for servicing the customers in a way that is consistent with the existing constraints.
Amin Farahbakhsh, Javad Behnamian
doaj +1 more source
Route your route: Playful activity for teaching of Capacitated Vehicle Routing Problem - CVRP
I+D Revista de Investigaciones, 2021 In companies, the transportation process involves all stages of production and distribution of products to customers with geographically dispersed locations that directly impact the cost of the operation and products, addressing vehicle routing problems (
Héctor Orlando Tarazona Galán +1 more
doaj +1 more source
Problem size reduction methods for large CVRPs
Computers & Operations Research, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragomir, Alina G., Müller, David I.
openaire +4 more sources
Knowledge Engineering and Data Science, 2022 Capacitated Vehicle Routing Problem (CVRP) is a type of NP-Hard combinatorial problem that requires a high computational process. In the case of CVRP, there is an additional constraint in the form of a capacity limit owned by the vehicle, so the ...
Farhanna Mar'i +3 more
doaj +1 more source
Jurnal Sistem dan Manajemen Industri, 2020 Capacitated Vehicle Routing Problem (CVRP) is known as an NP-hard problem. It is because CVRP problems are very hard for finding optimal solutions, especially in large instances.
Aisyahna Nurul Mauliddina +5 more
doaj +1 more source
Труды Института системного программирования РАН, 2018 Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers.
E. . Beresneva, S. . Avdoshin
doaj +1 more source
Running Genetic Algorithms in the Edge: A First Analysis [PDF]
, 2018 Nowadays, the volume of data produced by different kinds of devices is continuously growing, making even more difficult to solve the many optimization problems that impact directly on our living quality.
DE Goldberg +9 more
core +1 more source
Capacitated Vehicle Routing with Non-Uniform Speeds [PDF]
, 2010 The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-
A. Blum +15 more
core +4 more sources