Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs
From MaRDI portal
Publication:3055383
DOI10.1080/00207540701846244zbMath1198.90061OpenAlexW2164163287MaRDI QIDQ3055383
Kenichi Shimatani, Tatsushi Nishi, Masahiro Inuiguchi
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701846244
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)
Related Items
A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts, Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda, Petri net representation and reachability analysis of 0--1 integer linear programming problems
Cites Work
- Survey of research in the design and control of automated guided vehicle systems
- Coloured timed Petri net model for real-time control of automated guided vehicle systems
- Conflict-free shortest-time bidirectional AGV routeing
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model
- Decomposition in automatic generation of Petri nets for manufacturing system control and scheduling
