Development of a tool for optimizing Vehicle Routing Problem
| dc.contributor.author | Hamani, Amir | |
| dc.date.accessioned | 2018-07-04T10:14:28Z | |
| dc.date.available | 2018-07-04T10:14:28Z | |
| dc.date.issued | 2018 | |
| dc.description.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). | en_US |
| dc.identifier.uri | https://depot.univ-msila.dz/handle/123456789/5154 | |
| dc.language.iso | en | en_US |
| dc.publisher | FACULTE DES MATHEMATIQUES ET DE L’INFORMATIQUE DEPARTEMENT D’INFORMATIQUE | en_US |
| dc.subject | VRP, TSP, Routing, Heuristics, C Sharp. | en_US |
| dc.title | Development of a tool for optimizing Vehicle Routing Problem | en_US |
| dc.type | Thesis | en_US |