Solving a reverse auction problem by bi-level distributed programming and genetic algorithm. (24th May 2011)

• Record Type: Journal Article
• Authors: Cheng, Chi-Bin; Lai, Young-Jou; Chan, Kun
• Is Part Of: International journal of revenue management. Volume 5:Number 2/3(2011)
• Page Start: 234
• Page End: 260
• Publication Date: 2011-05-24
• Subjects: revenue management -- reverse auctions -- e-procurement -- BLDP -- bi-level distributed programming -- negotiation -- fuzzy mathematical programming -- GAs -- genetic algorithms -- quantity allocation -- electronic procurement -- online procurement -- pricing -- scheduling; Revenue management -- Periodicals; Business enterprises -- Finance -- Periodicals; 658.1554
• Languages: English
• ISSNs: 1474-7332

Abstract

As globalisation and international sourcing prevail, constructing an optimal combination of diverse suppliers has become of great importance for meeting measurable objectives, such as on-time delivery, cost efficiency and risk mitigation. This paper presents a method for solving a sealed-bid, multi-issue, multi-sourcing reverse auction problem, where a buyer distributes his demand to multiple suppliers and each supplier responds by submitting a bid price to the buyer. The problem is formulated as a bi-level distributed programming model in which the buyer is an upper-level decision-maker, while suppliers at a lower level make decisions independently to each other. The negotiation process is facilitated via iterative exchanges of decision information between the buyer and suppliers. We used a genetic algorithm to establish an optimum quantity allocation at the upper level. In the lower level decision-making process, the concepts of revenue management are employed to coordinate pricing and (production) scheduling decisions. We also conducted three groups of simulation experiments to assess the quality of the proposed solution, as well as to examine its computational efficiency under various parameter settings. The results were consistent with the expectation.