A tabu search heuristic for the multi-depot vehicle routing problem
Computers and Operations Research
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
Transportation Science
A general heuristic for vehicle routing problems
Computers and Operations Research
Finding optimal refueling policies: a dynamic programming approach
Journal of Computing Sciences in Colleges
A linear-time algorithm for finding optimal vehicle refueling policies
Operations Research Letters
| Hi-index | 0.00 |
Scientists conducting polar research in Antarctica must contend with harsh environmental conditions that constrain their movements and raise their costs. One on going challenge is choosing cache sites for aircraft refueling. Given a data-gathering mission (e.g. set of flight destinations), aircraft fuel-consumption model, and infrastructure (e.g. base and cache-sites), the Fuel-Cache Site-Selection (FCSS) problem identifies the optimal use of cache sites to fulfill the mission. The FCSS problem is important for planning expeditions in infrastructure-poor areas for scientific or military purposes. However, the FCSS problem is computationally challenging due to interaction across different flight-routes. Related approaches from literature concerning routing are inadequate due to assumptions about the cost of providing infrastructure. This paper proposes heuristics and a filter-and-refine based exact algorithm, evaluation using analytical and experimental methods, and a case study with end-users, e.g. polar scientists.