Show simple item record

dc.contributor.authorErdoğan, Güneş
dc.contributor.authorCordeau, J.-F.
dc.contributor.authorLaporte, G.
dc.date.accessioned2012-05-18T11:42:45Z
dc.date.available2012-05-18T11:42:45Z
dc.date.issued2010-08-06
dc.identifier.issn0166-218X
dc.identifier.urihttp://hdl.handle.net/10679/164
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0166218X10002076
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractThis paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of demand, or both. The objective is to determine a minimum cost capacitated vehicle route for transporting the items in such a way that all demands are satisfied. The vehicle can carry more than one item at a time. Three mathematical programming formulations of the problem are provided. Several classes of valid inequalities are derived and incorporated within abranch-and-cut algorithm, and extensive computational experiments are performed on instances adapted from TSPLIB.en_US
dc.description.sponsorshipthe Canadian Natural Sciences and Engineering Research Council
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematics
dc.rightsrestrictedAccess
dc.titleA branch-and-cut algorithm for solving the non-preemptive capacitated swapping problemen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0002-2456-3719 & YÖK ID 172715) Erdoğan, Güneş
dc.contributor.ozuauthorErdoğan, Güneş
dc.identifier.volume158
dc.identifier.issue15
dc.identifier.startpage1599
dc.identifier.endpage1614
dc.identifier.wosWOS:000281336500005
dc.identifier.doi10.1016/j.dam.2010.05.025
dc.subject.keywordsSwapping problemen_US
dc.subject.keywordsRobot arm travelen_US
dc.subject.keywordsNon-preemptiveen_US
dc.subject.keywordsCapacitateden_US
dc.subject.keywordsMathematical programmingen_US
dc.subject.keywordsBranch-and-cuten_US
dc.identifier.scopusSCOPUS:2-s2.0-77955421549
dc.contributor.authorMale1
dc.relation.publicationcategoryArticle - International Refereed Journal - Institutional Academic Staff


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page