Title:
	Development of a heuristic algorithm for a hub location problem
		Responsable(s) :
			Nikola Obrenovic, Nicholas Molyneaux, Michel Bierlaire
		Description :
			In railway networks, the location of marshalling and shunting yards, i.e. facilities used for sorting and consolidation of transported goods, determines the costs of cargo transport to a great extent. Hence, each railway company is highly motivated to determine the optimal location of these yards. Such task can be represented as a multi-level facility location problem or a hub location problem. The aim of this project is the development of an heuristic algorithm for solving a facility location problem with facilities split in multiple hierarchical layers. The project will be a part of a larger research project done in the cooperation with SBB. The student will start from understanding the exact mathematical model of the mentioned problem and encode it into a heuristic algorithm, e.g. a local search algorithm or VNS. Also, the student will have to solve the problem on a smaller data set using an exact method and compare the solution with the results of the heuristic algorithm. The student needs to have good programming skills (Java or some other OO language) and knowledge of mixed integer linear programming and heuristics.
		Collaboration with:
			SBB Cargo
		Type :
			semester project
		Pré-requis :
			Programming knowledge (Java or some other OO language), Operations Research (mixed integer linear programming, heuristics)
		Submitted on :
			February 28, 2018