Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem

被引：1

作者：

Faria, Alexandre Frias ^{[1
]}

de Souza, Sergio Ricardo ^{[1
]}

de Sa, Elisangela Martins ^{[1
]}

Silva, Carlos Alexandre ^{[2
]}

机构：

[1] Ctr Fed Educ Tecnol Minas Gerais, Av Amazonas 7675, BR-30510000 Belo Horizonte, MG, Brazil

[2] Inst Fed Educ Tecnol Minas Gerais, Av Serra da Piedade 299, BR-4515640 Sabara, MG, Brazil

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2019年 / 346卷

关键词：

Combinatorial Optimization; Multi-Way Number Partitioning Problem; Variable Neighborhood Descent Branching; Matheuristics;

D O I：

10.1016/j.entcs.2019.08.039

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents an application of the Variable Neighborhood Descent Branching method to solve the Multi-Way Number Partitioning Problem. This problem consists of distributing the elements of a given sequence into k disjoint subsets such that the sums of each subset elements fit in the shortest interval. It shows a new method to decompose the MWNPP in n-1 subproblems using local branching constraints. This decomposing justifies the neighborhood structure used in the proposed algorithm. The study of parameter settings defines the operation of the proposed algorithm. The results shows that there is no statistically significant difference of objective value between proposed algorithm and mathematical model solved by CPLEX, but the time used by both methods are significantly different.

引用

页码：437 / 447

页数：11

共 50 条

[21] A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem
Martins, Ivan C.
Pinheiro, Rian G. S.
Protti, Fabio
Ochi, Luiz S.
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (22) : 8947 - 8955
[22] A TABLE-DRIVEN SYSTEM CONTROLLER WITH MULTI-WAY BRANCHING
DVORAK, V
[J]. MICROPROCESSING AND MICROPROGRAMMING, 1988, 23 (1-5): : 9 - 13
[23] Multi-way FPGA partitioning by fully exploiting design hierarchy
Fang, WJ
Wu, ACH
[J]. DESIGN AUTOMATION CONFERENCE - PROCEEDINGS 1997, 1997, : 518 - 521
[24] Iterative improvement based multi-way netlist partitioning for FPGAs
Krupnova, H
Saucier, G
[J]. DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION 1999, PROCEEDINGS, 1999, : 587 - 594
[25] An efficient multi-way algorithm for balanced partitioning of VLSI circuits
Tan, X
Tong, J
Tan, P
Park, N
Lombardi, F
[J]. INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1997, : 608 - 613
[26] A memory allocation and assignment method using multi-way partitioning
Kim, N
Peng, R
[J]. IEEE INTERNATIONAL SOC CONFERENCE, PROCEEDINGS, 2004, : 143 - 144
[27] An evaluation of move-based multi-way partitioning algorithms
Yarack, E
Carletta, J
[J]. 2000 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS, 2000, : 363 - 369
[28] A simple boosting algorithm using multi-way branching decision trees
Hatano, K
[J]. THEORY OF COMPUTING SYSTEMS, 2004, 37 (04) : 503 - 518
[29] A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees
Kohei Hatano
[J]. Theory of Computing Systems, 2004, 37 : 503 - 518
[30] GRASP with Variable Neighborhood Descent for the online order batching problem
Sergio Gil-Borrás
Eduardo G. Pardo
Antonio Alonso-Ayuso
Abraham Duarte
[J]. Journal of Global Optimization, 2020, 78 : 295 - 325

← 1 2 3 4 5 →