Abstract
On the basis of describing the vehicle routing problem of multi-vehicle in single parking with time windows, this paper sets up the model of the based on natural description. Then this paper sets up a tabu search (TS) algorithm for the problem by presenting a new solution indicating method. The dynamical taboo list is used in TS algorithm, in another words, the length of taboo list is unfixed. In order to control the length of the taboo list, taboo list is designed by chain structure in this algorithm, we can insert a new taboo object at the rail, when the number of taboo objects beyond the length of taboo list, we should remove outdated taboo object from the head of taboo list. The pseudo-code of TS algorithm is presented and makes some experimental computation to transportation net with 21 nodes. The computational results demonstrates that the high quality solutions to the vehicle routing problem of multi-vehicle with time windows limits in single parking can be obtained by using the TS algorithm, and the new algorithm is also efficient and robust.
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.
