|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||The modification of genetic algorithms for solving the balanced location problem||Journal:||ACM International Conference Proceeding Series||First page:||243||Last page:||246||Conference:||5th Balkan Conference in Informatics, BCI 2012; Novi Sad; Serbia; 16 September 2012 through 20 September 2012||Issue Date:||17-Oct-2012||ISBN:||978-145031240-0||DOI:||10.1145/2371316.2371365||Abstract:||
In this paper is described the modification of the existing evolutionary approach for Discrete Ordered Median Problem (DOMP), in order to solve the Balanced Location Problem (LOBA). Described approach, named HGA1, includes a hybrid of Genetic Algorithm (GA) and a well-known Fast Interchange Heuristic (FIH). HGA1 uses binary encoding schema. Also, new genetic operators that keep the feasibility of individuals are proposed. In proposed method, caching GA technique was integrated with the GFI heuristic to improve computational performance. The algorithm is tested on standard instances from the literature and on large-scale instances, up to 1000 potential facilities and clients, which is generated by generator described in . The obtained results are also compared with the existing heuristic from the literature.
|Keywords:||Balanced allocation of customers | Discrete location | Evolutionary computations | Genetic algorithms||Publisher:||Association for Computing Machinery|
Show full item record
checked on Sep 16, 2022
checked on Sep 15, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.