Toggle Main Menu Toggle Search

Open Access padlockePrints

Variants of the Capacitated Arc Routing Problem

Lookup NU author(s): Dr Gu Pang


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


The Capacitate Arc Routing Problem (CARP), originally proposed by Golden and Wong (1981), is a well-known combinatorial problem in which demands are associated with the edges of a graph, vehicles have limited capacity and the goal is to construct routes of total minimum distance, each starting and ending at the depot and such that the total demand serviced by a route does not exceed the vehicle capacity. Over the past decades several variants and extensions of the standard CARP have been proposed in the literature, essentially, to model more realistic real life situations. These variants include: the stochastic CARP, the CARP with time windows, the CARP with time-dependant service costs, the periodic CARP, the bi-objective CARP, the CARP with intermediate facilities, the split delivery CARP and the multi-compartment CARP. The purpose of this presentation is to provide an overview of these CARP variants, together with a flavour of the solution techniques and algorithms that have been proposed to solve these problems.

Publication metadata

Author(s): Pang G, Muyldermans L

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: OR54: OR Annual Conference

Year of Conference: 2012