In combinatorial auctions, solving the bid generation problem (BGP) for bidders is critical to achieving efficiency. However, in the recent surge of combinatorial auction research, little attention has been paid to the BGP. In this paper, the BGP faced by transportation service providers is studied. First, the bidder's optimality criterion of a combinatorial bid is clarified, and then the focus is on the bundling method when an OR bid language is used. Through examples, bundles generated by solving the optimal truck routing problem were examined, and it was found that the resulting bid might not be optimal. This heuristic is compared with a simple nearest insertion method. The simulation result shows that whereas the former outperforms the latter in most cases, many times the latter outperforms the former by 5% to 8%.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Combinatorial Bid Generation Problem for Transportation Service Procurement


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:
    Wang, Xiubin (author) / Xia, Mu (author)


    Publication date :

    2005-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Combinatorial Bid Generation Problem for Transportation Service Procurement

    Wang, Xiubin / Xia, Mu | Transportation Research Record | 2005


    Combinatorial Bid Generation Problem for Transportation Service Procurement

    National Research Council (U.S.) | British Library Conference Proceedings | 2005




    Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective

    Song, Jiongjiong / Regan, Amelia | Transportation Research Record | 2003