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'.
 

An R script for single allocation hub location problems.

Berouayel, Aladin
(2016)

Files

Berouayel_29390700_2016.pdf
  • Open access
  • Adobe PDF
  • 2.13 MB
Download

Details

Supervisors
Agrell, Per Joakim
Faculty
Louvain School of Management
Degree label
Master [120] en Ingénieur de gestion
Abstract
The contribution of this thesis is an R script that provides the optimal hub location and non-hub node allocation to the hubs for several discrete single allocation hub location problems. These problems are the capacitated and uncapacitated single allocation p-hub median problems, the uncapacitated single allocation p-hub center problem, the uncapacitated single allocation hub covering problem and the uncapacitated single allocation p-hub maximal covering problem. For the single allocation p-hub median problems, it is possible to consider the fixed costs to locate the hubs and to allocate the non-hub nodes to the hubs into the total cost of the network. The single allocation hub covering problem can minimize the number of hubs to locate on the network or the cost to locate them in order to cover all demand. The script can also construct the distance matrix itself by requesting the distances on the internet and the optimal solution can be displayed on a map. The first chapter after the introduction is a review of the literature that discusses hub location models. It is mainly focused on models that have similar assumptions than our R implementation. The following chapter explains the different steps followed by the algorithms, the inputs of the different functions that solve the single allocation hub location problems, the outputs of the functions and how the optimal solution is displayed. The last chapter is a computational analysis of the script. It is mainly focused on a benchmark with papers that provide computational results of the CAB data set for models with the same assumptions than the models implemented in the script. Finally, the conclusion summarizes the theoretical and managerial contributions of this thesis and suggests further works that would extend the functionalities of the script or improve its performance.