Solving maximum cut problem with an incremental genetic algorithm
- Authors
- Kim, J.; Yoon, Y.; Moon, B.-R.
- Issue Date
- 2016
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- Incremental genetic algorithm; Maximum cut problem
- Citation
- GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference, pp.49 - 50
- Journal Title
- GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference
- Start Page
- 49
- End Page
- 50
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/8845
- DOI
- 10.1145/2908961.2908976
- ISSN
- 0000-0000
- Abstract
- In this paper, we propose an incremental genetic algorithm applied to solve the maximum cut problem. We test the implementation of the algorithm on benchmark graph instances. We propose several methods to build up the sequence of subproblems, and they are tested through experiments. The performance of a genetic algorithm makes an improvement when the incremental approach is applied with respect to an appropriate sequence of subproblems. © 2016 Copyright held by the owner/author(s).
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 컴퓨터공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/8845)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.