Ein Pareto-Optimierungsverfahren für ein mehrkriterielles Gewinnerermittlungsproblem in einer kombinatorischen Transportausschreibung

@inproceedings{Buer2008EinPF,
  title={Ein Pareto-Optimierungsverfahren f{\"u}r ein mehrkriterielles Gewinnerermittlungsproblem in einer kombinatorischen Transportausschreibung},
  author={Tobias Buer and G. Pankratz},
  year={2008}
}
This paper extends the NP-hard Winner Determination Problem of Combinatorial Reverse Auctions in a scenario based on the procurement of transportation services. In addition to the common goal of minimizing the total cost of all selected bids, a second objective aims at maximizing the expected carrier performance in the transportation network. Without any a priori preference information a GRASP-based algorithm uses the notion of Pareto dominance to take care of both objectives simultaneously… CONTINUE READING