A short note on applying a simple LS/LNS-based metaheuristic to the rollon-rolloff vehicle routing problem

Authors:
Ulrich Derigs;Markus Pullmann;Ulrich Vogel
Affiliations:
Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany;Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany;Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany
Venue:
Computers and Operations Research
Year:
2013

Citing 7
Cited 0

New optimization heuristics

Journal of Computational Physics
Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries

The vehicle routing problem
The Rollon--Rolloff Vehicle Routing Problem

Transportation Science
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum

Quantified Score

Hi-index	0.01

Visualization

Abstract

The rollon-rolloff vehicle routing problem (RRVRP) arises when tractors move containers or trailers between locations generating a high volume of waste like construction sites, etc., and a disposal facility. It can be formulated as a node routing problem with asymmetric arc cost and a maximum route length. In this paper we show that a simple and flexible approach which combines standard local search and large neighborhood search moves under two parameter-free/-poor metaheuristic controls outperforms special purpose developments published in the literature. Our results are obtained by customizing a RRVRP-solver from a framework developed for solving rich vehicle routing problem variants.