FASTER IMPLEMENTATION OF AN ITERATIVE IMPROVEMENT PROCEDURE FOR COLLECTTING WEIGHTED ITEMS IN DIRECTED BIPARTITE GRAPHS

Abstract

In this paper, a weighted item collecting problem in a directed bipartite graph is considered, where one finite set consists of items with profits and the other consists of players with costs. A budget constraint is imposed on the players with respect to the costs paid by them in an arc reversing strategy. The objective is to find a feasible arc reversing strategy which maximizes the total profit of collected items. The problem can be viewed as a generalization of a constrained via minimization in integrated circuit design automation. In this paper, a faster implementation of a heuristic algorithm based on simulated annealing is investigated. For this, some mathematical observations are first discussed. Then, the observations are utilized in an existing simulated annealing heuristic so as to make it run faster. Numerical experiments are conducted to demonstrate the presented implementation, and the results are reported.