- Source: Jeep problem
The jeep problem, desert crossing problem or exploration problem is a mathematics problem in which a jeep must maximize the distance it can travel into a desert with a given quantity of fuel. The jeep can only carry a fixed and limited amount of fuel, but it can leave fuel and collect fuel at fuel dumps anywhere in the desert.
The problem first appeared in the 9th-century collection Propositiones ad Acuendos Juvenes (Problems to Sharpen the Young), attributed to Alcuin, with the puzzle being about a travelling camel eating grain. The De viribus quantitatis (c. 1500) of Luca Pacioli also discusses the problem. A modern treatment was given by N. J. Fine in 1947.
Problem
There are n units of fuel stored at a fixed base. The jeep can carry at most 1 unit of fuel at any time, and can travel 1 unit of distance on 1 unit of fuel (the jeep's fuel consumption is assumed to be constant). At any point in a trip the jeep may leave any amount of fuel that it is carrying at a fuel dump, or may collect any amount of fuel that was left at a fuel dump on a previous trip, as long as its fuel load never exceeds 1 unit. There are two variants of the problem:
Exploring the desert – the jeep must return to the base at the end of every trip.
Crossing the desert – the jeep must return to the base at the end of every trip except for the final trip, when the jeep travels as far as it can before running out of fuel.
In either case the objective is to maximize the distance traveled by the jeep on its final trip. Alternatively, the objective may be to find the least amount of fuel required to produce a final trip of a given distance.
= Variations
=In the classic problem the fuel in the jeep and at fuel dumps is treated as a continuous quantity. More complex variations on the problem have been proposed in which the fuel can only be left or collected in discrete amounts.
Solution
A strategy that maximizes the distance traveled on the final trip for the "exploring the desert" variant is as follows:
The jeep makes n trips. On each trip it starts from base with 1 unit of fuel.
On the first trip the jeep travels a distance of 1/(2n) units and leaves (n − 1)/n units of fuel at a fuel dump. The jeep still has 1/(2n) units of fuel – just enough to return to base.
On each of the subsequent n − 1 trips the jeep collects 1/(2n) units of fuel from this first fuel dump on the way out, so that it leaves the fuel dump carrying 1 unit of fuel. It also collects 1/(2n) units of fuel from this first fuel dump on the way back, which is just enough fuel to return to base.
On the second trip the jeep travels to the first fuel dump and refuels. It then travels a distance of 1/(2n − 2) units and leaves (n − 2)/(n − 1) units of fuel at a second fuel dump. The jeep still has 1/(2n − 2) units of fuel, which is just enough to return to the first fuel dump. Here it collects 1/(2n) units of fuel, which is just enough fuel to return to base.
On each of the subsequent n − 2 trips the jeep collects 1/(2n − 2) units of fuel from this second fuel dump on the way out, so that it leaves the fuel dump carrying 1 unit of fuel. It also collects 1/(2n − 2) units of fuel from the second fuel dump on the way back, which is just enough fuel to return to the first fuel dump.
The jeep continues in this way, so that on trip k it establishes a new kth fuel dump at a distance of 1/(2n − 2k + 2) units from the previous fuel dump and leaves (n − k)/(n − k + 1) units of fuel there. On each of the subsequent n − k trips it collects 1/(2n − 2k + 2) units of fuel from the kth dump on its way out and another 1/(2n − 2k + 2) units of fuel on its way back.
When the jeep starts its final trip, there are n − 1 fuel dumps. The farthest contains 1/2 of a unit of fuel, the next farthest contain 1/3 of a unit of fuel, and so on, and the nearest fuel dump has just 1/n units of fuel left. Together with 1 unit of fuel with which it starts from base, this means that the jeep can travel a total round trip distance of
1
+
1
2
+
1
3
+
⋯
+
1
n
=
∑
k
=
1
n
1
k
≡
2
×
e
x
p
l
o
r
e
(
n
)
{\displaystyle 1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}=\sum _{k=1}^{n}{\frac {1}{k}}\equiv 2\times \mathrm {explore} (n)}
units on its final trip (the maximum distance traveled into the desert is half of this). It collects half of the remaining fuel at each dump on the way out, which fills its tank. After leaving the farthest fuel dump it travels 1/2 a unit further into the desert and then returns to the farthest fuel dump. It collects the remaining fuel from each fuel dump on the way back, which is just enough to reach the next fuel dump or, in the final step, to return to base.
The distance travelled on the last trip is the nth harmonic number, Hn. As the harmonic numbers are unbounded, it is possible to exceed any given distance on the final trip, as along as sufficient fuel is available at the base. However, the amount of fuel required and the number of fuel dumps both increase exponentially with the distance to be traveled.
The "crossing the desert" variant can be solved with a similar strategy, except that there is now no requirement to collect fuel on the way back on the final trip. So on trip k the jeep establishes a new kth fuel dump at a distance of 1/(2n − 2k + 1) units from the previous fuel dump and leaves (2n − 2k − 1)/(2n − 2k + 1) units of fuel there. On each of the next n − k − 1 trips it collects 1/(2n − 2k + 1) units of fuel from the kth dump on its way out and another 1/(2n − 2k + 1) units of fuel on its way back.
Now when the jeep starts its final trip, there are n − 1 fuel dumps. The farthest contains 1/3 of a unit of fuel, the next farthest contain 1/5 of a unit of fuel, and so on, and the nearest fuel dump has just 1/(2n − 1) units of fuel left. Together with 1 unit of fuel with which it starts from base, this means that the jeep can travel a total distance of
1
+
1
3
+
1
5
+
⋯
+
1
2
n
−
1
=
∑
k
=
1
n
1
2
k
−
1
=
H
2
n
−
1
−
1
2
H
n
−
1
≡
c
r
o
s
s
(
n
)
{\displaystyle 1+{\frac {1}{3}}+{\frac {1}{5}}+\cdots +{\frac {1}{2n-1}}=\sum _{k=1}^{n}{\frac {1}{2k-1}}=H_{2n-1}-{\frac {1}{2}}H_{n-1}\equiv \mathrm {cross} (n)}
units on its final trip. It collects all of the remaining fuel at each dump on the way out, which fills its tank. After leaving the farthest fuel dump it travels a further distance of 1 unit.
Since
c
r
o
s
s
(
n
)
=
∑
k
=
1
n
1
2
k
−
1
>
∑
k
=
1
n
1
2
k
=
1
2
H
n
=
e
x
p
l
o
r
e
(
n
)
{\displaystyle \mathrm {cross} (n)=\sum _{k=1}^{n}{\frac {1}{2k-1}}>\sum _{k=1}^{n}{\frac {1}{2k}}={\frac {1}{2}}H_{n}=\mathrm {explore} (n)}
,
it is possible in theory to cross a desert of any size given enough fuel at the base. As before, the amount of fuel required and the number of fuel dumps both increase exponentially with the distance to be traveled.
In summary, the maximum distance reachable by the jeep (with a fuel capacity for 1 unit of distance at any time) in n trips (with n-1 midway fuel dumps and consuming a total of n units of fuel) is
e
x
p
l
o
r
e
(
n
)
=
1
2
H
n
=
1
2
+
1
4
+
1
6
+
⋯
+
1
2
n
{\displaystyle \mathrm {explore} (n)={\frac {1}{2}}H_{n}={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{6}}+\cdots +{\frac {1}{2n}}}
, for exploring the desert where the jeep must return to the base at the end of every trip;
c
r
o
s
s
(
n
)
=
H
2
n
−
1
−
1
2
H
n
−
1
=
1
+
1
3
+
1
5
+
⋯
+
1
2
n
−
1
{\displaystyle \mathrm {cross} (n)=H_{2n-1}-{\frac {1}{2}}H_{n-1}=1+{\frac {1}{3}}+{\frac {1}{5}}+\cdots +{\frac {1}{2n-1}}}
, for crossing the desert where the jeep must return to the base at the end of every trip except for the final trip, when the jeep travels as far as it can before running out of fuel.
Here
H
n
=
1
+
1
2
+
1
3
+
⋯
+
1
n
{\displaystyle H_{n}=1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}}
is the nth harmonic number.
= Continuous amount of fuel
=The number of fuel units available at the base need not be an integer. In the general case, the maximum distance achievable for the "explore the desert" problem with n units of fuel is
e
x
p
l
o
r
e
(
n
)
=
∫
0
n
d
f
2
⌈
n
−
f
⌉
{\displaystyle \mathrm {explore} (n)=\int _{0}^{n}{\frac {\mathrm {d} f}{2\lceil n-f\rceil }}}
with the first fuel dump located at
{
n
}
/
(
2
⌈
n
⌉
)
{\displaystyle \{n\}/(2\lceil n\rceil )}
units of distance away from the starting base, the second one at
1
/
(
2
⌈
n
⌉
−
2
)
{\displaystyle 1/(2\lceil n\rceil -2)}
units of distance away from the first fuel dump, the third one at
1
/
(
2
⌈
n
⌉
−
4
)
{\displaystyle 1/(2\lceil n\rceil -4)}
units of distance away from the second fuel dump, and so on. Here
{
n
}
=
n
−
⌊
n
⌋
{\displaystyle \{n\}=n-\lfloor n\rfloor }
is the fractional part of n.
The maximum distance achievable for the "cross the desert" problem with n units of fuel is
c
r
o
s
s
(
n
)
=
∫
0
n
d
f
2
⌈
n
−
f
⌉
−
1
{\displaystyle \mathrm {cross} (n)=\int _{0}^{n}{\frac {\mathrm {d} f}{2\lceil n-f\rceil -1}}}
with the first fuel dump located at
{
n
}
/
(
2
⌈
n
⌉
−
1
)
{\displaystyle \{n\}/(2\lceil n\rceil -1)}
units of distance away from the starting base, the second one at
1
/
(
2
⌈
n
⌉
−
3
)
{\displaystyle 1/(2\lceil n\rceil -3)}
units of distance away from the first fuel dump, the third one at
1
/
(
2
⌈
n
⌉
−
5
)
{\displaystyle 1/(2\lceil n\rceil -5)}
units of distance away from the second fuel dump, and so on. Here
{
n
}
=
n
−
⌊
n
⌋
{\displaystyle \{n\}=n-\lfloor n\rfloor }
is the fractional part of n.
= Order independence
=The order of the jeep trips is not fixed. For example in the "exploring the desert" version of the problem, the jeep could make n − 1 round-trips between the base and the first fuel dump, leaving (n − 1) / n units of fuel at the fuel dump each time and then make an n-th trip one-way to the first fuel dump, thus arriving there with a total of (n − 1) + 1/(2n) units of fuel available. The 1/(2n) units are saved for the return trip to base at the very end and the other n − 1 units of fuel are used to move fuel between the first and second fuel dump, using n − 2 round-trips and then an (n−1)-th trip one-way to the second fuel dump. And so on.
Practical applications
The problem can have a practical application in wartime situations, especially with respect to fuel efficiency. In the context of the bombing of Japan in World War II by B-29s, Robert McNamara says in the film The Fog of War that understanding the fuel efficiency issue caused by having to transport the fuel to forward bases was the main reason why the strategy of launching bombing raids from mainland China was abandoned in favor of the island hopping strategy:
"We had to fly those planes from the bases in Kansas to India. Then we had to fly fuel over the hump into China. [...] We were supposed to take these B-29s—there were no tanker aircraft there. We were to fill them with fuel, fly from India to Chengtu; offload the fuel; fly back to India; make enough missions to build up fuel in Chengtu; fly to Yawata, Japan; bomb the steel mills; and go back to India.
We had so little training on this problem of maximizing [fuel] efficiency, we actually found to get some of the B-29s back instead of offloading fuel, they had to take it on. To make a long story short, it wasn't worth a damn. And it was LeMay who really came to that conclusion, and led the Chiefs to move the whole thing to the Marianas, which devastated Japan."
(The atomic bombing missions at the end of World War II were flown using B-29 Superfortresses from the Pacific island of Tinian in the Northern Marianas Islands.)
See also
Read Operation Black Buck for better understanding on application of these ideas. In these missions, conducted during the Falklands War, the Royal Air Force used air to air refueling by staging tankers to enable the Vulcan bombers based on Ascension Island to bomb targets in the Falkland Islands.
Harmonic series (mathematics)
Optimization (mathematics)
References
Kata Kunci Pencarian:
- Masalah jip
- Dodge Durango
- Daftar julukan kota di Amerika Serikat
- Daftar pangram
- Manajemen siklus produk
- Brightline
- Jeep problem
- Jeep Grand Cherokee
- Jeep
- Jeep Cherokee (KL)
- Jeep Cherokee (XJ)
- Harmonic series (mathematics)
- Jeep Wagoneer (SJ)
- Willys MB
- Tsiolkovsky rocket equation
- Jeep Gladiator (JT)
