A linear binary programming formulation is introduced to generate a solution for the cell formation problem using CPLEX. Numerical experimentation is completed with 35 benchmark problems to evaluate the quality of the solution generated with heuristic methods proposed in the literature. This experimentation indicates that for the smaller problems, the best-known solutions are the same as those ...

In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results are compared with a recent heuristic algorithm and also with the CPLEX Integer Programming solver where we found that the simulated annealing approach outperforms the previous heuristic method and CPLEX obtaining resul...

This thesis discusses the destruction of sheets of paper by manual tearing and evaluates two approaches for reconstruction of such pages by exact methods based on Integer Linear Programming. These methods operate solely on the shape of torn pieces of paper and reconstruct the borders of the paper sheets. For evaluation and tests within this problem domain, a tearing model of human paper tearing...

We present an optimization model for the yard allocation process in an automotive transshipment terminal. The cars arrive and depart by ships in large batches and the yard planners have to dynamically assign incoming cars to parking rows. The integer linear programming model has been implemented in a commercial solver (CPLEX). We will present at the conference the model, the CPLEX computational...

We developed a mixed integer linear programming model for an integrated decision problem of production, inventory, and transportation planning. Our model combines the direct shipment into the production, inventory, and distribution planning. The objective was to minimize the total operation cost which is comprised of production setup cost, inventory holding cost, transportation cost, and reorde...

In this paper we study a bidding problem which can be modelled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results sho...