Genetic Algorithm of Optimal Spatial Arrangement of Service Stations
Scientific Proceedings of the 14th Conference of the ASMDA International Society 2011
Andrejs Kašurins, Inese Kašurina

A problem of service station arrangement in spatial space is considered. It is necessary to place the predefined number of stations, to minimize transport expenses (loss function). In previous researches gradient and Quasi-Newton methods are used. Now for the optimization a genetic algorithm is used. Numerous experiments allowed evaluating their efficiency.


Atslēgas vārdi
genetic algorithm, service stations, spatial arrangement

Kašurins, A., Kašurina, I. Genetic Algorithm of Optimal Spatial Arrangement of Service Stations. No: Scientific Proceedings of the 14th Conference of the ASMDA International Society, Itālija, Rome, 7.-10. jūnijs, 2011. Rome: © asmda international (In appearance), 2011, 667.-667.lpp.

Publikācijas valoda
English (en)
RTU Zinātniskā bibliotēka.
E-pasts: uzzinas@rtu.lv; Tālr: +371 28399196