The Jeep Problem: A Flexible MIP Formulation

Authors

  • Uwe Gotzes University of Duisburg-Essen, Essen, Germany
  • Claudia Gotzes University of Duisburg-Essen, Essen, Germany

DOI:

https://doi.org/10.3126/jnms.v1i1.42168

Keywords:

Jeep problem, Crossing the desert, Logistics, Storage, Continuous location, Mixed-integer programming

Abstract

This article deals with the Jeep Problem (also known as Desert Crossing Problem), which reads as follows: An unlimited supply of fuel is available at one edge of a desert, but there is no source on the desert itself. A vehicle can carry enough fuel to go a certain distance, and it can built up its own refuelling stations. What is the minimum amount of fuel the vehicle will require in order to cross the desert? Under these mild conditions this question is answered since the 1940s. But what is the answer if the caches are restricted to certain areas or if the fuel consumption does not depend linearly on the distance travelled? To answer these and similar questions we develop and solve a flexible mixed-integer programming (MIP) model for the classical problem and enhance it with new further aspects of practical relevance.

Downloads

Download data is not yet available.
Abstract
40
PDF
28

Downloads

Published

2018-02-11

How to Cite

Gotzes, U., & Gotzes, C. (2018). The Jeep Problem: A Flexible MIP Formulation. Journal of Nepal Mathematical Society, 1(1), 11–17. https://doi.org/10.3126/jnms.v1i1.42168

Issue

Section

Articles