A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
type: Item
instance of: scholarly article
title: A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
zbMATH Open document ID: 1407.90378
DOI: 10.1155/2014/152494
author: Xuhao Zhang
author: Shiquan Zhong
author: Yiliu Liu
author: Xuelian Wang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7015797
Wikidata QID: Q59063263
describes a project that uses: BoneRoute
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/152494
OpenAlex ID: W2128572051
cites work: Integrated machine scheduling and vehicle routing with time windows
cites work: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
cites work: Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
cites work: Waste collection vehicle routing problem with time windows
cites work: A multiple server location-allocation model for service system design
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: On the complexity of the \(k\)-customer vehicle routing problem
cites work: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
cites work: On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
cites work: The vehicle routing problem with flexible time windows and traveling times
cites work: Implementing vehicle routing algorithms
cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
cites work: A heuristic and lower bound for a multi-depot routing problem
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: A tabu search heuristic for the multi-depot vehicle routing problem
cites work: The multi-depot vehicle routing problem with inter-depot routes
cites work: Heuristic solutions to multi-depot location-routing problems
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
description: scientific article; zbMATH DE number 7015797