Abstract
Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is one of the major logistics problems In this paper a two phase heuristics is proposed in which the customers are assigned to the depot in the first phase The routes are constructed with modified ant colony optimisation procedure and are improved using 2-Opt procedure in phase two The proposed heuristic has been applied to Cordeau MDVRPTW benchmark problems It is found that the proposed heuristic gives promising and better results, on an average, as compared to those solutions given by the existing heuristic for the MDVRPTW.
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.
