Integer programming formulation for convoy movement problem
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 ave...
Saved in:
Main Authors: | Kumar, P. N. Ram., Narendran, T. T. |
---|---|
Other Authors: | School of Mechanical and Aerospace Engineering |
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/93701 http://hdl.handle.net/10220/6153 http://inderscience.metapress.com/openurl.asp?genre=article&eissn=1755-1595&volume=1&issue=3&spage=177 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Ordering-flexible multi-robot coordination for moving target convoying using long-term task execution
by: Hu, Bin-Bin, et al.
Published: (2024) -
Mining trajectory databases for multi-object movement patterns
by: HTOO HTET AUNG
Published: (2013) -
A hybrid approach to convoy movement planning in an urban city
by: Thangarajoo, Ramesh, et al.
Published: (2008) -
A hybrid approach to convoy movement planning in an urban city
by: Thangarajoo, R., et al.
Published: (2014) -
Some integer programming formulations of the airline crew-scheduling problem
by: Abacan, Ray Carlo A., et al.
Published: (2000)