Title
Petri net representation for 0-1 integer programming problems
Abstract
Petri net is a mathematical modeling tool that represents wide variety of discrete event systems. Given an initial marking and final marking for a Petri net, an optimal firing sequence problem is defined as the problem to And an optimal transition sequence to minimize the objective function. For the purpose of analysis of 0-1 integer programming problems, we propose a general algorithm to convert general 0-1 integer programming problem into an optimal firing sequence problem of Petri net. By utilizing the proposed algorithm, general 0-1 integer programming problems can be visualized and analyzed by Petri net theory. The property of solutions derived by solving the original 0-1 integer programming and the optimal firing sequence problem is discussed. The solution of 0-1 integer programming problem and that of the optimal firing sequence problem of Petri net are compared. The results show that the solutions for both problems are identical for traveling salesman problem and vehicle routing problems.
Year
DOI
Venue
2014
10.1109/IEEM.2014.7058734
Industrial Engineering and Engineering Management
Keywords
Field
DocType
Petri nets,integer programming,sequences,travelling salesman problems,vehicle routing,0-1 integer programming problem,Petri net representation,Petri net theory,discrete event systems,final marking,initial marking,objective function minimization,optimal firing sequence problem,optimal transition sequence,traveling salesman problem,vehicle routing problems,0-1 integer programming problem,Petri nets,discrete event systems,optimal firing sequence problem,traveling salesman problem,vehicle routing problems
Mathematical optimization,Vehicle routing problem,Petri net,Stochastic Petri net,Integer programming,Travelling salesman problem,Cutting stock problem,2-opt,Mathematics,Covering problems
Conference
ISSN
Citations 
PageRank 
2157-3611
1
0.36
References 
Authors
4
2
Name
Order
Citations
PageRank
Akito Kodama110.36
Tatsushi Nishi215621.84