haku: @author Aytug, H. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
Tekijä:Aytug, H.
Saydam, C.
Otsikko:Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study
Lehti:European Journal of Operational Research
2002 : SEP, VOL. 141:3, p. 480-494
Asiasana:COMPARATIVE RESEARCH
COUNTRY COMPARISONS
INTEGER PROGRAMMING
ANALYTICAL REVIEW
Kieli:eng
Tiivistelmä:This paper compares the performance of genetic algorithms (GAs) on large-scale maximum expected coverage problems to other heuristic approaches. The authors focus attention on a particular formulation with a nonlinear objective function to be optimized over a convex set. The solutions obtained by the best genetic algorithm are compared to Daskin's heuristic and the optimal or best solutions obtained by solving the corresponding integer linear programming (ILP) problems. The authors show that at least one of the GAs yields optimal or near-optimal solutions in a reasonable amount of time.
SCIMA tietueen numero: 237927
lisää koriin
« edellinen | seuraava »
SCIMA