A branch-and-bound algorithm for the time-dependent travelling salesman problem

被引：19

作者：

Arigliano, Anna ^{[1
]}

Calogiuri, Tobia ^{[1
]}

Ghiani, Gianpaolo ^{[1
]}

Guerriero, Emanuela ^{[1
]}

机构：

[1] Univ Salento, Dipartimento Ingn Innovaz, Lecce, Italy

来源：

NETWORKS | 2018年 / 72卷 / 03期

关键词：

branch-and-bound; lower bound; time-dependent; transportation; travelling salesman problem; vehicle routing; VEHICLE-ROUTING PROBLEMS; CUT ALGORITHM; SETUP TIMES; FORMULATIONS; COSTS;

D O I：

10.1002/net.21830

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists of finding a Hamiltonian tour of least total duration. In this paper we exploit some properties of the problem and develop a branch-and-bound algorithm which outperforms the state-of-the-art branch-and-cut procedure by Cordeau et al. [5].

引用

页码：382 / 392

页数：11

共 50 条

[1] Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
Nikolaev, Alexey
Batsyn, Mikhail
COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 311 - 322
[2] A branch-and-bound algorithm for the double travelling salesman problem with two stacks
Carrabs, Francesco
Cerulli, Raffaele
Speranza, Maria Grazia
NETWORKS, 2013, 61 (01) : 58 - 75
[3] Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
Markevich E.A.
Trushechkin A.S.
Journal of Mathematical Sciences, 2019, 241 (2) : 168 - 184
[4] A branch-and-bound algorithm for the time-Dependent rural postman problem
Calogiuri, Tobia
Ghiani, Gianpaolo
Guerriero, Emanuela
Mansini, Renata
COMPUTERS & OPERATIONS RESEARCH, 2019, 102 : 150 - 157
[5] Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem
Cordeau, Jean-Francois
Ghiani, Gianpaolo
Guerriero, Emanuela
TRANSPORTATION SCIENCE, 2014, 48 (01) : 46 - 58
[6] Effective implementation of algorithm for solving the travelling salesman problem by branch-and-bound method
Kostyuk, Yu L.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 20 (02): : 78 - 90
[7] THE TRAVELLING SALESMAN PROBLEM: IMPROVED LOWER BOUND IN THE BRANCH-AND-BOUND METHOD
Kostyuk, Y. L.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 22 (04): : 73 - +
[8] An enhanced lower bound for the Time-Dependent Travelling Salesman Problem
Adamo, Tommaso
Ghiani, Gianpaolo
Guerriero, Emanuela
COMPUTERS & OPERATIONS RESEARCH, 2020, 113 (113)
[9] Fast Branch and Bound Algorithm for the Travelling Salesman Problem
Grymin, Radoslaw
Jagiello, Szymon
COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT, CISIM 2016, 2016, 9842 : 206 - 217
[10] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
A. N. Maksimenko
Automatic Control and Computer Sciences, 2021, 55 : 816 - 826

← 1 2 3 4 5 →