Solving distribution problem in the most cost effective

Supply chain management (SCM) is one of the most important, strategic aspects of operations management because it encompasses so many related functions. Whom to buy materials from, where to locate facilities, how to transport goods and how to distribute them in the most cost effective. Manufacturing and distribution centers receive the information and they configure production and delivery processing and schedules accordingly. Scheduling the deliveries from regional distribution center (RDC) to large stores includes every possible vehicle routing complexity. So, many companies are trying to solve their distribution problems whether using commercial packages or by designing specific algorithm. In this paper we focus on the distribution problem faced by one largest retailers in the distribution and sale of goods in the U.K. a metaheuristics algorithm has been developed to speed up the process. The solution produced by the algorithm is compared with the output of commercial package. Also we explain what should be the actual trends of the vehicle routing scheduling computer packages.

کلیدواژه ها:

supply chain management ، vehicle routing ، metaheuristics algorithm