The problem of routing and scheduling military convoys adhering to certain constraints is known as the convoy movement problem. This work addresses a bi-criteria model for the peacetime version of the convoy movement problem with minimizing total travel time and travel span as objectives. Two approaches, one based on goal programming and the other based on simulated annealing, are proposed. Encouraging results have been obtained.
Chardaire P. , McKeown G P., Harrison S A., Richardson S B.Solving a time-space network formulation for the convoy movement problem. Operat. Res. 2005; 53: 219-230
2.
Batta R., Krishnamurthy N., Karwan M H.Developing conflict-free routes for automated guided vehicles. Operat. Res. 1993; 41: 1077-1090
3.
Bovet J., Constantin C., De Werra D.A convoy scheduling problem. Discrete Appl. Math. 1991; 30: 1-14
4.
Iakovou E., Douligeris C., Li H., Yudhbir L.A maritime global route model for hazardous materials. Transp. Sci. 1999; 33: 34-48
5.
Higgins A., Kozan E., Ferriera L.Optimal scheduling of trains on a single line track. Transp. Res. Part B1996; 30: 147-161
6.
Schank J., Mattock M., Sumner G., Greenberg I., Rothenberg J., Stucker J.P.A review of strategic mobility models and analysis. Santa Monica, CA: Rand Corporation, 1991 , Report R-3926-JS.
7.
McKinzie K., Barnes J W.A review of strategic mobility models supporting the defense transportation system. Math. Comput. Model. 1993; 39: 839-868
8.
Lee Y.N., McKeown G.P., Rayward-Smith, V.J.The convoy movement problem with initial delays. In: Rayward-Smith V J, Osman I H, Reeves C R, Smith G D (eds) Modern heuristic search methods. Chichester, UK: John Wiley, 1996 , pp. 213-233
9.
Dijkstra E.W.A note on two problems in connection with graphs . Numer. Math. 1959; 1: 269-271
10.
Tuson A L., Harrison S A.Problem difficulty of real instances of convoy planning. J. Operat. Res. Soc. 2005; 56: 763-775
11.
Ram Kumar P.N. , Narendran T.T.A mathematical approach for variable speed convoy movement problem. Def. Secur. Anal. 2009; 25: 137-155
12.
Ram Kumar P.N. , Narendran T.T.Integer programming formulation for convoy movement problem. Int. J. Intell. Def. Support Syst. 2008; 1: 177-188
13.
Varadharajan T.K., Rajendran C.A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur. J. Operat. Res. 2005; 167: 772-795
