Industrial Engineering Journal ›› 2013, Vol. 16 ›› Issue (1): 45-49.

• articles • Previous Articles     Next Articles

A Quantum Evolutionary Algorithm-Based Bundling Optimization for Multi-item Procurements

  

  1. (1. Northeastern University, School of Information and Engineering, Shenyang 110819, China; 2. Shenyang Normal University, Department of Basic Computer and Mathematics, Shenyang 110034, China)
  • Online:2013-02-28 Published:2013-03-22

Abstract: The object bundling optimization problem in reverse combinatorial auctions for online procurements and large project tenders is addressed. A mathematical model with multi-objectives is proposed to solve the problem. Because of its nonlinear and non-analytic properties with variable sets, it is very difficult to solve. Thus, a Quantum Evolutionary Algorithm (QEA) is developed for its solution. It adopts the 0-1 encoding scheme with nonzero elements in the cost complementarity matrix, and the β-based rotation gate to enlarge the probability of selecting the better Q-bits. Numerical results from a number of examples show that the β-based rotation gate is evidently better than the α-based one. Compared with a contrastive genetic algorithm, QEA can achieve better computational performances for small- and middle-sized problems.

Key words: online procurement, combinatorial auction, object bundling, optimal auction design, quantum evolutionary computation, rotation gate