| A simulation-based algorithm for supply chain optimization |
| Full text |
Pdf
(658 KB)
|
| Source
|
Winter Simulation Conference
archive
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
table of contents
Washington D.C.
SESSION: Transportation and supply chain applications: simulation-based supply chain optimization
table of contents
Pages 1924-1931
Year of Publication: 2007
ISBN:1-4244-1306-0
|
|
Authors
|
|
Takayuki Yoshizumi
|
IBM Research, Tokyo Research Laboratory, Shimo-tsuruma, Yamato-shi, Kanagawa, Japan
|
|
Hiroyuki Okano
|
IBM Research, Tokyo Research Laboratory, Shimo-tsuruma, Yamato-shi, Kanagawa, Japan
|
|
| Sponsors |
|
| Publisher |
IEEE Press
Piscataway, NJ, USA
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 52, Citation Count: 0
|
|
|
ABSTRACT
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as optimization problems, and algorithms have been proposed for each problem. It is difficult, however, to design an algorithm for optimizing a supply chain simultaneously because the problem is much more complex than the individual problems. We present a simulation-based optimization algorithm that optimizes a supply chain, exploiting both simulation and optimization techniques. This system leverages two existing algorithms, and will optimize a supply chain by executing simulations while changing the boundary conditions between the two algorithms. Experimental results show that a better solution to a supply chain can be found through a series of optimization simulations. A logistics consultant was satisfied with the solution. This system will be used in actual logistics consulting services.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Beasley, J. E. 1993. Lagrangean heuristics for location problems. European Journal of Operational Research (65): 383--399.
|
| |
3
|
Crainic, T. G., and J. Roy. 1992. Design of regular intercity driver routes for the ltl motor carrier industry. Transportation Science (26): 280--295.
|
| |
4
|
Hidaka, K., and H. Okano. 2003. An approximation algorithm for a large-scale facility location problem. Algorithmica 35:216--224.
|
| |
5
|
Katayama, N., and S. Yurimoto. 2002. The load planning problem for less-than-truckload motor carriers and a solution approach. In Proceedings of the 7th International Symposium on Logistics, 567--572.
|
| |
6
|
|
 |
7
|
David B. Shmoys , Éva Tardos , Karen Aardal, Approximation algorithms for facility location problems (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.265-274, May 04-06, 1997, El Paso, Texas, United States
[doi> 10.1145/258533.258600]
|
| |
8
|
Vicente, L. N., and P. H. Calamai. 1994. Bilevel and multilevel programming: a bibliography review. Journal of Global Optimization (5): 291--306.
|
|