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

A tétel rövid nézete
dc.contributor.advisorSzikszai, Márton
dc.contributor.authorAl Shaggah, Laith Mahmoud Houssni
dc.contributor.departmentDE--Természettudományi és Technológiai Kar--Matematikai Intézethu_HU
dc.date.accessioned2019-05-10T06:02:38Z
dc.date.available2019-05-10T06:02:38Z
dc.date.created2019-05-10
dc.description.abstractThis 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.hu_HU
dc.description.correctorgj
dc.description.courseApplied Mathematicshu_HU
dc.description.degreeMSc/MAhu_HU
dc.format.extent24hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/267262
dc.language.isoenhu_HU
dc.subjectGas Station Problemhu_HU
dc.subjectrefueling strategyhu_HU
dc.subjectBrute-forcehu_HU
dc.subjectAlgorithm running timehu_HU
dc.subject.dspaceDEENK Témalista::Matematikahu_HU
dc.titleEfficiency of brute-force design: a case study of the Gas Station Problemhu_HU
Fájlok
Gyűjtemények
Theses (Faculty of Science and Technology)