This article proposes a mathematical model and a branch-and-price algorithm for the multivehicle covering tour problem. This problem consists in finding a set of routes on a weighted graph such that a set of nodes that cannot be visited is covered. A node is covered if it lies within a predefined distance of a visited node. The subproblem encountered during the column generation is a variant of the profitable tour problem. It is reduced to a ring star problem and a branch-and-cut algorithm is developed. Computational results are reported on randomly generated instances. (c) 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(3), 160-168 2014
机构:
Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, TurkeyGeorgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
Ozbaygin, Gizem
Karasan, Oya Ekin
论文数: 0引用数: 0
h-index: 0
机构:
Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, TurkeyGeorgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
Karasan, Oya Ekin
Savelsbergh, Martin
论文数: 0引用数: 0
h-index: 0
机构:
Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USAGeorgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
Savelsbergh, Martin
Yaman, Hande
论文数: 0引用数: 0
h-index: 0
机构:
Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, TurkeyGeorgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA