Efficiency of brute-force design: a case study of the Gas Station Problem

Abstract

This thesis consider the Gas Station Problem. Discussing the problem mathematically in detailed and cleaner way. Reasoning how a trivial result can be used to transform the Gas Station Problem into a discrete optimization problem, which allows us to present a naive algorithm that uses the brute-force design pattern. We also provide an implementation of this algorithm. Also deals with the simulation of realistic data as input for testing the practical limitations of the brute-force approach and provides empirical data obtained from tests where the naive algorithm is used with the simulated data as input.