A hybrid approach to convoy movement planning in an urban city

Publication Type

Conference Proceeding Article

Publication Date

7-2008

Abstract

In this paper, we consider a high-fidelity Convoy Movement Problem motivated by the coordination and routing of convoys within a road transportation network in an urban city. It encompasses two classical combinatorial optimization problems - vehicle routing and resource constrained scheduling. We present an effective hybrid algorithm to dynamically manage the movement of convoys, where we combine the standard Dijkstra’s shortest-path algorithm with constraint programming techniques. The effectiveness of the algorithm is illustrated with testing on varying problem sizes and complexity.

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Publication

IAAI '08: Proceedings of the 20th National Conference on Innovative Applications of Artificial Intelligence: 13-17 July 2008

First Page

1738

Last Page

1744

ISBN

9781577353683

Publisher

AAAI Press

City or Country

Chicago, IL

This document is currently not available here.

Share

COinS