Combinatorial Reverse Auctions in Construction Procurement
Construction procurement often involves negotiations between many parties over multitudes of components. The process of allocating contracts to suppliers is generally a complex process involving multiple decision makers processing large amounts of information. Minimizing project costs while meeting...
| Main Author: | |
|---|---|
| Format: | Other |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/1721.1/117609 |
| _version_ | 1826205760274563072 |
|---|---|
| author | Al Shaqsi, Salim |
| author_facet | Al Shaqsi, Salim |
| author_sort | Al Shaqsi, Salim |
| collection | MIT |
| description | Construction procurement often involves negotiations between many parties over multitudes of components. The process of allocating contracts to suppliers is generally a complex process involving multiple decision makers processing large amounts of information. Minimizing project costs while meeting stringent specification and schedule requirements is especially difficult. In most cases, procurement processes do not consider combinatorial (or package) bids from suppliers. Allowing combinatorial bidding in the procurement process has been shown to reduce costs in other industries. It can, therefore, be expected to reduce costs in construction. This research proposes the use of combinatorial reverse auctions to minimize construction costs. Various models were applied to real data to determine feasibility compared to the baseline of allocating all items to the lowest bidder. Data included seven scenarios selected based on the number of suppliers and number of items. Each scenario included a subset of bids submitted by approved suppliers. A sensitivity analysis was performed on each model-scenario pair to consider uncertainty in supplier pricing structures. Results of the analysis provided justification for the use of combinatorial reverse auctions in construction procurements. Cumulative cost savings across all seven scenarios were 6.4% for unconstrained models and 2.7% for constrained models with limits on the number of awarded suppliers. Further analysis on the computation time and distribution of solutions across various methods indicated the superiority of the iterative approach to solving the winner determination problem in terms speed and optimality. However, stochastic and meta-heuristic approaches using a genetic algorithm led to higher variations in allocations while maintaining low variations in total cost. This suggests that they can be used to provide families of near-optimal solutions. |
| first_indexed | 2024-09-23T13:18:34Z |
| format | Other |
| id | mit-1721.1/117609 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:18:34Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | mit-1721.1/1176092019-04-12T17:04:23Z Combinatorial Reverse Auctions in Construction Procurement Al Shaqsi, Salim Construction procurement often involves negotiations between many parties over multitudes of components. The process of allocating contracts to suppliers is generally a complex process involving multiple decision makers processing large amounts of information. Minimizing project costs while meeting stringent specification and schedule requirements is especially difficult. In most cases, procurement processes do not consider combinatorial (or package) bids from suppliers. Allowing combinatorial bidding in the procurement process has been shown to reduce costs in other industries. It can, therefore, be expected to reduce costs in construction. This research proposes the use of combinatorial reverse auctions to minimize construction costs. Various models were applied to real data to determine feasibility compared to the baseline of allocating all items to the lowest bidder. Data included seven scenarios selected based on the number of suppliers and number of items. Each scenario included a subset of bids submitted by approved suppliers. A sensitivity analysis was performed on each model-scenario pair to consider uncertainty in supplier pricing structures. Results of the analysis provided justification for the use of combinatorial reverse auctions in construction procurements. Cumulative cost savings across all seven scenarios were 6.4% for unconstrained models and 2.7% for constrained models with limits on the number of awarded suppliers. Further analysis on the computation time and distribution of solutions across various methods indicated the superiority of the iterative approach to solving the winner determination problem in terms speed and optimality. However, stochastic and meta-heuristic approaches using a genetic algorithm led to higher variations in allocations while maintaining low variations in total cost. This suggests that they can be used to provide families of near-optimal solutions. 2018-09-04T15:26:35Z 2018-09-04T15:26:35Z 2018 Other http://hdl.handle.net/1721.1/117609 en_US application/pdf |
| spellingShingle | Al Shaqsi, Salim Combinatorial Reverse Auctions in Construction Procurement |
| title | Combinatorial Reverse Auctions in Construction Procurement |
| title_full | Combinatorial Reverse Auctions in Construction Procurement |
| title_fullStr | Combinatorial Reverse Auctions in Construction Procurement |
| title_full_unstemmed | Combinatorial Reverse Auctions in Construction Procurement |
| title_short | Combinatorial Reverse Auctions in Construction Procurement |
| title_sort | combinatorial reverse auctions in construction procurement |
| url | http://hdl.handle.net/1721.1/117609 |
| work_keys_str_mv | AT alshaqsisalim combinatorialreverseauctionsinconstructionprocurement |