An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement

Rui Ding; Hongbin Dong; Jun He; Yuxin Dong

doi:10.1109/CEC.2016.7743893

An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement

Rui Ding, Hongbin Dong, Jun He, Yuxin Dong

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

Abstract

Curling-match arrangement is a multi-constrained optimization problem in the real world. An improved partheno-genetic algorithm is used for solving the problem in this paper. In order to handle the complicated relationships among the particular constraints in curling-match, an eliminate-selection strategy is proposed to increase population diversity. Two genetic operators, targeted self-crossover operator and fixed-random self-crossover operator, are designed to ensure that the algorithm can convergence rapidly. With bi-level optimization, the improved partheno-genetic algorithm enhances its search ability. An orthogonal method is used to obtain the algorithm parameters. Simulation results demonstrate that the improved algorithm can solve the curling-match multi-constrained optimization problem efficiently.

Original language	English
Title of host publication	2016 IEEE Congress on Evolutionary Computation, CEC 2016
Publisher	IEEE Press
Pages	957-964
Number of pages	8
ISBN (Electronic)	9781509006229
DOIs	https://doi.org/10.1109/CEC.2016.7743893
Publication status	Published - 14 Nov 2016
Event	2016 IEEE Congress on Evolutionary Computation, CEC 2016 - Vancouver, Canada Duration: 24 Jul 2016 → 29 Jul 2016

Publication series

Name	2016 IEEE Congress on Evolutionary Computation, CEC 2016

Conference

Conference	2016 IEEE Congress on Evolutionary Computation, CEC 2016
Country/Territory	Canada
City	Vancouver
Period	24 Jul 2016 → 29 Jul 2016

Keywords

Curling Match Arrangement
Eliminate-selection Strategy
Fixed-Random Self-Crossover
Partheno-Genetic Algorithm
Targeted Self-Crossover

Access to Document

10.1109/CEC.2016.7743893

Permanent link

Persistent link

Cite this

@inproceedings{e0c21cc776694f64bb4a40d5fe7ca1f3,

title = "An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement",

abstract = "Curling-match arrangement is a multi-constrained optimization problem in the real world. An improved partheno-genetic algorithm is used for solving the problem in this paper. In order to handle the complicated relationships among the particular constraints in curling-match, an eliminate-selection strategy is proposed to increase population diversity. Two genetic operators, targeted self-crossover operator and fixed-random self-crossover operator, are designed to ensure that the algorithm can convergence rapidly. With bi-level optimization, the improved partheno-genetic algorithm enhances its search ability. An orthogonal method is used to obtain the algorithm parameters. Simulation results demonstrate that the improved algorithm can solve the curling-match multi-constrained optimization problem efficiently.",

keywords = "Curling Match Arrangement, Eliminate-selection Strategy, Fixed-Random Self-Crossover, Partheno-Genetic Algorithm, Targeted Self-Crossover",

author = "Rui Ding and Hongbin Dong and Jun He and Yuxin Dong",

year = "2016",

month = nov,

day = "14",

doi = "10.1109/CEC.2016.7743893",

language = "English",

series = "2016 IEEE Congress on Evolutionary Computation, CEC 2016",

publisher = "IEEE Press",

pages = "957--964",

booktitle = "2016 IEEE Congress on Evolutionary Computation, CEC 2016",

address = "United States of America",

note = "2016 IEEE Congress on Evolutionary Computation, CEC 2016 ; Conference date: 24-07-2016 Through 29-07-2016",

}

Ding, R, Dong, H, He, J & Dong, Y 2016, An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement. in 2016 IEEE Congress on Evolutionary Computation, CEC 2016., 7743893, 2016 IEEE Congress on Evolutionary Computation, CEC 2016, IEEE Press, pp. 957-964, 2016 IEEE Congress on Evolutionary Computation, CEC 2016, Vancouver, Canada, 24 Jul 2016. https://doi.org/10.1109/CEC.2016.7743893

An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement. / Ding, Rui; Dong, Hongbin; He, Jun et al.
2016 IEEE Congress on Evolutionary Computation, CEC 2016. IEEE Press, 2016. p. 957-964 7743893 (2016 IEEE Congress on Evolutionary Computation, CEC 2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

TY - GEN

T1 - An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement

AU - Ding, Rui

AU - Dong, Hongbin

AU - He, Jun

AU - Dong, Yuxin

PY - 2016/11/14

Y1 - 2016/11/14

N2 - Curling-match arrangement is a multi-constrained optimization problem in the real world. An improved partheno-genetic algorithm is used for solving the problem in this paper. In order to handle the complicated relationships among the particular constraints in curling-match, an eliminate-selection strategy is proposed to increase population diversity. Two genetic operators, targeted self-crossover operator and fixed-random self-crossover operator, are designed to ensure that the algorithm can convergence rapidly. With bi-level optimization, the improved partheno-genetic algorithm enhances its search ability. An orthogonal method is used to obtain the algorithm parameters. Simulation results demonstrate that the improved algorithm can solve the curling-match multi-constrained optimization problem efficiently.

AB - Curling-match arrangement is a multi-constrained optimization problem in the real world. An improved partheno-genetic algorithm is used for solving the problem in this paper. In order to handle the complicated relationships among the particular constraints in curling-match, an eliminate-selection strategy is proposed to increase population diversity. Two genetic operators, targeted self-crossover operator and fixed-random self-crossover operator, are designed to ensure that the algorithm can convergence rapidly. With bi-level optimization, the improved partheno-genetic algorithm enhances its search ability. An orthogonal method is used to obtain the algorithm parameters. Simulation results demonstrate that the improved algorithm can solve the curling-match multi-constrained optimization problem efficiently.

KW - Curling Match Arrangement

KW - Eliminate-selection Strategy

KW - Fixed-Random Self-Crossover

KW - Partheno-Genetic Algorithm

KW - Targeted Self-Crossover

UR - http://www.scopus.com/inward/record.url?scp=85008263110&partnerID=8YFLogxK

U2 - 10.1109/CEC.2016.7743893

DO - 10.1109/CEC.2016.7743893

M3 - Conference Proceeding (Non-Journal item)

AN - SCOPUS:85008263110

T3 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016

SP - 957

EP - 964

BT - 2016 IEEE Congress on Evolutionary Computation, CEC 2016

PB - IEEE Press

T2 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016

Y2 - 24 July 2016 through 29 July 2016

ER -

An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement

Abstract

Publication series

Conference

Keywords

Access to Document

Permanent link

Other files and links

Fingerprint

Cite this