A hybrid approach to convoy movement planning in an urban city
Conference Proceeding Article
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.
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IAAI '08: Proceedings of the 20th National Conference on Innovative Applications of Artificial Intelligence: 13-17 July 2008
City or Country
Thangarajoo, Ramesh; Agussurja, Lucas; and LAU, Hoong Chuin.
A hybrid approach to convoy movement planning in an urban city. (2008). IAAI '08: Proceedings of the 20th National Conference on Innovative Applications of Artificial Intelligence: 13-17 July 2008. 1738-1744. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/370
This document is currently not available here.