English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

To support a freight carrier in a combinatorial transport auction, weproposes an exact and two heuristic strategies for bidding on subsets ofrequests. The exact bidding strategy is based on the concept of elementaryrequest combinations. We show that it is sufficient and necessary for a carrierto bid on each elementary request combination in order to guarantee the sameresult as bidding on each element of the powerset of the set of tenderedrequests. Both heuristic bidding strategies identify promising requestcombinations. For this, pairwise synergies based on saving values as well asthe capacitated p-median problem are used. The bidding strategies are evaluatedby a computational study that simulates an auction. It is based on 174benchmark instances and therefore easily extendable by other researchers. Onaverage, the two heuristic strategies achieve 91 percent and 81 percent of theavailable sales potential while generating 36 and only 4 percent of the bundlebids of the exact strategy. Therefore, the proposed bidding strategies help acarrier to increase her chance to win and at the same time reduce thecomputational burden to participate in a combinatorial transport auction.

An exact and two heuristic strategies for truthful bidding in combinatorial transport auctions