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 条
12345