Heuristic Methods for the Battlefield Distribution Network

Abstract

Keywords

• -

Heuristic Methods for the Battlefield Distribution Network

Abstract

Biz bu çalışmada muharebe alanında düşmanla temas hâlinde bulunan birliklerin mühimmat ihtiyaçlarının ihtiyaç duyulan yer ve zamanda, doğru miktarlarda karşılanmasını ihtiva eden bir lojistik problem üzerinde çalıştık. Bu problemle ilgili bir matematiksel model literatürde mevcuttur. Biz bu modeli temel alarak birincisi “önce rotalama-sonra yerleşim” ve ikincisi “önce yerleşim-sonra rotalama” olan modele özel ve üç safhadan oluşan iki sezgisel yöntem geliştirdik. Test sonuçları birinci metodun ikinci metoddan daha başarılı olduğunu ve karmaşık gerçek yaşam problemlerinin makul zamanlar içerisinde çözülebileceğini göstermektedir

Keywords

• Ağ tasarımı, Yer seçimi ve yol atama problemi, Lojistik, Dağıtım, Sezgisel yöntemler

References

1. Barreto, S., Ferreira, C., Paixao, J. and Santos, B. S., 2007. Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179: 968–977.
2. Laporte, G. and Nobert, Y., 1981, An exact algorithm for minimizing routing and operating costs in depot location. European Journal of Operational Research, 6: 224–226.
3. Laporte, G., Nobert, Y. and Arpin, D., 1986, An exact algorithm for solving capacitated location-routing problem. Annals of Operations Research, 6: 293–310.
4. Laporte, G., Nobert, Y. and Taillefer, S., 1988, Solving a family of multi- depot vehicle routing and location-routing problems. Transportation Science, 22 (3): 161–172.
5. Laporte, G. and Dejax, P.J., Dynamic location-routing problems. Journal of the Operational Research Society, 40 (5): 471–482.
6. Melechovsky, J., Prins, C. and Calvo, R. W., 2005. A metaheuristic to solve location-routing problem with non-linear costs. Journal of Heuristics, 11: 375–391.
7. Min, H., Jayaraman, V. and Srivastava, R., 1998. Combined location- routing problems: A synthesis and future research directions. European Journal of Operational Research, 108: 1–15.
8. Nagy, G. and Salhi, S., 2007. Location-routing: Issues, models and methods. European Journal of Operational Research, 177: 649– 672.

9. Nambiar, J. M., Gelders, L. F. and Wassenhove, L. N. V., 1989. Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study. European Journal of Operational Research, 38: 14–26.
10. Or, I. and Pierskalla, W. P., 1979. A transportation location-allocation model for regional blood banking. AIIE Transactions, 11 (2): 86–95.
11. Perl, J. and Daskin, M. S., 1985. A warehouse location-routing problem. Transportation Research B, 19B (5): 381–396.
12. Salhi, S. and Fraser, M., Mar 1996. An integrated heuristic approach for the combined location vehicle fleet mix problem. Studies in Locational Analysis, 8: 3–21.
13. Sambola, M. A., Diaz, J. A. and Fernandez, E., 2005. A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research, 32: 407–428.
14. Schwardt, M. and Dethloff, J., 2005. Solving a continuous location-routing problem by use of a self-organizing map. International Journal of Physical Distribution and Logistics Management, 35 (6): 390– 408.
15. Toyoglu, H., Karasan, O.E. and Kara, B.Y., 2010. Distribution network design on the battlefield. Naval Research Logistics, In press, DOI 10.1002/nav.20402.