Re-labeling differential evolution for combinatorial optimization

Ryohei Funaki, Hirotaka Takano, Junichi Murata

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抄録

In this paper, the authors propose a new differential evolution (DE) technique called Re-labeling Differential Evolution for combinatorial optimization. DE was proposed in 1995 by Stone and Price. DE is one of the techniques of evolutionary computation (EC), and efficiently solves optimization problems using difference vectors between individuals in continuous space. DE can efficiently solve problems using information about the landscape of objective functions obtained by difference vectors between individuals. However, in problems whose solution candidates (individuals in EC terminology) are sets of integer values which are used to identify several different things, the information about the landscape of objective functions can not be obtained by difference vectors. For example, in a route selection problem where routes are distinguished by integer valued indices, such as route 1, route 2 and so on, although route 1 and route 2 have indices numerically close to each other, length of these routes are not necessarily similar to each other. In order to apply the DE to such problems, Re-labeling DE re-labels indices so that difference vectors are small between two individuals whose fitness values are close to each other. The proposed Re-labeling DE is compared with genetic algorithms (GA) and normal DE in the performance when applied to example route selection problems which are simple combinatorial optimization problems, and usefulness of Re-labeling DE is confirmed.

元の言語英語
ホスト出版物のタイトルSICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings
ページ1550-1555
ページ数6
出版物ステータス出版済み - 2013
イベント2013 52nd Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2013 - Nagoya, 日本
継続期間: 9 14 20139 17 2013

その他

その他2013 52nd Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2013
日本
Nagoya
期間9/14/139/17/13

Fingerprint

Combinatorial optimization
Labeling
Evolutionary algorithms
Terminology
Labels
Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

これを引用

Funaki, R., Takano, H., & Murata, J. (2013). Re-labeling differential evolution for combinatorial optimization. : SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings (pp. 1550-1555)

Re-labeling differential evolution for combinatorial optimization. / Funaki, Ryohei; Takano, Hirotaka; Murata, Junichi.

SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings. 2013. p. 1550-1555.

研究成果: 著書/レポートタイプへの貢献会議での発言

Funaki, R, Takano, H & Murata, J 2013, Re-labeling differential evolution for combinatorial optimization. : SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings. pp. 1550-1555, 2013 52nd Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2013, Nagoya, 日本, 9/14/13.
Funaki R, Takano H, Murata J. Re-labeling differential evolution for combinatorial optimization. : SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings. 2013. p. 1550-1555
Funaki, Ryohei ; Takano, Hirotaka ; Murata, Junichi. / Re-labeling differential evolution for combinatorial optimization. SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings. 2013. pp. 1550-1555
@inproceedings{c39b6811324d4f01a5f7d12b6ad0375b,
title = "Re-labeling differential evolution for combinatorial optimization",
abstract = "In this paper, the authors propose a new differential evolution (DE) technique called Re-labeling Differential Evolution for combinatorial optimization. DE was proposed in 1995 by Stone and Price. DE is one of the techniques of evolutionary computation (EC), and efficiently solves optimization problems using difference vectors between individuals in continuous space. DE can efficiently solve problems using information about the landscape of objective functions obtained by difference vectors between individuals. However, in problems whose solution candidates (individuals in EC terminology) are sets of integer values which are used to identify several different things, the information about the landscape of objective functions can not be obtained by difference vectors. For example, in a route selection problem where routes are distinguished by integer valued indices, such as route 1, route 2 and so on, although route 1 and route 2 have indices numerically close to each other, length of these routes are not necessarily similar to each other. In order to apply the DE to such problems, Re-labeling DE re-labels indices so that difference vectors are small between two individuals whose fitness values are close to each other. The proposed Re-labeling DE is compared with genetic algorithms (GA) and normal DE in the performance when applied to example route selection problems which are simple combinatorial optimization problems, and usefulness of Re-labeling DE is confirmed.",
author = "Ryohei Funaki and Hirotaka Takano and Junichi Murata",
year = "2013",
language = "English",
pages = "1550--1555",
booktitle = "SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings",

}

TY - GEN

T1 - Re-labeling differential evolution for combinatorial optimization

AU - Funaki, Ryohei

AU - Takano, Hirotaka

AU - Murata, Junichi

PY - 2013

Y1 - 2013

N2 - In this paper, the authors propose a new differential evolution (DE) technique called Re-labeling Differential Evolution for combinatorial optimization. DE was proposed in 1995 by Stone and Price. DE is one of the techniques of evolutionary computation (EC), and efficiently solves optimization problems using difference vectors between individuals in continuous space. DE can efficiently solve problems using information about the landscape of objective functions obtained by difference vectors between individuals. However, in problems whose solution candidates (individuals in EC terminology) are sets of integer values which are used to identify several different things, the information about the landscape of objective functions can not be obtained by difference vectors. For example, in a route selection problem where routes are distinguished by integer valued indices, such as route 1, route 2 and so on, although route 1 and route 2 have indices numerically close to each other, length of these routes are not necessarily similar to each other. In order to apply the DE to such problems, Re-labeling DE re-labels indices so that difference vectors are small between two individuals whose fitness values are close to each other. The proposed Re-labeling DE is compared with genetic algorithms (GA) and normal DE in the performance when applied to example route selection problems which are simple combinatorial optimization problems, and usefulness of Re-labeling DE is confirmed.

AB - In this paper, the authors propose a new differential evolution (DE) technique called Re-labeling Differential Evolution for combinatorial optimization. DE was proposed in 1995 by Stone and Price. DE is one of the techniques of evolutionary computation (EC), and efficiently solves optimization problems using difference vectors between individuals in continuous space. DE can efficiently solve problems using information about the landscape of objective functions obtained by difference vectors between individuals. However, in problems whose solution candidates (individuals in EC terminology) are sets of integer values which are used to identify several different things, the information about the landscape of objective functions can not be obtained by difference vectors. For example, in a route selection problem where routes are distinguished by integer valued indices, such as route 1, route 2 and so on, although route 1 and route 2 have indices numerically close to each other, length of these routes are not necessarily similar to each other. In order to apply the DE to such problems, Re-labeling DE re-labels indices so that difference vectors are small between two individuals whose fitness values are close to each other. The proposed Re-labeling DE is compared with genetic algorithms (GA) and normal DE in the performance when applied to example route selection problems which are simple combinatorial optimization problems, and usefulness of Re-labeling DE is confirmed.

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

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

M3 - Conference contribution

SP - 1550

EP - 1555

BT - SICE 2013: International Conference on Instrumentation, Control, Information Technology and System Integration - SICE Annual Conference 2013, Conference Proceedings

ER -