Re: Military logistic problem

Chris,

I've worked on three different commercial packages for solving this
problem. The oldest was based on linear programming for parts of the
problem and dynamic programming/Dijkstra's algorithm for other parts,
and heuristics for the rest.

Another eliminated the linear programming and relied entirely on
heuristics and Dijkstra.

The third seems to be the slickest and most useful in terms of
practicality and speed. It is based on constraint processing and was
developed by people from CMU and the Kestrel Institute, among others,
back before constraint processing was as big a field as it is today.

See www.dodccrp.org/events/2004/ICCRTS_Denmark/CD/papers/096.pdf or
google
"CMARPS 2006" for more recent information.

christriddle@xxxxxxxxxxxxxx wrote:
Hi,

First of all I'm not sure if this belongs here, if not, could you
suggest a more appropriate group.

I'm having some problems researching the possibility of explicit
solutions to military logistics problems.

Although, I think the actual problem is more general. I have a
time-step simulation tool that simulates strategic-lift (aircraft,
ships, etc...) moving "stuff" from a start port to an end port.
Obviously aircraft make many flights back and forth.

While a time-step simulation suits this problem, it is quite expensive
in time.
The question I need answering is whether there exists an explicit
solution to such a problem. I'm pretty sure it's not linear, and
perhaps chaotic behaviour prevents such a solution.

By the way, when I say solution I mean things like finding:
a) How long it takes to move everything with various amounts of
start-lift, port infrastructure (#berths, #AC handlers, etc...) and so
on;
b) The optimum number of the above to produce the quickest time; etc...

I would be very grateful if you could point me in a direction to find
if such a thing is possible and if so, whether the complexity of such a
solution would make it impractical.

Many many thanks. Sorry the question is so long (and most probably
confusing!)
Chris Riddle

.

Relevant Pages

  • Logistic time-step problem
    ... moving "stuff" from a start port to an end port. ... Obviously aircraft make many flights back and forth. ... While a time-step simulation suits this problem, ... The optimum number of the above to produce the quickest time; ...
    (sci.math.num-analysis)
  • Military logistic problem
    ... moving "stuff" from a start port to an end port. ... Obviously aircraft make many flights back and forth. ... While a time-step simulation suits this problem, ... The optimum number of the above to produce the quickest time; ...
    (sci.math)
  • Military logistic problem
    ... moving "stuff" from a start port to an end port. ... Obviously aircraft make many flights back and forth. ... While a time-step simulation suits this problem, ... The optimum number of the above to produce the quickest time; ...
    (sci.nonlinear)
  • Military logistic problem
    ... moving "stuff" from a start port to an end port. ... Obviously aircraft make many flights back and forth. ... While a time-step simulation suits this problem, ... The optimum number of the above to produce the quickest time; ...
    (sci.math)
  • Military logistic problem
    ... moving "stuff" from a start port to an end port. ... Obviously aircraft make many flights back and forth. ... While a time-step simulation suits this problem, ... The optimum number of the above to produce the quickest time; ...
    (comp.theory)