Browse

Genetic Algorithms for A Competitive Location Problem

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
Rhim, Hosun
Issue Date
1997-12
Publisher
서울대학교 경영대학 경영연구소
Citation
경영논집, Vol.31 No.3/4, pp. 380-406
Keywords
380-406
Description
1997-12
Abstract
In this paper, we develop genetic algorithms for the competitive location problem addressed by Ho, Karmarkar, and Rhim in 1997 (hereafter, HKR). The implemented genetic algorithms are tested for various sizes of problems. Genetic algorithms are search algorithms which simulate natural processes of evolution. Since the primary monograph by Holland (1975), genetic algorithms have been

proven to be robust search methods for complex functions and have been applied to various areas, including optimization problems such as scheduling, location, traveling salesman problems.
ISSN
1229-0491
Language
Korean
URI
https://hdl.handle.net/10371/52831
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Institute of Management Research (경영연구소)경영논집경영논집 vol.31 (1997)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse