Comparative Study of GA, Simulated Annealing And Hybrid of Both Strategies on a CVRP

Meta heuristic algorithms are often used to produce good approximations to NP-hard combinatorial optimization problems within an acceptable time frame. This work measures statistical difference between applying two of such algorithms on a Capacitated Vehicle Routing Problem (CPVRP).

In CPVRP, there are two objectives to be optimized: number of vehicles ...