Multiobjective combinatorial auctions in transportation procurement (Q1719461): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q57932166, #quickstatements; #temporary_batch_1704735187142
Property / Wikidata QID
 
Property / Wikidata QID: Q57932166 / rank
 
Normal rank

Revision as of 18:37, 8 January 2024

scientific article
Language Label Description Also known as
English
Multiobjective combinatorial auctions in transportation procurement
scientific article

    Statements

    Multiobjective combinatorial auctions in transportation procurement (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: This paper presents a multiobjective winner determination combinatorial auction mechanism for transportation carriers to present multiple transport lanes and bundle the lanes as packet bids to the shippers for the purposes of ocean freight. This then allows the carriers to maximize their network of resources and pass some of the cost savings onto the shipper. Specifically, we formulate three multi-objective optimization models (weighted objective model, preemptive goal programming, and compromise programming) under three criteria of cost, marketplace fairness, and the marketplace confidence in determining the winning packages. We develop solutions on the three models and perform a sensitivity analysis to show the options the shipper can use depending on the existing conditions at the point of awarding the transport lanes.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references