Solving the Winner Determination Problem Using the genetic algorithm in python
The WDP is a problem where the goal is to accept a number of bids without conflict that maximize the profit. Each bid is an offer by a bidder on a set of items with a price and a conflict between two offers occur when an item is present in both of them, and in that case we must take only one of them.