Multiobjective combinatorial auctions in transportation procurement
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.
- Carrier assignment models in transportation procurement
- Modeling the Pre Auction Stage The Truckload Case
- The stochastic bid generation problem in combinatorial transportation auctions
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- Fast synergy approximation in transportation procurement with combinatorial auctions
- Carrier assignment models in transportation procurement
- Goal programming and multiple objective optimizations. Part I
- Goal programming for decision making: An overview of the current state-of-the-art
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- Proper efficiency and the theory of vector maximization
- Shipper collaboration
- Vendor selection in outsourcing
- A multi-unit tender award process: The case of Transantiago
- A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic
- Transportation service procurement bid construction problem from less than truckload perspective
- An optimization approach for winner determination problem considering transportation cost discounts
- The stochastic bid generation problem in combinatorial transportation auctions
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- A sampling-based stochastic winner determination model for truckload service procurement
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- Auction model of shipowners' fraud-resistant for freight spread contracts
- Carrier assignment models in transportation procurement
- Fast synergy approximation in transportation procurement with combinatorial auctions
- A combinatorial auction‐based approach for ridesharing in a student transportation system
- Integrating production scheduling and transportation procurement through combinatorial auctions
- Pre-auction lane selection in an integrated production–distribution planning problem
- Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks
- An efficient bidding heuristic for simultaneous truckload transportation auctions
This page was built for publication: Multiobjective combinatorial auctions in transportation procurement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719461)
