Year: 2013
Type: article
Abstract: In the recent our paper, we proposed a new hybrid genetic algorithm (NHGA) for the job shop scheduling problem (JSP). The method of encoding we used was Natural coding instead of traditional binary coding. This manner of coding has a lot of advantages but its convergence is still an open issue for years. This paper analyzes the convergence properties of the NHGA by applied properties of Markov chain. Based on the Markov chain analysis of genetic algorithm, we point out the proposed method leads to convergence to the global optimum in case of Natural coding.
Authors: Lục Trí Tuyên, Nguyễn Hữu Mùi, Vũ Đình Hòa
Institutions: Viện Công nghệ Thông tin, Viện Công nghệ thông tin
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2042835540