Highlights Granular Tabu Search for the static Dial-a-Ride Problem. Optimization of number of passengers served, quality of service and operation costs. Granular neighborhood constructed by solving an assignment problem. Good results in 2–3min of computation time.
Abstract In a Dial-a-Ride system, a fleet of vehicles without fixed routes and schedules carries people from their pick-up point to their delivery point. Pre-specified time windows must be respected, and service levels for passengers as well as operation costs should be optimized. The resulting routing and scheduling problem is -hard and can be modeled by a mixed integer linear programming formulation. In this paper, we propose a Granular Tabu Search algorithm for the static Dial-a-Ride Problem with the objective of producing good solutions in a short amount of time (up to 3min). We evaluate the algorithm on test instances from the literature. Our new algorithm performs well in comparison with a classical Tabu Search algorithm, a Genetic Algorithm, and a Variable Neighborhood Search.
A Granular Tabu Search algorithm for the Dial-a-Ride Problem
Transportation Research Part B: Methodological ; 56 ; 120-135
2013-07-30
16 pages
Article (Journal)
Electronic Resource
English
A Granular Tabu Search algorithm for the Dial-a-Ride Problem
Online Contents | 2013
|A tabu search heuristic for the static multi-vehicle dial-a-ride problem
Elsevier | 2002
|A tabu search heuristic for the static multi-vehicle dial-a-ride problem
Online Contents | 2003
|