Heuristics for a Bidding Problem

Publication Type

Journal Article

Publication Date

8-2006

Abstract

In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results show that the heuristic outperforms CPLEX and Casanova.

Keywords

Artificial intelligence, Bidding, Heuristics

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Computers and Operations Research

Volume

33

Issue

8

First Page

2179

Last Page

2188

ISSN

0305-0548

Identifier

10.1016/j.cor.2005.01.007

Publisher

Elsevier

Additional URL

https://doi.org/10.1016/j.cor.2005.01.007

Link to Full Text

Share

COinS