Branch-and-price approaches for the network design problem with relays

Simple item page
buir.contributor.authorKaraşan, Oya Ekin
buir.contributor.authorYaman, Hande
dc.citation.epage169en_US
dc.citation.spage155en_US
dc.citation.volumeNumber92en_US
dc.contributor.authorYıldız, B.en_US
dc.contributor.authorKaraşan, Oya Ekinen_US
dc.contributor.authorYaman, Handeen_US
dc.date.accessioned2019-02-21T16:01:28Z
dc.date.available2019-02-21T16:01:28Z
dc.date.issued2018en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWith different names and characteristics, relays play a crucial role in the design of transportation and telecommunication networks. In transportation networks, relays are strategic locations where exchange of drivers, trucks or mode of transportation takes place. In green transportation, relays become the refuelling/recharging stations extending the reach of alternative fuel vehicles. In telecommunication networks, relays are regenerators extending the reach of optical signals. We study the network design problem with relays and present a multi-commodity flow formulation and a branch-and-price algorithm to solve it. Motivated by the practical applications, we investigate the special case where each demand has a common designated source. In this special case, we can show that there exists an optimal design that is a tree. Using this fact, we replace the multi-commodity flow formulation with a tree formulation enhanced with Steiner cuts. Employing a branch-and-price-and-cut schema on this formulation, we are able to further extend computational efficiency to solve large problem instances.
dc.description.provenanceMade available in DSpace on 2019-02-21T16:01:28Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 222869 bytes, checksum: 842af2b9bd649e7f548593affdbafbb3 (MD5) Previous issue date: 2018en
dc.description.sponsorshipThis work was supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under the grant number 2211A . We are also thankful to an anonymous reviewer for indicating a bug in the implementation.
dc.embargo.release2021-04-01en_US
dc.identifier.doi10.1016/j.cor.2018.01.004
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/49853
dc.language.isoEnglish
dc.publisherElsevier
dc.relation.isversionofhttps://doi.org/10.1016/j.cor.2018.01.004
dc.relation.project2211A - Türkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK
dc.source.titleComputers and Operations Researchen_US
dc.subjectBranch-and-Priceen_US
dc.subjectBranch-and-Price-and-Cuten_US
dc.subjectRegenerator locationen_US
dc.subjectRelayen_US
dc.subjectRoutingen_US
dc.titleBranch-and-price approaches for the network design problem with relaysen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Branch_and_price_approaches_for_the_network_design_problem_with_relays.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering