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 条

[21] Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem
Adamo, Tommaso
Ghiani, Gianpaolo
Greco, Pierpaolo
Guerriero, Emanuela
IEEE ACCESS, 2023, 11 : 2001 - 2011
[22] Ant Colony Optimization for Time-Dependent Travelling Salesman Problem
Tomanova, Petra
Holy, Vladimir
2020 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE (ISMSI 2020), 2020, : 47 - 51
[23] Facets and valid inequalities for the time-dependent travelling salesman problem
Jose Miranda-Bront, Juan
Mendez-Diaz, Isabel
Zabala, Paula
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) : 891 - 902
[24] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM
GARFINKEL, RS
OPERATIONS RESEARCH, 1973, 21 (01) : 340 - 343
[25] Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem
Salman, Raad
Ekstedt, Fredrik
Damaschke, Peter
OPERATIONS RESEARCH LETTERS, 2020, 48 (02) : 163 - 166
[26] SOLVING THE TRAVELLING SALESMAN PROBLEM USING THE BRANCH AND BOUND METHOD
Mataija, Mirta
Segic, Mirjana Rakamaric
Jozic, Franciska
ZBORNIK VELEUCILISTA U RIJECI-JOURNAL OF THE POLYTECHNICS OF RIJEKA, 2016, 4 (01): : 259 - +
[27] Solving Standard Traveling Salesman Problem and Multiple Traveling Salesman Problem by Using Branch-and-Bound
Saad, Shakila
Jaafar, Wan Nurhadani Wan
Jamil, Siti Jasmida
PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM20): RESEARCH IN MATHEMATICAL SCIENCES: A CATALYST FOR CREATIVITY AND INNOVATION, PTS A AND B, 2013, 1522 : 1406 - 1411
[28] A branch-and-bound algorithm for the cell formation problem
Utkina, Irina E.
Batsyn, Mikhail V.
Batsyna, Ekaterina K.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3262 - 3273
[29] A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny
Pesch, Erwin
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 174 - 184
[30] An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading
Carrabs, Francesco
Cerulli, Raffaele
Cordeau, Jean-Francois
INFOR, 2007, 45 (04) : 223 - 238

← 1 2 3 4 5 →