Journal Article10.1504/IJIDSS.2008.023006
Integer programming formulation for convoy movement problem
P.N. Ram Kumar,T. T. Narendran +1 more
TL;DR: LP-based lower bounds and heuristic based upper bounds were generated and used for evaluating the proposed model, particularly for large problem instances for which optimal solutions could not be obtained.
read more
Abstract: This paper reports a study of the strategic network problem of routing military convoys between specific origin and destination pairs. Known as the Convoy Movement Problem (CMP), this problem is formulated as an integer linear program. The proposed mathematical model is evaluated on the basis of average number of iterations and average CPU times. LP-based lower bounds and heuristic based upper bounds were generated and used for evaluating the proposed model, particularly for large problem instances for which optimal solutions could not be obtained.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment
TL;DR: The sample average approximation method is employed to obtain a robust solution for the route planning problem for military ground vehicles in the uncertain battlefield and shows that a sample of larger size can bring more stability to the results.
Bi-criteria Convoy Movement Problem:
TL;DR: In this article, two approaches, one based on goal programming and the other based on simulated annealing, are proposed to solve the problem of routing and scheduling military convoys adhering to certain constraints.
10
On the usage of Lagrangean Relaxation for the convoy movement problem
P.N. Ram Kumar,T. T. Narendran +1 more
TL;DR: This study considers an existing mathematical model of CMP and proposes a lower bounding procedure based on Lagrangean Relaxation, which is evaluated on a variety of test problem instances to show robustness.
9
Convoy Movement Problem – An Optimization Perspective
P.N. Ram Kumar,T. T. Narendran +1 more
- 01 Jan 2010
TL;DR: This chapter addresses the convoy movement problem (CMP) in military logistics, which involves routing and scheduling military convoys within the strategic constraints.
8
New approaches for solving the convoy movement problem
TL;DR: This paper adapt and enhance existing formulations of the CMP in such a way that the generalised version can also be modelled, and proposes new approaches for solving large instances of thegeneralised CMP.
7
References
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
- 01 Jan 2001
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
4.2K
The Lagrangian Relaxation Method for Solving Integer Programming Problems
TL;DR: This paper is a review of Lagrangian relaxation based on what has been learned in the last decade and has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering.
2.4K
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held,Richard M. Karp +1 more
TL;DR: It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers.
1.5K
The traveling-salesman problem and minimum spanning trees: Part II
Michael Held,Richard M. Karp +1 more
TL;DR: An efficient iterative method for approximating this bound closely from below is presented, and a branch-and-bound procedure based upon these considerations has easily produced proven optimum solutions to all traveling-salesman problems presented to it.
1.1K
A Survey of Optimization Models for Train Routing and Scheduling
TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
842