IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-8349-9777-7_7.html
   My bibliography  Save this book chapter

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

In: Intelligent Decision Support

Author

Listed:
  • Tobias Buer

    (FernUniversität in Hagen)

  • Giselher Pankratz

    (FernUniversität in Hagen)

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.

Suggested Citation

  • Tobias Buer & Giselher Pankratz, 2008. "Ein Pareto-Optimierungsverfahren für ein mehrkriterielles Gewinnerermittlungsproblem in einer kombinatorischen Transportausschreibung," Springer Books, in: Andreas Bortfeldt & Jörg Homberger & Herbert Kopfer & Giselher Pankratz & Reinhard Strangmeier (ed.), Intelligent Decision Support, pages 113-135, Springer.
    • Handle: RePEc:spr:sprchp:978-3-8349-9777-7_7
    DOI: 10.1007/978-3-8349-9777-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-8349-9777-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.