Development of a tool for optimizing Vehicle Routing Problem
No Thumbnail Available
Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
FACULTE DES MATHEMATIQUES ET DE L’INFORMATIQUE DEPARTEMENT D’INFORMATIQUE
Abstract
Combinatorial optimization occupies a very important place in research operational, in discrete mathematics and computer science. The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?”. It generalizes the well-known travelling salesman problem (TSP).
Description
Keywords
VRP, TSP, Routing, Heuristics, C Sharp.