East Tennessee State University
Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions
Abstract
dc:description.abstractIn business-to-business logistical sourcing events, companies regularly use a bidding process known as tendering in the procurement of transportation services from third-party providers. Usually in the form of an auction involving a single buyer and one or more sellers, the buyer must make decisions regarding with which suppliers to partner and how to distribute the transportation lanes and volume among its suppliers; this is equivalent to solving the optimization problem commonly referred to as the Winner Determination Problem. In order to take into account the complexities inherent to the procurement problem, such as considering a supplier’s network, economies of scope, and the inclusion of business rules and preferences on the behalf of the buyer, we present the development of a mixed-integer linear program to model the reverse combinatorial auction for logistical tenders.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Thesis - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Grantor dc:publisher
- East Tennessee State University
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kiser, Jennifer
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/3460