GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions
The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.
Year of publication: |
2010-10-29
|
---|---|
Authors: | Buer, Tobias ; Pankrat, Giselher |
Institutions: | Verband der Hochschullehrer für Betriebswirtschaft |
Published in: |
Saved in:
freely available
Saved in favorites
Similar items by person
-
The Monotonicity Puzzle:An Experimental Investigation of IncentiveStructures
Brosig, Jeannette, (2010)
-
A Simple Accounting-based Valuation Model for the Debt Tax Shield
Scholze, Andreas, (2010)
-
Investigating Research Streams of Conjoint Analysis: A Bibliometric Study
Teichert, Thorsten, (2010)
- More ...