On the formulation and solution of the convoy routing problem
In this work, we will identify important variables that contribute to vehicular movement in an emergency environment. In particular, we formulate and pose the convoy routing problem. We suggest a method for modeling the problem and formulate a precise problem statement that significantly reduces the number of variables under consideration relative to similar previous work; even so, we prove that the decision version of this problem is NP-complete. After devising an algorithm using artificial intelligence techniques, we then empirically analyze this model (via software simulation) to get computational results on a single instance of the problem.
Volume (Year): 46 (2010)
Issue (Month): 4 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:4:p:520-533. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.