Abstract
The Vehicle Routing Problem (VRP) by considering Time Windows is an essential and a reality optimization problem consisting in the determination of the set of routes with minimum distance to carry goods, by using some vehicles with capacity constraint; vehicles must visit customers within a time frame. In the recent years, many numbers of algorithm have been considered to solve a single objective formulate of VRPTW problem, such as Meta-heuristic, bender's decomposition, column generation and so on. This paper considers not only the minimum distance and the number of vehicles used to carry goods for customers. The customer satisfaction by considering the priority of the customers is considered which leads to service the customer as soon as possible. In this paper, the MOPSO and NSGAII approaches applied to solve the problem and then the authors compare the results of them; finally, they analysis the sensitivity of the capacity constraint for the vehicles
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 Strategic Decision Sciences
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.
