SERVING THE QUANTITATIVE FINANCE COMMUNITY

EdisonCruise
Topic Author
Posts: 97
Joined: September 15th, 2012, 4:22 am

### What's the optimal strategy to this food transportation problem?

The distance between city A and B  is 100 km. The total food needs to move from A to B is 3 tons. A transportation team can carry food 1 ton per day and at the same time consumes food 0.25 tons per day. Then how to setup transfer stations between city A nd B to minimize food consumption during transportation?

This seem to be a classical dynamic programming problem, is there any general solution?

tw
Posts: 1053
Joined: May 10th, 2002, 3:30 pm

### Re: What's the optimal strategy to this food transportation problem?

cf. The Jeep problem (it's somewhere in Bellman's 1950s book but googling should find some references).

Collector
Posts: 4205
Joined: August 21st, 2001, 12:37 pm

### Re: What's the optimal strategy to this food transportation problem?

do not transport the food, then when people in city B gets hungry enough thy will transport fresh meat to city A for free! Don't blame me, it is a solution I got from my new AI solver.

ISayMoo
Posts: 1898
Joined: September 30th, 2015, 8:30 pm

### Re: What's the optimal strategy to this food transportation problem?

The distance between city A and B  is 100 km. The total food needs to move from A to B is 3 tons. A transportation team can carry food 1 ton per day and at the same time consumes food 0.25 tons per day. Then how to setup transfer stations between city A nd B to minimize food consumption during transportation?

This seem to be a classical dynamic programming problem, is there any general solution?
https://en.wikipedia.org/wiki/Red_Ball_Express
 ABOUT WILMOTT

Wilmott.com has been "Serving the Quantitative Finance Community" since 2001. Continued...

 JOBS BOARD

Looking for a quant job, risk, algo trading,...? Browse jobs here...

GZIP: On