Abstract
Article history: Received 15 July 2011 Received in revised form September, 20, 2011 Accepted 26 September 2011 Available online 29 September 2011 In this paper, we study a supply chain problem where a whole seller/producer distributes goods among different retailers. The proposed model of this paper is formulated as a more general and realistic form of traditional vehicle routing problem (VRP). The main advantages of the new proposed model are twofold. First, the time window does not consider any lower bound and second, it treats setup time as separate cost components. The resulted problem is solved using a hybrid of particle swarm optimization and simulated annealing (PSO-SA). The results are compared with other hybrid method, which is a combination of Ant colony and Tabu search. We use some well-known benchmark problems to compare the results of our proposed model with other method. The preliminary results indicate that the proposed model of this paper performs reasonably well. © 2012 Growing Science Ltd. All rights reserved
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 callMore From: international journal of industrial engineering computations
Disclaimer: 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.
