A simulated annealing algorithm for the capacitated vehicle routing problem

Azar, Danielle; Harmanani, Haidar M.; Keirouz, Walid; Helal, Nathalie Georges

A simulated annealing algorithm for the capacitated vehicle routing problem

Azar, Danielle; Harmanani, Haidar M.; Keirouz, Walid; Helal, Nathalie Georges

URL: https://www.researchgate.net/publication/221206046_A_Simulated_Annealing_Algorithm_for_the_Capacitated_Vehicle_Routing_Problem

Date: 2018-04-20

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. Experimental results are presented and favorable comparisons are reported. Copyright © 2011 by the International Society for Computers and Their Applications (ISCA).

Citation:

Harmanani, H. M., Azar, D., Helal, N., & Keirouz, W. (2011). A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem. In CATA (pp. 96-101).