Integer programming formulation and polyhedral results for windy collaborative arc routing problem

被引：1

作者：

Khorramizadeh, Mostafa ^{[1
]}

Shiri, Mohammad Sadegh ^{[1
]}

机构：

[1] Shiraz Univ Technol, Dept Math Sci, Shiraz, Iran

来源：

COMPUTERS & OPERATIONS RESEARCH | 2022年 / 142卷

关键词：

Routing; Arc routing problem with profits; Valid inequality; Facet inducing; Polyhedral theory; CUT ALGORITHM; BRANCH;

D O I：

10.1016/j.cor.2022.105727

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper is concerned with the collaborative uncapacitated arc routing problem on windy graphs. An integer programming formulation is presented for the problem. A new technique is presented for constructing affinely independent feasible tours and is used to examine the associated polyhedron. Moreover, some well-known valid inequalities such as path-bridge inequalities are adjusted for the problem and are proven to be facet inducing. Finally, a branch-and-cut algorithm is developed for the problem and some tables of numerical results are presented to compare and evaluate the efficiency of the presented algorithm.

引用

页数：16

共 50 条

[31] A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
Carr, Robert D.
Simonetti, Neil
[J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2021, 2021, 12707 : 458 - 472
[32] PARAMETRIC FORMULATION OF THE GENERAL INTEGER LINEAR-PROGRAMMING PROBLEM
JOSEPH, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (09) : 883 - 892
[33] An Integer Programming Formulation of the Minimum Common String Partition Problem
Ferdous, S. M.
Rahman, M. Sohel
[J]. PLOS ONE, 2015, 10 (07):
[34] An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem
Catanzaro, Daniele
Engelbeen, Celine
[J]. ALGORITHMS, 2015, 8 (04): : 999 - 1020
[35] New integer programming formulation for multiple traveling repairmen problem
Onder, Gozde
Kara, Imdat
Derya, Tusan
[J]. 19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016), 2017, 22 : 355 - 361
[36] A new integer linear programming formulation for the problem of political districting
Dugosija, Djordje
Savic, Aleksandar
Maksimovic, Zoran
[J]. ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 247 - 263
[37] Mixed Integer Linear Programming Formulation for the Taxi Sharing Problem
Ben-Smida, Houssem E.
Krichen, Saoussen
Chicano, Francisco
Alba, Enrique
[J]. SMART CITIES, SMART-CT 2016, 2016, 9704 : 106 - 117
[38] On the integer programming formulation for the relaxed restricted container relocation problem
Jin, Bo
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 281 (02) : 475 - 482
[39] Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
Li, Fulu
Lippman, Andrew
Wu, Kui
[J]. 2006 IEEE 63RD VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2006, : 1 - +
[40] Using mixed integer programming for solving the Capacitated Arc Routing Problem with Vehicle/Site Dependencies with an application to the routing of residential sanitation collection vehicles
Sniezek, John
Bodin, Lawrence
[J]. ANNALS OF OPERATIONS RESEARCH, 2006, 144 (01) : 33 - 58

← 1 2 3 4 5 →