Multiple-Depot Vehicle Routing Problems as a Distributed Constraint Optimization Problem

Abstract:

Article Preview

The Distributed Constraint Optimization Problem (DCOP) is able to model a variety of distributed reasoning tasks that arise in multi-agent systems, and widely applying to distribute programming, scheduling and resource allocation etc. In order to solve the multi-depot vehicle routing problem (MDVRP) in distributed manner, this article show how DCOP can be used to model the MDVRP, and using existing various DCOP algorithm solve it base on Frodo simulation platform. We have evaluated the performances of various DCOP algorithms on an existing MDVRP.

Info:

Periodical:

Edited by:

Honghua Tan

Pages:

1033-1038

DOI:

10.4028/www.scientific.net/AMM.66-68.1033

Citation:

X. M. Lei et al., "Multiple-Depot Vehicle Routing Problems as a Distributed Constraint Optimization Problem", Applied Mechanics and Materials, Vols. 66-68, pp. 1033-1038, 2011

Online since:

July 2011

Keywords:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.