Erdoğan, GüneşCordeau, J.-F.Laporte, G.2012-05-182012-05-182010-08-060166-218Xhttp://hdl.handle.net/10679/164https://doi.org/10.1016/j.dam.2010.05.025Due to copyright restrictions, the access to the full text of this article is only available via subscription.This 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.enginfo:eu-repo/semantics/restrictedAccessArticle158151599161400028133650000510.1016/j.dam.2010.05.025Swapping problemRobot arm travelNon-preemptiveCapacitatedMathematical programmingBranch-and-cut2-s2.0-77955421549