Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

60.175 UPC academic works
You are here:
View Item 
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Master's degree in Telecommunications Engineering (MET)
  • View Item
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Master's degree in Telecommunications Engineering (MET)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Model and optimize train scheduling on railways network

Thumbnail
View/Open
train_optimizer.zip (720,3Kb)
thesis.pdf (383,6Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/169126

Show full item record
Garrisi, Gianmarco
Tutor / directorCervelló Pastor, CristinaMés informacióMés informacióMés informació
Document typeMaster thesis
Date2019-07
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
In this work, a mathematical formulation of the train scheduling problem is provided as a Mixed Integer Linear Program. The MILP can be solved for easy cases, but computation time makes it impractical for more complex examples. Then a genetic algorithm is employed in the solution of the problem, with heuristic techniques to generate an initial population. The algorithm is applied to a number of problem instances producing feasible, though not optimal, solutions in less then one minute. Some improvements are suggested to obtain better results and further improve computation time.
Description
Generating a railway timetable is known to be an NP-hard problem. While scheduling few trains is easy, complications quickly explode with increasing number of trains. The most important factors contributing to complexity are interdepencies between trains (such as connections) and the inability of trains to overtake one another on the same track.
SubjectsGenetic algorithms, Railroads, Algorismes genètics, Ferrocarrils
DegreeMÀSTER UNIVERSITARI EN ENGINYERIA DE TELECOMUNICACIÓ (Pla 2013)
URIhttp://hdl.handle.net/2117/169126
Collections
  • Màsters oficials - Master's degree in Telecommunications Engineering (MET) [339]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
train_optimizer.zip720,3Kbapplication/zipView/Open
thesis.pdf383,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina