A Branch-and-Cut-and-Price Algorithm for the Mixed Capacitated General Routing Problem

被引：8
|
作者：
Bach, Lukas [1 ,2 ]
Lysgaard, Jens [2 ]
Wohlk, Sanne [2 ]
机构：
[1] SINTEF ICT, Dept Appl Math, Oslo, Norway
[2] Aarhus Univ, Dept Econ & Business Econ, Cluster Operat Res & Logist, Aarhus, Denmark
来源：
NETWORKS | 2016年 / 68卷 / 03期
关键词：
Mixed Capacitated General Routing Problem; Branch-And-Cut-And-Price; The Node; Edge; And Arc Routing Problem; INEQUALITIES;
D O I：
10.1002/net.21690
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm for obtaining optimal solutions to the problem and present computational results based on a set of standard benchmark instances. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码：161 / 184
页数：24
相关论文
共 50 条
  • [1] A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
    Lysgaard, Jens
    Wohlk, Sanne
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) : 800 - 810
  • [2] Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
    Ricardo Fukasawa
    Humberto Longo
    Jens Lysgaard
    Marcus Poggi de Aragão
    Marcelo Reis
    Eduardo Uchoa
    Renato F. Werneck
    [J]. Mathematical Programming, 2006, 106 : 491 - 511
  • [3] Robust branch-and-cut-and-price for the capacitated vehicle routing problem
    Fukasawa, R
    Lysgaard, J
    de Aragao, MP
    Reis, M
    Uchoa, E
    Werneck, RF
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3064 : 1 - 15
  • [4] Robust branch-and-cut-and-price for the capacitated vehicle routing problem
    Fukasawa, R
    Longo, H
    Lysgaard, J
    de Aragao, MP
    Reis, M
    Uchoa, E
    Werneck, RF
    [J]. MATHEMATICAL PROGRAMMING, 2006, 106 (03) : 491 - 511
  • [5] A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
    Santos, Fernando Afonso
    Mateus, Geraldo Robson
    da Cunha, Alexandre Salles
    [J]. TRANSPORTATION SCIENCE, 2015, 49 (02) : 355 - 368
  • [6] Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows
    Ciancio, Claudio
    Lagana, Demetrio
    Vocaturo, Francesca
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (01) : 187 - 199
  • [7] A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem
    Martinelli, Rafael
    Pecin, Diego
    Poggi, Marcus
    Longo, Humberto
    [J]. EXPERIMENTAL ALGORITHMS, 2011, 6630 : 315 - +
  • [8] A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
    Ceselli A.
    Felipe Á.
    Ortuño M.T.
    Righini G.
    Tirado G.
    [J]. Operations Research Forum, 2 (1)
  • [9] Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
    Diarrassouba, Ibrahima
    Hadhbi, Youssouf
    Mahjoub, A. Ridha
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (04)
  • [10] A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
    Caio Marinho Damião
    João Marcos Pereira Silva
    Eduardo Uchoa
    [J]. 4OR, 2023, 21 : 47 - 71
12345