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

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Reformulated acyclic partitioning for rail-rail containers transshipment

Thumbnail
View/Open
Reformulatedacyclic.pdf (884,3Kb)
Share:
 
 
10.1016/j.ejor.2019.02.022
 
  View Usage Statistics
Cita com:
hdl:2117/130747

Show full item record
Albareda Sambola, MariaMés informacióMés informacióMés informació
Marín Pérez, Alfredo
Rodríguez Chía, Antonio Manuel
Document typeArticle
Defense date2019-08-16
PublisherElsevier
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Many rail terminals have loading areas that are properly equipped to move containers between trains. With the growing throughput of these terminals all the trains involved in a sequence of such movements may not ¿t in the loading area simultaneously, and storage areas are needed to place containers waiting for their destination train, although this storage increases the cost of the transshipment. This increases the complexity of the planning decisions concerning these activities, since now trains need to be packed in groups that ¿t in the loading area, in such a way that the number of containers moved to the storage area is minimized. Additionally, each train is only allowed to enter the loading area once. Similarly to previous authors, we model this situation as an acyclic graph partitioning problem for which we present a new formulation, and several valid inequalities based on its theoretical properties. Our computational experiments show that the new formulation outperforms the previously existing ones, providing results that improve even on the best exact algorithm designed so far for this problem.
CitationAlbareda-Sambola, M.; Marín, A.; Rodríguez-Chía, A.M. Reformulated acyclic partitioning for rail-rail containers transshipment. "European journal of operational research", 16 Agost 2019, vol. 277, núm. 1, p. 153-165 
URIhttp://hdl.handle.net/2117/130747
DOI10.1016/j.ejor.2019.02.022
ISSN0377-2217
Publisher versionhttps://www.sciencedirect.com/science/article/abs/pii/S037722171930150X
Collections
  • GNOM - Grup d'Optimització Numèrica i Modelització - Articles de revista [96]
  • Departament d'Estadística i Investigació Operativa - Articles de revista [604]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Reformulatedacyclic.pdf884,3KbPDFView/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