Petri net representation for 0-1 integer programming problems

Akito Kodama, Tatsushi Nishi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationIEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management
PublisherIEEE Computer Society
Pages729-733
Number of pages5
ISBN (Electronic)9781479964109
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014 - Selangor, Malaysia
Duration: Dec 9 2014Dec 12 2014

Publication series

NameIEEE International Conference on Industrial Engineering and Engineering Management
Volume2015-January
ISSN (Print)2157-3611
ISSN (Electronic)2157-362X

Conference

Conference2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014
CountryMalaysia
CitySelangor
Period12/9/1412/12/14

Keywords

  • 0-1 integer programming problem
  • discrete event systems
  • optimal firing sequence problem
  • Petri nets
  • traveling salesman problem
  • vehicle routing problems

ASJC Scopus subject areas

  • Business, Management and Accounting (miscellaneous)
  • Industrial and Manufacturing Engineering
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Petri net representation for 0-1 integer programming problems'. Together they form a unique fingerprint.

Cite this