An Asynchronous Heuristic Algorithm for Generalized Mutual Assignment Problem: Gossip-based Approach

Abstract

An asynchronous gossip-based Lagrangian heuristic algorithm is proposed for Generalized Mutual Assignment Problem (GMAP) which is a combinatorial maximization problem in distributed environments. Lagrangian decomposition based formulation is introduced for GMAP in order to apply the asynchronous gossip algorithm. This enables us to obtain a feasible solution with quality bounds.