A hybrid tabu search for the multi-depot vehicle routing problem is considered in this paper. The purpose of the
proposed approach is to decrease the number of used vehicles and the total travel cost. An extensive numerical
experiment was performed on benchmark problem instances available in literature, the computational results are
presented to show the high effectiveness and performance of the proposed approaches.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.