Informatica

This paper investigates the problem of partitioning a complete weighted graph into complete subgraphs, each having the same number of vertices, with the objective of minimizing the sum of edge weights of the resulting subgraphs. This NP-complete problem arises in many applications such as assignment and scheduling-related group partitioning problems and micro-aggregation techniques. In this paper, we present a mathematical programming model and propose a complementary column generation approach to solve the resulting model. A dual based lower bounding feature is also introduced to curtail the notorious tailing-off effects often induced when using column generation methods. Computational results are presented for a wide range of test problems.

This paper presents an optimization based mathematical modelling approach for a single source single destination crude oil facility location transshipment problem. We began by formulating a mixed-integer nonlinear programming model and use a rolling horizon heuristic to find an optimal location for a storage facility within a restricted continuous region. We next design a hybrid two-stage algorithm that combines judicious facility locations resulting from the proposed model into a previously developed column generation approach. The results indicate that improved overall operational costs can be achieved by strategically determining cost-effective locations of the transshipment facility.