A branch-and-cut algorithm for the hub location and routing problem

Simple item page
dc.citation.epage174en_US
dc.citation.spage161en_US
dc.citation.volumeNumber50en_US
dc.contributor.authorRodríguez-Martín, I.en_US
dc.contributor.authorSalazar-González, J-J.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T11:00:09Z
dc.date.available2016-02-08T11:00:09Z
dc.date.issued2014en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and strengthen it with valid inequalities. We devise separation routines for these inequalities and develop a branch-and-cut algorithm which is tested on CAB and AP instances from the literature. The results show that the formulation is strong and the branch-and-cut algorithm is able to solve instances with up to 50 nodes.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:00:09Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2014en
dc.identifier.doi10.1016/j.cor.2014.04.014en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/26461
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2014.04.014en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectBranch-and-cuten_US
dc.subjectHub locationen_US
dc.subjectRoutingen_US
dc.subjectValid inequalitiesen_US
dc.titleA branch-and-cut algorithm for the hub location and routing problemen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_branch-and-cut_algorithm_for_the_hub_location_and_routing_problem.pdf
Size:
1.17 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering