| Article ID: | iaor20112527 |
| Volume: | 62 |
| Issue: | 4 |
| Start Page Number: | 722 |
| End Page Number: | 728 |
| Publication Date: | Apr 2011 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Narendran T T, Ram Kumar P N |
| Keywords: | vehicle routing & scheduling |
The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained.