.png){kind=icon}
Return
Parallel deterministic local search heuristic for minimum latency problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-020-03173-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Minimum latency problem (MLP) is an NP-Hard combinatorial optimization problem. Metaheuristics use perturbation and randomization to arrive at a satisfactory solution under time constraints. The current work uses deterministic local search heuristic (DLSH) to identify a satisfactory solution without setting up metaheuristic parameters. A move evaluation procedure is proposed for the swap approach which computes a move in O(1) order. Additionally, GPU-based parallel deterministic local search heuristic (PDLSH) is also proposed. PDLSH parallelizes the solution improvement phase and solves MLP for larger instances than the state-of-the-art. The DLSH and PDLSH implementations are tested on the TRP and TSPLIB standard instances. DLSH reaches new best solutions for five TSPLIB instances, namelyeil51, berlin52, pr107, rat195, andpr226. The proposed PDLSH achieves a speedup of up to 179.75 for the instances of size 10-11,849 nodes compared to its sequential counterpart.
Keywords:
Deterministic local search heuristic
Graphics processing unit (GPU)
Minimum latency problem
Speedup
TRP
TSPLIB
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.1
Papers:
5.1K
Citations:
7.5K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveEquity Measurement of Public Sports Space in Central Urban Areas Based on Residential Scale Data
OAAI
OAAIShareSaveShareSave
View more