Logistic considers all functions of checking, researching, requirement in the field of facilities, machines, tools, instalation and all the actions which is in relation with supply, Production, maintenance, warehousing, distribution, transportation and making decision. One of the important topics of study in the past decades which as a lot of usage in transportation systems is vehicle routing problem.
This is the basic problem in distribution management. In this research kinds of vehicle routing problem problem have been presented in the field of merchandising, therfore a new mixed integer linear programming model is presented by objective maximizing covering emergency demands.
In this research, the main topic is concentrate on different methods of solving Vehicle Routing Problem that consist Heuristic and Meta-Heuristic.
For validated the presented model, it coded in the GAMS software and an example which is generated has been solved with this software. In the continue to present efficient results an approach has been designed to solved mixed based on simulated annealing algorithm and neighborhood search.
In the end, efficient present presented algorithm has been shown in the study of some benchmark
Fath Abadi H, aghamohammadi S, Sahihi H. How to decide on logistics and support forces on the battlefield in one of the defense organizations. C4I Journal 2021; 5 (2) :1-9 URL: http://ic4i-journal.ir/article-1-236-en.html