Decomposition of petri nets and lagrangian relaxation for solving routing problems for AGVs

International Journal of Production Research

Volumn 47, Issue 14, 2009, Pages 3957-3977

  Nishi, Tatsushi ^a   Shimatani, Kenichi ^a   Inuiguchi, Masahiro ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Automated guided vehicles; Decomposition; Lagrangian relaxation; Petri nets; Routing

Indexed keywords

AUTOMATED GUIDED VEHICLES; DIJKSTRA'S ALGORITHMS; DUALITY GAP; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATION METHOD; OPTIMAL TRANSITION; OPTIMALITY; OPTIMISATIONS; PENALTY FUNCTION METHODS; ROUTING PROBLEMS; SUBNETS; TIMED PETRI NET;

GRAPH THEORY; LAGRANGE MULTIPLIERS; LARGE EDDY SIMULATION; PETRI NETS; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 70449637513     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701846244     Document Type: Article

References (18)

1. Dotoli, M. and Fanti, M.P., 2004. Coloured timed Petri net model for real-time control of automated guided vehicle systems. International Journal of Production Research, 42 (9), 1787-1813.
2. Fisher, M.L., 1981. The Lagrangian relaxation method for solving integer programming problems. Management Science, 27 (1), 1-18.
3. He, D.W., Strege, B., Tolle, H., and Kusiak, A., 2000. Decomposition in automatic generation of Petri nets for manufacturing system control and engineering. International Journal of Production Research, 38, 1437-1457.
4. Kim, C.W. and Tanchoco, J.M.A., 1991. Conflict-free shortest-time bidirectional AGV routing. International Journal of Production Research, 29 (12), 2377-2391.
5. Lee, D.Y. and Di Cesare, F., 1994. Scheduling flexible manufacturing systems using Petri nets and heuristic search. IEEE Transactions on Robotics and Automation, 10, 123-132.
6. Moro, A.R., Yu, H., and Kellehr, G., 2002. Hybrid heuristic search for the scheduling of flexible manufacturing systems using Petri nets. IEEE Transactions on Robotics and Automation, 18, 240-244.
7. Nishi, T., Ando, M., and Konishi, M., 2005a. Distributed route planning for multiple mobile robots using an augmented Lagrangian decomposition technique. IEEE Transactions on Robotics, 21, 1191-1200.
8. Nishi, T., Ando, M., and Konishi, M., 2005b. Experimental studies on a local rescheduling procedure for dynamic routing of autonomous decentralized AGV systems. Robotics and Computer-Integrated Manufacturing, 22 (2), 154-165.
9. Nishi, T. and Maeno, R., 2006. Decomposition of Petri nets for optimization of discrete event systems - application to routing problem for automated guided vehicles. In: Proceedings of the 2006 IEEE international conference on automation science and engineering, 246-251.
10. Nishi, T. and Maeno, R., 2007. Petri net modeling and decomposition method for solving scheduling problems, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 262-271.
11. Teng, S.H. and Zhang, J., 1993. A Petri net-based decomposition approach in modelling of manufacturing systems. International Journal of Production Research, 31, 1423-1439.
12. Vis, I.F.A., 2006. Survey of research in the design and control of automated guided vehicle systems. European Journal of Operational Research, 170, 677-709.
13. Viswanadham, N., Narahari, Y., and Johnson, T.L., 1990. Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models. IEEE Transactions on Robotics and Automation, 6 (6), 713-723.
14. Watanabe, T., Mizobata, Y., and Onaga, K., 1989. Legal firing sequences and minimum initial marking for Petri nets. Research Report for Information Processing Society of Japan. Algorithm, 5 (10), 71-78.
15. Wu, N.Q. and Zeng, W., 2002. Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model. International Journal of Production Research, 40 (1), 223-238.
16. Wu, N.Q. and Zhou, M., 2003. AGV routing for conflict resolution in AGV systems. In: Proceedings of the 2003 IEEE international conference on robotics and automation, 1428-1433.
17. Wu, N.Q. and Zhou, M., 2005. Modeling and deadlock avoidance of automated manufacturing systems with multiple automated guided vehicles. IEEE Transactions on Systems, Man and Cybernetics, 35 (6), 1193-1202.
18. Yamaguchi, M., Nakamura, S., and Watanabe, T., 1993. An approximation algorithm for the legal firing sequence problem of Petri nets. Research Report for Information Processing Society of Japan. Algorithm, 33 (3), 17-24.