You are here

MUHAREBE SAHASI DAĞITIM SİSTEMİ İÇİN SEZGİSEL YÖNTEMLER

HEURISTIC METHODS FOR THE BATTLEFIELD DISTRIBUTION NETWORK

Journal Name:

Publication Year:

Author NameUniversity of Author
Abstract (2. Language): 
In this paper, we study a logistics problem in which ammunition requirements of the combat units, which are located in the battlefield and engaged with the enemy, are to be satisfied in the right amount when and where they are needed. A mathematical programming model was already given for this problem in the literature. Based on this mathematical model we developed two model-based three-phase heuristic methods of which the first one is a “routing first-location second method”, and the second a “location first-routing second” heuristic method. The computational results show that the first method outperforms the second one and complex real world problems can be solved in reasonable times.
Abstract (Original Language): 
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.
1-16

REFERENCES

References: 

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.
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.
Laporte, G., Nobert, Y. and Arpin, D., 1986, An exact algorithm for solving
capacitated location-routing problem. Annals of Operations
Research, 6: 293–310.
Laporte, G., Nobert, Y. and Taillefer, S., 1988, Solving a family of multidepot
vehicle routing and location-routing problems. Transportation
Science, 22 (3): 161–172.
Laporte, G. and Dejax, P.J., Dynamic location-routing problems. Journal of
the Operational Research Society, 40 (5): 471–482.
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.
Min, H., Jayaraman, V. and Srivastava, R., 1998. Combined locationrouting
problems: A synthesis and future research directions.
European Journal of Operational Research, 108: 1–15.
TOYOĞLU
16
Nagy, G. and Salhi, S., 2007. Location-routing: Issues, models and
methods. European Journal of Operational Research, 177: 649–
672.
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.
Or, I. and Pierskalla, W. P., 1979. A transportation location-allocation model
for regional blood banking. AIIE Transactions, 11 (2): 86–95.
Perl, J. and Daskin, M. S., 1985. A warehouse location-routing problem.
Transportation Research B, 19B (5): 381–396.
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.
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.
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.
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.

Thank you for copying data from http://www.arastirmax.com