A cutting plane algorithm for the General Routing Problem

被引：0
|
作者：
Angel Corberáan
Adam N. Letchford
José María Sanchis
机构：
[1] DEIO,
[2] Faculty of Mathematics,undefined
[3] University of Valencia,undefined
[4] Spain,undefined
[5] Dept. of Management Science,undefined
[6] Lancaster University,undefined
[7] England,undefined
[8] Dept. of Applied Mathematics,undefined
[9] University Polytechnic of Valencia,undefined
[10] Spain,undefined
来源：
Mathematical Programming | 2001年 / 90卷
关键词：
Key words: valid inequalities – cutting planes – General Routing Problem – Rural Postman Problem – Graphical Travelling Salesman Problem; Mathematics Subject Classification (2000): 90C57;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.
引用
收藏
页码：291 / 316
页数：25
相关论文
共 50 条
  • [11] A cutting plane algorithm for the capacitated facility location problem
    Pasquale Avella
    Maurizio Boccia
    Computational Optimization and Applications, 2009, 43 : 39 - 65
  • [12] CENTRAL CUTTING PLANE ALGORITHM FOR CONVEX PROGRAMMING PROBLEM
    ELZINGA, J
    MOORE, TG
    MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 134 - 145
  • [13] A Center Cutting Plane Algorithm for a Likelihood Estimate Problem
    Fernanda Raupp
    Clóvis Gonzaga
    Computational Optimization and Applications, 2002, 21 : 277 - 300
  • [14] Cutting plane algorithm for the max-cut problem
    de Simone, C.
    Rinaldi, G.
    Optimization Methods and Software, 1994, 3 (1-3) : 195 - 214
  • [15] Solving General Capacity Problem by Relaxed Cutting Plane Approach
    Soon-Yi Wu
    Shu-Cherng Fang
    Chih-Jen Lin
    Annals of Operations Research, 2001, 103 : 193 - 211
  • [16] Solving general capacity problem by relaxed cutting plane approach
    Wu, SY
    Fang, SC
    Lin, CJ
    ANNALS OF OPERATIONS RESEARCH, 2001, 103 (1-4) : 193 - 211
  • [17] A Matheuristic Algorithm for the Mixed Capacitated General Routing Problem
    Bosco, Adamo
    Lagana, Demetrio
    Musmanno, Roberto
    Vocaturo, Francesca
    NETWORKS, 2014, 64 (04) : 262 - 281
  • [18] AN EFFICIENT CUTTING PLANE ALGORITHM FOR THE SMALLEST ENCLOSING CIRCLE PROBLEM
    Jiang, Yi
    Luo, Chuan
    Ling, Shenggui
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2017, 13 (01) : 147 - 153
  • [19] A cutting plane algorithm for the Capacitated Connected Facility Location Problem
    Gollowitzer, Stefan
    Gendron, Bernard
    Ljubic, Ivana
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 55 (03) : 647 - 674
  • [20] A cutting plane algorithm for the Capacitated Connected Facility Location Problem
    Stefan Gollowitzer
    Bernard Gendron
    Ivana Ljubić
    Computational Optimization and Applications, 2013, 55 : 647 - 674
12345