A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem
This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP) is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distributed learning automata that is a general searching tool and is a solving tool for variety of NP-complete problems, is used to solve this problem and tested on fourteen benchmark problems. Our results were compared to the best known results. The results of comparison have shown the efficiency of the proposed algorithm.
Keywords: Vehicle routing problem, Capacitated vehicle routing problem, Distributed learning automata, 2-opt local search heuristic, Candidate list, Mutation operation.
Download Full-Text
ABOUT THE AUTHORS
Mir Mohammad Alipour
Department of Computer Engineering, University of Bonab, Bonab 5551761167, Iran
Mir Mohammad Alipour
Department of Computer Engineering, University of Bonab, Bonab 5551761167, Iran
Mir Mohammad Alipour
Department of Computer Engineering, University of Bonab, Bonab 5551761167, Iran
Mir Mohammad Alipour
Department of Computer Engineering, University of Bonab, Bonab 5551761167, Iran
