The stochastic bid generation problem in combinatorial transportation auctions

DOI10.1016/J.EJOR.2013.06.013zbMATH Open1304.91087OpenAlexW2098028485MaRDI QIDQ2514752FDOQ2514752

Authors: Chefi Triki, Simona-Vasilica Oprea, Patriza Beraldi, Teodor Gabriel Crainic 

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.013

Recommendations

• The auction algorithm for the transportation problem
• Multiobjective combinatorial auctions in transportation procurement
• Fast synergy approximation in transportation procurement with combinatorial auctions
• scientific article; zbMATH DE number 1488060
• Location-based techniques for the synergy approximation in combinatorial transportation auctions
• An efficient bidding heuristic for simultaneous truckload transportation auctions
• Transportation problem with multi-choice cost and demand and stochastic supply
• A stochastic approximation method to compute bid prices in network revenue management problems
• A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic

zbMATH Keywords

auctions/biddingprobabilistic constraintstruckload procurement

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Transportation, logistics and supply chain management (90B06)

Cites Work

• Combinatorial auctions: a survey
• Combinatorial auctions. Foreword by Vernon L. Smith.
• Modeling the Pre Auction Stage The Truckload Case
• Auctions with bidder-determined allowable combinations
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• Combinatorial auctions
• The practice of supply chain management: Where theory and application converge.
• Iterative Combinatorial Auctions with Bidder-Determined Combinations
• Auctions, bidding and exchange design
• The lane covering problem with time windows

Cited In (24)

• Properties of bundle valuations in carrier collaboration
• The cross-entropy method for the winner determination problem in combinatorial auctions
• Carrier assignment models in transportation procurement
• Encroachment and canvassing strategy in a sea-cargo service chain with empty container repositioning
• A sampling-based stochastic winner determination model for truckload service procurement
• An efficient bidding heuristic for simultaneous truckload transportation auctions
• Request evaluation strategies for carriers in auction-based collaborations
• Online crowdsourced truck delivery using historical information
• Pre-auction lane selection in an integrated production–distribution planning problem
• Non-monetary coordination mechanisms for time slot allocation in warehouse delivery
• Integrating production scheduling and transportation procurement through combinatorial auctions
• Linearization technique with superior expressions for centralized planning problem with discount policy
• A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions
• Modeling and analysis of an auction-based logistics market
• Location-based techniques for the synergy approximation in combinatorial transportation auctions
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• Fast synergy approximation in transportation procurement with combinatorial auctions
• The auction algorithm for the transportation problem
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
• Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks
• A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic
• Multiobjective combinatorial auctions in transportation procurement
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
• Transportation service procurement bid construction problem from less than truckload perspective

This page was built for publication: The stochastic bid generation problem in combinatorial transportation auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514752)