Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem

2017 ◽  
Author(s):  
Hajer Salhi ◽  
Bchira Ben Mabrouk ◽  
Zaher Mahjoub
Keyword(s):  
Performance Evaluation ◽  
Parallel Algorithm ◽  
Optimal Solutions ◽  
Partitioning Problem

scholarly journals New Methods for the Construction of Test Cases for Partitioning Heuristics

VLSI Design ◽  
1995 ◽  
Vol 3 (1) ◽  
pp. 93-98 ◽  
Author(s):  
Youssef Saab
Keyword(s):  
Integrated Circuits ◽  
Network Flow ◽  
Test Cases ◽  
Heuristic Methods ◽  
Optimal Solutions ◽  
Clustering Problem ◽  
New Methods ◽  
Fixed Dimension ◽  
Geometric Clustering ◽  
Partitioning Problem

Partitioning is an important problem in the design automation of integrated circuits. This problem in many of its formulation is NP-Hard, and several heuristic methods have been proposed for its solution. To evaluate the effectiveness of the various partitioning heuristics, it is desirable to have test cases with known optimal solutions that are as “random looking” as possible. In this paper, we describe several methods for the construction of such test cases. All our methods except one use the theory of network flow. The remaining method uses a relationship between a partitioning problem and the geometric clustering problem. The latter problem can be solved in polynomial time in any fixed dimension.

scholarly journals A PIONEERING AND COMPREHENSIVE DATABASE OF BALANCED AND UNBALANCED TRANSPORTATION PROBLEMS FOR READY PERFORMANCE EVALUATION OF EXISTING AND NEW METHODS

2020 ◽  
Vol 15 (11) ◽  
Author(s):  
Huzoor Bux Kalhoro
Keyword(s):  
Performance Evaluation ◽  
Optimal Solution ◽  
Test Problems ◽  
Optimal Solutions ◽  
Transportation Problems ◽  
North West ◽  
New Methods ◽  
Comprehensive Database ◽  
Solution Methods ◽  
Data Tables

In this paper, we present a comprehensive database of the data tables of some important transportation problems from literature, and experience with the proposition of new initial basic feasible (IBF) solution methods for the transportation problems. The paper contains a comprehensive database of 140 transportation problems, of which 103 are balanced, 25 are unbalanced and 12 are from research papers. The detailed description of the varying-nature test problems is described, and the optimal solutions of the 140 problems have been obtained by using the TORA software with the modified distribution (MODI) method. The algorithms of three methods: North-West-Corner (NWCM), Least cost (LCM) and Vogel’s approximation (VAM) have been used for IBF solutions. The final optimal results are also quoted for the ready reference of researchers and practitioners. The database of problems and their optimal solutions will be a great aid to researchers and practitioners working with the existing and new methods for solving transportation problems. A pioneering investigation of the performance evaluation of NWCM, LCM and VAM has also been conducted as a benchmark for the similar assessment of other existing and forthcoming IBF and /or optimal solution methods for the transportation problems.

Sign in / Sign up

Export Citation Format

Share Document