 Ein Pareto-Optimierungsverfahren für ein mehrkriterielles Gewinnerermittlungsproblem in einer kombinatorischen TransportausschreibungTobias Buer () and
Giselher Pankratz ()
A chapter in Intelligent Decision Support, 2008, pp 113-135 from Springer Abstract: Abstract 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. Variants of this procedure are evaluated by means of 810 generated test instances. Those procedures which consider both objectives during construction stage but only one objective in the local search stage offer the best performance in terms of solution quality, robustness and computing time. Keywords: multi-objective WDP; transportation procurement auction; carrier performance; Pareto optimization; GRASP (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-8349-9777-7_7 Ordering information: This item can be ordered from DOI: 10.1007/978-3-8349-9777-7_7 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.