Show simple item record

dc.contributor.authorAlbareda Sambola, Maria
dc.contributor.authorMarín Pérez, Alfredo
dc.contributor.authorRodríguez Chía, Antonio Manuel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.date.accessioned2019-03-21T18:31:51Z
dc.date.issued2019-08-16
dc.identifier.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
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/2117/130747
dc.description.abstractMany 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.
dc.format.extent13 p.
dc.language.isoeng
dc.publisherElsevier
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subject.lcshRailroads--Freight
dc.subject.lcshFreight and freightage
dc.subject.lcshOptimització combinatorial
dc.subject.otherCombinatorial optimization
dc.subject.otherRail-rail transshipment
dc.subject.otherInteger programming
dc.subject.otherGraph partitioning
dc.titleReformulated acyclic partitioning for rail-rail containers transshipment
dc.typeArticle
dc.subject.lemacFerrocarrils -- Càrrega
dc.subject.lemacTransport de mercaderies
dc.subject.lemacOptimització combinatòria
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.identifier.doi10.1016/j.ejor.2019.02.022
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/abs/pii/S037722171930150X
dc.rights.accessRestricted access - publisher's policy
drac.iddocument23964902
dc.description.versionPostprint (author's final draft)
dc.date.lift2021-03-01
upcommons.citation.authorAlbareda-Sambola, M.; Marín, A.; Rodríguez-Chía, A.M.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameEuropean journal of operational research
upcommons.citation.volume277
upcommons.citation.number1
upcommons.citation.startingPage153
upcommons.citation.endingPage165


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain