Abstract
In the classical production-distribution centers problem, only assignment of customers, distribution centers, and suppliers is determined. This paper extends the problem of production-distribution centers assignment by considering sequencing decisions in the supply network. Nowadays, meeting delivery time of products is a competitive benefit; therefore, the objective is to minimize total tardiness. This problem is mathematically formulated by a mixed integer programming model. Then, using the proposed model, small instances of the problem can be optimally solved by GAMS software. Moreover, two metaheuristics based on variable neighborhood search and simulated annealing are proposed to solve large instances of the problem. Finally, performance of the proposed metaheuristics is evaluated by two sets of balanced and unbalanced instances. The computational results show the superiority of the variable neighborhood search algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
