ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Local search for the vehicle routing problem

Thomas, Charles ; Smet, Laurent
(2016)

Files

Thomas_88241000_Smet_30491000_2016.pdf
  • Open access
  • Adobe PDF
  • 4.32 MB
Download
Thomas_88241000_Smet_30491000_2016_Annexe1.zip
  • Open access
  • Unknown
  • 1.15 MB
Download

Details

Supervisors
Deville, Yves
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] en sciences informatiques
Abstract
The aim of this thesis is to study the Vehicle Routing Problem (VRP), analyse the existing resolution methods in local search and extend a specific VRP module in the Open LS system, an open source local search system. The VRP is a well known optimisation problem. It consists in directing a fleet of vehicles to deliver goods to a series of clients situated at different places. The objective is to choose which route to assign to each vehicle in order to minimise the delivery costs. This thesis focuses on the local search approach to solve the VRP. The local search is a perturbative incomplete method which works by starting from a possible solution and applying local changes step by step in order to improve the current solution.