Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems

Yunyoung Kim, Koji Gotoh, Masahiro Toyosada, Jewoong Park

Research output: Contribution to conferencePaper

9 Citations (Scopus)

Abstract

The current research to find near-optimum solution(s) explores in a small population, which is coined as Micro-Genetic Algorithms (μGAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the μGAs work with encoding population and are implemented serially. The major difference between SGAs and μGAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement hybrid μGAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as a new strategic conception for hybrid μGAs. It is shown that the general μGAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior performance of the general μGAs is demonstrated with two kinds of hard combinatorial optimisation problems, which are Travelling Salesman Problem (TSP) and cutting path planning in nesting. And then, the superior performance of the hybrid μGAs is demonstrated for two types of nesting problems.

Original languageEnglish
Pages230-235
Number of pages6
Publication statusPublished - Dec 1 2002
EventProceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference - Kitakyushu, Japan
Duration: May 26 2002May 31 2002

Other

OtherProceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference
CountryJapan
CityKitakyushu
Period5/26/025/31/02

Fingerprint

Combinatorial optimization
Genetic algorithms
Traveling salesman problem
Motion planning
Mathematical operators

All Science Journal Classification (ASJC) codes

  • Energy Engineering and Power Technology
  • Ocean Engineering
  • Mechanical Engineering

Cite this

Kim, Y., Gotoh, K., Toyosada, M., & Park, J. (2002). Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems. 230-235. Paper presented at Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference, Kitakyushu, Japan.

Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems. / Kim, Yunyoung; Gotoh, Koji; Toyosada, Masahiro; Park, Jewoong.

2002. 230-235 Paper presented at Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference, Kitakyushu, Japan.

Research output: Contribution to conferencePaper

Kim, Y, Gotoh, K, Toyosada, M & Park, J 2002, 'Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems', Paper presented at Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference, Kitakyushu, Japan, 5/26/02 - 5/31/02 pp. 230-235.
Kim Y, Gotoh K, Toyosada M, Park J. Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems. 2002. Paper presented at Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference, Kitakyushu, Japan.
Kim, Yunyoung ; Gotoh, Koji ; Toyosada, Masahiro ; Park, Jewoong. / Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems. Paper presented at Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference, Kitakyushu, Japan.6 p.
@conference{784ebca666a843ef8f8f1abe4f82f25e,
title = "Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems",
abstract = "The current research to find near-optimum solution(s) explores in a small population, which is coined as Micro-Genetic Algorithms (μGAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the μGAs work with encoding population and are implemented serially. The major difference between SGAs and μGAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement hybrid μGAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as a new strategic conception for hybrid μGAs. It is shown that the general μGAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior performance of the general μGAs is demonstrated with two kinds of hard combinatorial optimisation problems, which are Travelling Salesman Problem (TSP) and cutting path planning in nesting. And then, the superior performance of the hybrid μGAs is demonstrated for two types of nesting problems.",
author = "Yunyoung Kim and Koji Gotoh and Masahiro Toyosada and Jewoong Park",
year = "2002",
month = "12",
day = "1",
language = "English",
pages = "230--235",
note = "Proceedings of the Twelfth (2002) International Offshore and Polar Engineering Conference ; Conference date: 26-05-2002 Through 31-05-2002",

}

TY - CONF

T1 - Micro-Genetic Algorithms(μGAs) for Hard Combinatorial Optimisation Problems

AU - Kim, Yunyoung

AU - Gotoh, Koji

AU - Toyosada, Masahiro

AU - Park, Jewoong

PY - 2002/12/1

Y1 - 2002/12/1

N2 - The current research to find near-optimum solution(s) explores in a small population, which is coined as Micro-Genetic Algorithms (μGAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the μGAs work with encoding population and are implemented serially. The major difference between SGAs and μGAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement hybrid μGAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as a new strategic conception for hybrid μGAs. It is shown that the general μGAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior performance of the general μGAs is demonstrated with two kinds of hard combinatorial optimisation problems, which are Travelling Salesman Problem (TSP) and cutting path planning in nesting. And then, the superior performance of the hybrid μGAs is demonstrated for two types of nesting problems.

AB - The current research to find near-optimum solution(s) explores in a small population, which is coined as Micro-Genetic Algorithms (μGAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the μGAs work with encoding population and are implemented serially. The major difference between SGAs and μGAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement hybrid μGAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as a new strategic conception for hybrid μGAs. It is shown that the general μGAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior performance of the general μGAs is demonstrated with two kinds of hard combinatorial optimisation problems, which are Travelling Salesman Problem (TSP) and cutting path planning in nesting. And then, the superior performance of the hybrid μGAs is demonstrated for two types of nesting problems.

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

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

M3 - Paper

AN - SCOPUS:1842530096

SP - 230

EP - 235

ER -