Solving a Bi-Objective Winner Determination Problem in a Transportation Procurement Auction

This paper introduces a bi-objective winner determination problem which arises in the procurement oftransportation contracts via combinatorial auctions. The problem is modelled as an extension to the setcovering problem and considers the minimisation of the total procurement costs and the maximisation ofthe service-quality level of the execution of all transportation contracts tendered. To solve the problem,an exact branch–and–bound algorithm and eight variants of a multiobjective genetic algorithm are proposed.The algorithms are tested using a set of new benchmark instances which comply with importanteconomic features of the transportation domain.[...]

MoreLess

Year of publication:	2010-02-01
Authors:	Buer, Tobias ; Pankratz, Giselher
Institutions:	Fernuniversität <Hagen> / Lehrstuhl für Wirtschaftsinformatik
Subject:	Beschaffung \| supply \| Genetischer Algorithmus \| genetic algorithm \| Heuristik \| Heuristic Optimization \| Kombinatorik

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

1 Procurement of Transportation Contracts
2 A Bi-Objective Winner Determination Problem (2WDP-SC)
3 Solution Approaches for the Bi-Objective Winner DeterminationProblem
3.1 A Branch–and–Bound Algorithm Based on the Epsilon-constraint Method
3.2 A Genetic Algorithm Based on SPEA2
4 Evaluation
4.1 Generating Test Instances
4.2 Measuring the Quality of an Approximation Set
4.3 Evaluation of the eLookahead–Branch–and–Bound
4.4 Evaluation of the Genetic Algorithm
5 Conclusions and Outlook
References

Persistent link: https://www.econbiz.de/10005870646