×

Multiple jeeps problem with container restriction. (English) Zbl 1499.90026

Summary: Jeep problem is a kind of model of logistics in extreme situation, which has application in exploration and aircraft problems. The optimal distance and driving strategy of multiple jeeps problem are known. We consider multiple jeeps problem with container restriction, which is more complicated in the proof of feasibility and optimality of a driving strategy. We investigate when it can achieve the same optimal distance as without restriction. Based on the non-restricted optimal distance, a new driving strategy is proposed. We provide the necessary and sufficient condition to ensure the feasibility of the strategy, and obtain the maximal feasible distance.

MSC:

90B06 Transportation, logistics and supply chain management
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alway, G. G., Crossing the desert, The Mathematical Gazette, 41, 337, 209 (1957)
[2] Chen, W.; Ding, Y.; Fan, W., Optimal logistics for multiple jeeps, Acta Mathematica Scientia, 30B, 1429-1439 (2010) · Zbl 1240.90042
[3] Cheng, X.; Ding, Y.; Hua, X., Jeep problems with container restriction, Acta Mathematica Scientia, 39A, 348-357 (2019) · Zbl 1438.49015
[4] Dewdney, A. K., Computer recreations, Scientific American, 128-131 (1987)
[5] Ding, Y.; Fan, W., The optimal sequence of jeep problem, Engineering-Theory and Practice, 20, 2, 97-103 (2000)
[6] Fan, W.; Ding, Y., The jeep-fuel station problem, Acta Math Sci, 20A, 1, 85-94 (2000) · Zbl 0973.90009
[7] Fine, N. J., The jeep problem, American Mathematical Monthly, 54, 1, 24-31 (1947) · Zbl 0030.00402
[8] Franklin, J., The range of a fleet of aircraft, Journal of the Society for Industrial and Applied Mathematics, 8, 3, 541-548 (1960) · Zbl 0097.14605
[9] Gale, D., The jeep once more or jeeper by the dozen, American Mathematical Monthly, 77, 5, 493-501 (1970) · Zbl 0204.07703
[10] Hausrath, A.; Jackson, B.; Mitchem, J.; Schmeichel, E., Gale’s round-trip jeep problem, American Mathematical Monthly, 102, 4, 299-309 (1995) · Zbl 0833.90106
[11] Jackson, B.; Mitchem, J.; Schmeichel, E., A solution to dewdney’s jeep problem//Proc 7th International Conference in Graph Theory, Combinatorics, Algorithms and Application (1992) · Zbl 0842.90081
[12] Kuwata, T.; Maehara, H., Another exploration problem, Discrete Mathematics, 339, 5, 1543-1550 (2016) · Zbl 1333.05302
[13] Lantz, B., Where should captain scott’s support parties have turned back?, Polar Record, 54, 1, 76-78 (2018)
[14] Oberschelp, W., Alcuin’s camel and the jeep problem, Charlemagne and His Heritage. 1200 Years of Civilization and Science in Europe, 2, 411-422 (1998) · Zbl 1016.90002
[15] Phipps, C. G., The jeep problem: A more general solution, American Mathematical Monthly, 54, 8, 458-462 (1947)
[16] Yu, F.; Cui, J., Research on the efficient computation mechanism-in the case of n-vehicle exploration problem, Acta Mathematicae Applicatae Sinica, English Series, 34, 3, 645-657 (2018) · Zbl 1395.68157
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.