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

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.

Research on Improved NSGA-II Algorithm and Its Application in Emergency Management

“…Tabu search algorithm [20] is a generalization of the local search method that has been successfully applied to a wide class of hard optimization problems. It is a global optimization algorithm which can avoid falling into the local optimal solution by forbidding duplicate search.…”

Reliability Optimization and Importance Analysis of Circular‐Consecutive k‐out‐of‐n System

“…Problem-independent technique is used to solve various complex problems, such as genetic algorithm [22], simulated annealing algorithm [23], particle swarm optimization [24], tabu search algorithm [25], and neural net algorithm [26]. The research of combining metaheuristics with importance measure is also developed to solve CAP.…”

Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

“…The main challenge of these metaheuristics is to solve large combinatorial optimization problems in an adequate time period. Different authors have used metaheuristic algorithms to solve VRP: local search [24], simulated annealing [25], greedy randomized adaptive search procedure (GRASP) [26], swarm intelligence [27], tabu search (TS) [28,29], genetic algorithms [30], colony optimization [31], reactive search [32], and maximum coverage [33].…”