.png){kind=icon}
Return
A concurrent processing framework for the set partitioning problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(01)00037-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A scheme for domain decomposition of the set partitioning problem is presented. Similar to the exploitation of special structure to improve algorithm performance, special structure can be exploited to divide the set partitioning problem into smaller subproblems. Real-world set partitioning problems from the airline industry are used to study the potential advantages of solving multiple subproblems to identify optimal solutions. The results of the study show,, that the decomposition is especially successful when applied to large problems that are difficult when solved using a single processor. For these cases, decomposition vas able to produce smaller problems that. in the majority of cases. were far easier to solve than the original problem. Also, optimal solutions were identified in significantly less time than the time taken to solve the original problem. The results Suggest that concurrent processing of subproblems should be investigated as an alternative method for solving large set partitioning problems typically encountered in real-world applications.
Keywords:
set partitioning
domain decomposition
concurrent processing
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.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more