A Genetic Algorithm for a Bi-Objective Winner-Determination Problem in a Transportation-Procurement Auction

Buer, Tobias GND; Pankratz, Giselher GND

This paper introduces a bi-objective winner-determination problem and presents a multiobjective genetic algorithm to solve it. The problem examined arises in the procurement of transportation contracts via combinatorial auctions. It is modeled as an extension to the set-covering problem and considers the minimization of the total procurement costs and the maximization of the service-quality level of the execution of all transportation contracts tendered. To solve the problem, a multiobjective genetic algorithm is used. Different operators for population initialization, mutation and repair are applied. Eight variants of the algorithm are tested using a set of 30 new benchmark instances. The results indicate that the quality of a solution depends largely on the initialization heuristic and suggest also that a well- balanced combination of different operators is crucial to obtain good solutions.

Vorschau

Zitieren

Zitierform:

Buer, Tobias / Pankratz, Giselher: A Genetic Algorithm for a Bi-Objective Winner-Determination Problem in a Transportation-Procurement Auction. Hagen 2009. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe