A mapping technique for better solution exploration: NSGA-II adaptation - Archive ouverte HAL Access content directly
Journal Articles Journal of Heuristics Year : 2016

A mapping technique for better solution exploration: NSGA-II adaptation

(1) , (1) , (1)
1

Abstract

A mapping method (MaM) for a better solution space exploration adapted to NSGA-II method is presented. The Mapping technique divides the solution space into several zones using a Hamming distance to a reference solution. We present a bijective mapping function from the search space to the binary representation space of solutions. For each zone, a mapping metric is used to evaluate the solution space exploration. According to this evaluation, a local search is performed. The mapping is adapted to the well known non-dominated sorting genetic algorithm-II (NSGA-II) method applied to solve the flexible job shop problem (FJSP) case. We present the comparison between the hybridization using the local search for the non-dominated solutions and the hybridization using the mapping metrics. The multi-objective metrics show the efficiency of mapping adaptation in terms of convergence and diversity.
Not file

Dates and versions

hal-02477225 , version 1 (13-02-2020)

Identifiers

Cite

Julien Autuori, Faicel Hnaien, Farouk Yalaoui. A mapping technique for better solution exploration: NSGA-II adaptation. Journal of Heuristics, 2016, 22 (1), pp.89-123. ⟨10.1007/s10732-015-9303-4⟩. ⟨hal-02477225⟩

Collections

CNRS UTT LOSI
15 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More