Results 21 to 30 of about 11,225 (197)
The Electric Vehicle Routing Problem with Capacitated Charging Stations
Transportation Science, 2022 Electric vehicle routing problems (E-VRPs) deal with routing a fleet of electric vehicles (EVs) to serve a set of customers while minimizing an operational criterion, for example, cost or time. The feasibility of the routes is constrained by the autonomy of the EVs, which may be recharged along the route.
Aurélien Froger +3 more
openaire +4 more sources
A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints
Algorithms, 2018 The Vehicle Routing Problem (VRP) is one of the most optimized tasks studied and it is implemented in a huge variety of industrial applications. The objective is to design a set of minimum cost paths for each vehicle in order to serve a given set of ...
Lucia Cassettari +4 more
doaj +1 more source
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
doaj +1 more source
Approximation Algorithms for the Load-Balanced Capacitated Vehicle Routing Problem [PDF]
Bulletin of the Iranian Mathematical Society, 2020 We study the load balanced capacitated vehicle routing problem (LBCVRP): the problem is to design a collection of tours for a fixed fleet of vehicles with capacity Q to distribute a supply from a single depot between a number of predefined clients, in a way that the total traveling cost is a minimum, and the vehicle loads are balanced.
Fallah, Haniyeh +2 more
openaire +3 more sources
On the use of biased-randomized algorithms for solving non-smooth optimization problems [PDF]
, 2020 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Ferrer Biosca, Albert +4 more
core +3 more sources
IEEE Access, 2019 The Internet of Things integrates lots of capacitated vehicles in smart logistics. The routing for capacitated vehicles is a combinatorial optimization problem which has been widely studied in recent years.
Na Lin +3 more
doaj +1 more source
Metaheuristics for the Vehicle Routing Problem with Loading Constraints [PDF]
, 2007 We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem.
G. FUELLERER +4 more
core +1 more source
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
Hybrid Metaheuristics for the Clustered Vehicle Routing Problem [PDF]
, 2014 The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers
Battarra, Maria +3 more
core +2 more sources
Utilizing a hybrid metaheuristic algorithm to solve capacitated vehicle routing problem
Results in Control and Optimization, 2023 One of the most often researched optimization issues is the vehicle routing problem. It is categorized as an NP-hard problem with high time complexity.
Mamta Kumari +3 more
doaj +1 more source