Improving parametric Clarke and Wright algorithms by means of EAGH-1 [PDF]
, 2014 Since Clarke and Wright proposed their well-known savings a lgorithm for solving the Capacitated Vehicle Routing Problem, several enhancements to the original savings formula have been recently proposed, in the form of parameterisations.
Corominas Subias, Albert +2 more
core +1 more source
, 2017 We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP).
Banbara, Mutsunori +3 more
core +1 more source
Improving parametric Clarke and Wright algorithms by means of iterative empirically adjusted greedy heuristics [PDF]
, 2014 Since Clarke and Wright proposed their well-known savings algorithm for solving the Capacitated Vehicle Routing Problem, several enhancements to the original savings formula have been recently proposed, in the form of parameterisations.
Corominas, Albert +2 more
core
Civil Engineering DimensionThe success rate of construction projects depends on subcontractors and material suppliers, especially in ensuring the material delivery to avoid delays and cost overruns. The Vehicle Routing Problem (VRP) addresses transportation management to minimize
Ambrosius Matthew Junius Reynaldo +3 more
doaj +1 more source
Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem [PDF]
, 2013 The Capacitated Vehicle Routing Problem (CVRP) is an NP-Hard problem, which means it is impossible to find a polynomial time solution for it. So researchers try to reach a near optimum solution by using meta-heuristic algorithms.
Sami, A. (Ashkan), Tavakoli, M. M. (M)
core
Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
IEEE AccessIsing machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in practical situations, typically involve inequality constraints.
Hiroshi Kanai +3 more
doaj +1 more source
PENERAPAN ALGORITMA GENETIKA PADA PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) UNTUK DISTRIBUSI SURAT KABAR KEDAULATAN RAKYAT DI KABUPATEN SLEMAN [PDF]
, 2016 Algoritma genetika merupakan teknik pencarian yang didasarkan atas mekanisme seleksi dan genetik natural. Algoritma ini digunakan untuk penyelesaian masalah optimasi yang kompleks seperti capacitated vehicle routing problem (CVRP). Tujuan dari penelitian
Emut, Emut +2 more
core
LOCAL SEARCH BASED ALGORITHM FOR CVRP WITH STOCHASTIC DEMANDS
International Journal of Advanced Research in Computer Science, 2017 This paper studies about the capacitated vehicle routing problem (CVRP). Since the problem is NP-hard, a local search based algorithm is used for the CVRP with the target to limit the aggregate visited distance and number of vehicles. This algorithm is proven to be effective and as efficient for CVRP by checking its comparability with existing best ...
openaire +2 more sources
An Entropy-Balanced Orthogonal Learning Bamboo Forest Growth Optimization Algorithm with Quasi-Affine Transformation Evolutionary and Its Application in Capacitated Vehicle Routing Problem. [PDF]
Entropy (Basel), 2023 Pan JS +4 more
europepmc +1 more source
Benchmarking a fast, satisficing vehicle routing algorithm for public health emergency planning and response: "Good Enough for Jazz". [PDF]
PeerJ Comput Sci, 2023 McDaniel EL +3 more
europepmc +1 more source