Re: Logistic time-step problem




In article <1152780168.218894.94870@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
christriddle@xxxxxxxxxxxxxx writes:
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


with all the side considerations you mention, this is a mixed problem with
integer (#...) variables nad continuous variables, nonlinear and hence
there is no hope for an analytical solution. the problem generally fits
into "optimal control". especially minimum time otpimal control,
and even a simple looking problem like
minimal time take up and capture in two aircrafts combat
results in a hard mathematical
problem.

transportation problems with no time constraints on the other side can be solved
routinely, but also not via closed formulae
hth
peter
.



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)