|
چکیده
|
Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA) to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.
|