Please use this identifier to cite or link to this item:
|Title:||A hybrid approach to convoy movement planning in an urban city||Authors:||Thangarajoo, R.
|Issue Date:||2008||Citation:||Thangarajoo, R.,Agussurja, L.,Lau, H.C. (2008). A hybrid approach to convoy movement planning in an urban city. Proceedings of the National Conference on Artificial Intelligence 3 : 1738-1744. ScholarBank@NUS Repository.||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. Copyright © 2008.||Source Title:||Proceedings of the National Conference on Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/112995||ISBN:||9781577353683|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.