Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs
Year of publication: |
2009
|
---|---|
Authors: | Nishi, Tatsushi ; Shimatani, Kenichi ; Inuiguchi, Masahiro |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 47.2009, 14 (15.7.), p. 3957-3977
|
Subject: | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Speeding up Martins' algorithm for multiple objective shortest path problems
Demeyer, Sofie, (2013)
- More ...
-
Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs
Nishi, Tatsushi, (2009)
-
Two-level decomposition algorithm for crew rostering problems with fair working condition
Nishi, Tatsushi, (2014)
-
Nishi, Tatsushi, (2010)
- More ...