Highlights We study a split-delivery mixed capacitated arc-routing problem. We analyze nice properties to improve the efficiency of the heuristic algorithm. A forest-based tabu search algorithm is proposed to solve the problem.
Abstract Motivated by practical applications such as the water sprinkling services of urban administration bureaus in big cities, we study a split-delivery mixed capacitated arc-routing problem. In this problem, a fleet of capacitated vehicles need to serve a set of arcs/edges in a split delivery manner by traversing a mixed graph. We provide a mathematical formulation and analyze some properties of the problem that could be utilized to accelerate the search process of a meta-heuristic algorithm. A forest-based tabu search algorithm is proposed to efficiently solve the problem. Numerical experiments show that our algorithm can quickly produce high quality solutions compared with the state-of-the-art approaches. In addition, we analyze how different patterns of a mixed graph affect the quality of solutions.
The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach
2019-09-27
22 pages
Article (Journal)
Electronic Resource
English
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
British Library Online Contents | 2006
|A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Online Contents | 2006
|A tabu search-based heuristic for a new capacitated cyclic inventory routing problem
BASE | 2014
|A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem
Online Contents | 2014
|