Cooperation in Multiorganization Matching

International audienceWe study a problem involving a set of organizations. Each organization has its own pool of clients who either supply or demand one unit of an indivisible product. Knowing the profit induced by each buyer-seller pair, an organization’s task is to conduct such transactions within its database of clients in order to maximize the amount of the transactions. Inter-organizations transactions are allowed: in this situation, two clients from distinct organizations can trade and their organizations share the induced profit. Since maximizing the overall profit leads to unacceptable situations where an organization can be penalized, we study the problem of maximizing the overall profit such that no organization gets less than it can obtain on its own. Complexity results, an approximation algorithm and a matching inapproximation bound are given

A Multidimensional Multiple-Choice Knapsack Model for Resource Allocation in a Construction Equipment Manufacturer Setting Using an Evolutionary Algorithm

Part 2: Knowledge Discovery and SharingInternational audienceThis paper presents an approach to production resource allocation. The approach is applied to a real-world problem within the construction equipment manufacturing industry. A multidimensional knapsack problem formulated; was the proposed model being based on an evolutionary algorithm using a three-dimensional binary-coded chromosome. Various tests were carried out to show the appropriateness of the solution. The experiment results suggest to be satisfactory from the manufacturing company perspective