On the usage of Lagrangean Relaxation for the convoy movement problem

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 proc...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2011-04, Vol.62 (4), p.722-728
Main Authors: Ram Kumar, P N, Narendran, T T
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Business and Management
conflicts
Exact sciences and technology
Heuristics
Integer programming
Lagrange multipliers
Lagrangean Relaxation
Lagrangian function
Logistics
Management
Mathematics
military convoys
Militia movements
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Origin and destination
Roads & highways
scheduling
Theoretical Paper
Theoretical Papers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.2010.4