.png){kind=icon}
Return
Variable Formulation Search for the Cutwidth Minimization Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2013.01.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many optimization problems are formulated as min-max problems where the objective function consist of minimizing a maximum value. In this case, it is usual that many solutions of the problem has associated the same value of the objective function. When this happens it is difficult to determine which solution is more promising to continue the search. In this paper we propose a new variant of the Variable Neighbourhood Search methodology to tackle this kind of problems. The new variant, named Variable Formulation Search, makes use of alternative formulations of the problem to determine which solution is more promising when they have the same value of the objective function in the original formulation. We do that in shaking, local search and neighbourhood change steps of the basic Variable Neighbourhood Search. We apply the new methodology to the Cutwidth Minimization Problem. Computational results show that our proposal outperforms previous algorithms in the state of the art in terms of quality and computing time. (c) 2013 Elsevier B.V. All rights reserved.
Keywords:
Variable Neighbourhood Search
Variable Formulation Search
Discrete optimization
Cutwidth Minimization Problem
Formulation Space Search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
ShareSaveReduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy.png)
Gut
GutIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more