Arindam Sinharay

A New Meta-Heuristic PSO Algorithm for Resource Constraint Project Scheduling Problem

In this paper a meta heuristic Particle Swarm Optimization (PSO)-based approach for the solution of the resource-constrained project scheduling problem with the purpose of minimizing project time has been developed. In order to evaluate the performance of the PSO based approach for the resource-constrained project scheduling problem, computational analyses are given. As per the results the application of PSO to project scheduling is achievable.

An introduction towards automated parameterization reduction of soft set

In this paper, we introduce seven correlated algorithms for reduction of decision making parameters. This reduction framework is heuristic function based. The reduction of soft set decision parameters, those are collectively sufficient and individually necessary for keeping any special characteristic of a given information system. There has been very few works done on the algorithmic reduction techniques of decision parameter of soft set To the best of our knowledge, the computing complexities of available methods are of exponential order. We claim that our method is the first such kind of algorithms having polynomial time of computation. Illustrative example demonstrates the process elaborately.

Algorithm of 2D-Voronoi diagram construction with rectangular block

With a given set of points, Voronoi diagram is a technique of partitioning a plane into set of points having the same closest sites. A number of studies are made on the generalization of Voronoi diagram. These studies are mainly conducted on different kind of distance metric. Some studies are also made upon Voronoi diagram of sites those are not necessarily points. The current researchers present a new generalization of the construction of Voronoi diagram in the plane with axes parallel rectangles. Here, the interest has been shifted from points to simple convex orthogonal blocks i.e. rectangles. The current researchers have computed the partition of the set of the rectangles in the plane into sets of lines having the same closest sites (where sites are rectangles in the plane. This paper represents a method to find the Voronoi diagram, which considered rectangles as sites. Prototype implementation has been done and the results are quite encouraging. The algorithm is easy to implement and finds application in VLSI layouts.

Introduction to soft-set theoretic solution of project selection problem

Purpose The purpose of this paper is to introduce a model of decision-making problem in multi-criteria optimization domain for project selection. The model is built by combining the soft set theory and analytic hierarchical model under fuzziness. Soft set model gives us the opportunity to use parameterization properties. Here, the authors have proved that multiple alternatives can be reduced to make the selection process computationally efficient. Here, the authors illustrate the hybrid method by means of an application of the new mathematical model of soft set theory. Design/methodology/approach This paper is designed to excel a decision support system with multiple criteria analysis tool, analytic hierarchy process combined with soft set theory under fuzziness. Findings In this paper, the authors have taken four projects P1, P2, P3 and P4. As per chosen parameters of softest theory the result of the illustrative example reveals that P2 is the best project. The ranking the authors get is in the order of P2, P3, P4 and P1. The algorithm leads the authors to maximize the proper choice in the environment of imprecise information. The main advantage of this method compare to others is that this hybrid method is very simple in terms of calculation and the computational complexity of the proposed algorithm is low. Originality/value This proposed decision support strategy for an intended project manager helped to take decision in the perspective environment.

A computational geometry based cell migration technique for VLSI placement problem

The movement of preplaced cells among a prescribed existing placement to solve a set of worst designed placement related facts - for example, routing problems, timings, integrity of signals and distribution of heat. To solve this design related problems one has to prefer to translate the design. The translation should be as small as possible while retaining the originality of the placement integrity. The current paper proposes a new algorithmic treatment of the above problem through computational geometry. Our theoretical proposals established through experimental proofs.

An ε- Optimal Strategy of Algorithmic Game Theory for Project Selection under Fuzziness

Software project success or failure depends on the ineffective software project management. Success or failure of any project can be attributed by incorrect handling of one or more project variables such as people, proper technology, proper project scheduling and selection. Among these attributes proper project selection is one of the most vital part of software project management. There exist many uncertainties in project management and current software engineering techniques are unable to eliminate them. So there is huge scope for developing. The current researchers have developed a unique model which is capable to take decision on the field of software project selection. This model has two embedded sub models namely fuzzy AHP (Analytic Hierarchy Process) and strategic game model. Here in the first case experts opinions are considered under fuzzy environment and in the second case, different decisions makers act as players in the game module. Different criteria are taken into consideration for choosing optimal strategy of the players. An elaborated case study is also analyzed for testing the output of the system.