Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

AMAI
2004
Springer

favoriteEmaildiscussreport

100views Artificial Intelligence» more AMAI 2004»

Heuristics for a Brokering Set Packing Problem

14 years 4 months ago

Heuristics for a Brokering Set Packing Problem

Download rutcor.rutgers.edu

In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results are compared with a recent heuristic algorithm and also with the CPLEX Integer Programming solver where we found that the simulated annealing approach outperforms the previous heuristic method and CPLEX obtaining results within smaller timescales.

Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu

Real-time Traffic

AMAI 2004 | Artificial Intelligence | Heuristic | Simulated Annealing | Simulated Annealing Approach |

claim paper

Related Content

» A NonExact Approach and Experiment Studies on the Combinatorial Auction Problem

» Genetically designed heuristics for the bin packing problem

» Heuristics for a bidding problem

» A heuristic for the threedimensional strip packing problem

» Using a Lagrangian Heuristic for a Combinatorial Auction Problem

» Twodimensional packing problems A survey

» Multiobjective strip packing using an evolutionary algorithm

» Bounds and Heuristics for the Shortest Capacitated Paths Problem

» Packing triangles in low degree graphs and indifference graphs

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	AMAI
Authors	Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu

Comments (0)