Petri net representation and reachability analysis of 0-1 integer linear programming problems

被引：4

作者：

Kodama, Akito ^{[1
]}

Nishi, Tatsushi ^{[1
]}

机构：

[1] Osaka Univ, Dept Syst Innovat, Div Math Sci Social Syst, Grad Sch Engn Sci, 1-3 Machikaneyama, Toyonaka, Osaka 5608531, Japan

来源：

INFORMATION SCIENCES | 2017年 / 400卷

关键词：

Discrete event systems; Petri net; 0-1 integer linear programming problem; Optimal transition firing sequence problems; Reachability analysis; AGV systems; AUTOMATED GUIDED VEHICLES; FLEXIBLE MANUFACTURING SYSTEMS; OPTIMAL SUPERVISORY CONTROL; DEADLOCK PREVENTION POLICY; DECOMPOSITION APPROACH; AGV SYSTEMS; AVOIDANCE; SIPHONS; MODEL;

D O I：

10.1016/j.ins.2017.03.014

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we investigate a general algorithm for converting the 0-1 integer linear programming problem (0-1IP) into an optimal transition firing sequence problem (OFSP) of a Petri net (PN). The general 0-1IP can be visualized graphically and then analyzed using the PN theory after application of our proposed conversion algorithm. The proposed algorithm is applied to a traveling salesman problem, a vehicle routing problem and an automated guided vehicles (AGV) routing problem. A PN reduction technique is employed to reduce the size of the PN. Valid inequalities are derived using reachability analysis of the converted PN model. These inequalities are imposed on the original 0-1IP. Computational results show that the total computational time for solving an AGVRP with the valid inequalities derived using the reachability analysis is significantly reduced. (C) 2017 Elsevier Inc. All rights reserved.

引用

页码：157 / 172

页数：16

共 50 条

[31] Synthesis of Thinned Planar Arrays Using 0-1 Integer Linear Programming Method
Wang, Mingyu
Ping, Xuewei
APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL, 2022, 37 (02): : 191 - 198
[32] Optimization algorithm of military airlift loading based on 0-1 integer linear programming
Meng C.
Song H.
Chen B.
Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2011, 46 (03): : 500 - 505
[33] Optimizing model of the redeposit direction - The special 0-1 linear integer programming problem
Gao, Tian
Wang, Meng-Guang
Tang, Li-Xin
Song, Jian-Hai
Kongzhi yu Juece/Control and Decision, 2001, 16 (SUPPL.): : 705 - 708
[34] THE SOLUTION OF LARGE 0-1 INTEGER PROGRAMMING-PROBLEMS ENCOUNTERED IN AUTOMATED CARTOGRAPHY
ZORASTER, S
OPERATIONS RESEARCH, 1990, 38 (05) : 752 - 759
[35] APPLICATION OF 0-1 INTEGER PROGRAMMING TO MULTI-TARGET TRACKING PROBLEMS - COMMENT
BAILEY, FN
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1979, 24 (01) : 142 - 143
[36] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM
GLOVER, F
WOOLSEY, E
OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182
[37] Quantitative stability analysis for vector problems of 0-1 programming
Emelichev, Vladimir
Podkopaev, Dmitry
DISCRETE OPTIMIZATION, 2010, 7 (1-2) : 48 - 63
[38] Application of Linear Programming for Analysis of Petri Net
Dylewski, Robert
Adamski, Marian
Jablonski, Janusz
PRZEGLAD ELEKTROTECHNICZNY, 2011, 87 (11): : 159 - 163
[39] APPROACH TO LINEAR PROGRAMMING WITH 0-1 VARIABLES
SENJU, S
TOYODA, Y
MANAGEMENT SCIENCE, 1968, 15 (04) : B196 - B207
[40] Codon optimization by 0-1 linear programming
Arbib, Claudio
Pinar, Mustafa C.
Rossi, Fabrizio
Tessitore, Alessandra
COMPUTERS & OPERATIONS RESEARCH, 2020, 119

← 1 2 3 4 5 →