Optimizing 2-opt-based heuristics on GPU for solving the single-row facility layout problem

The optimization of most combinatorial problems is NP-hard, which can be solved by heuristic algorithms to obtain approximately optimal solutions, especially for large-scale problems. Many heuristic algorithms can apply the 2-opt local search to find better solutions. In complete 2-opt local search,...

Full description

Bibliographic Details

Published in:	Future generation computer systems Vol. 126; pp. 91 - 109
Main Authors:	Sun, Xue, Chou, Ping, Koong, Chorng-Shiuh, Wu, Chao-Chin, Chen, Liang-Rui
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2022
Subjects:	2-opt local search Facility layout Graphic processing unit (GPU) Heuristic algorithm Simulated annealing Facility layout Heuristic algorithm 2-opt local search Graphic processing unit (GPU) Simulated annealing
ISSN:	0167-739X, 1872-7115
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!