A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

A framing link (FL) based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP). Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

Cite

CITATION STYLE

APA

Zhang, X., Zhong, S., Liu, Y., & Wang, X. (2014). A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/152494

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free