{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-4925"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-4925","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions","abstract":"In 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.","abstract_html":"In 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.","abstract_has_math":false,"creators":["Kiser, Jennifer"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018-08-01T07:00:00Z","date_published":"2018-08-01T07:00:00Z","updated_at":"2026-11-19T07:55:46Z","subjects":["operations research","optimization","stochastic programming","logistical tender","Applied Mathematics","Mathematics","Operational Research"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3460","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3460","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/4925/viewcontent/KiserJ080118f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-4925","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Kiser, Jennifer"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2018-07-16T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["operations research","optimization","stochastic programming","logistical tender","Applied Mathematics","Mathematics","Operational Research"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/4925/viewcontent/KiserJ080118f.pdf","https://dc.etsu.edu/etd/3460"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In 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."]},{"key":"dc:title","label":"Title","values":["Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions"]}]}],"canonical_facts":{"dc:creator":["Kiser, Jennifer"],"dc:date.available":["2018-07-16T07:00:00Z"],"dc:date.issued":["2018-08-01T07:00:00Z"],"dc:description.abstract":["In 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."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/4925/viewcontent/KiserJ080118f.pdf","https://dc.etsu.edu/etd/3460"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["operations research","optimization","stochastic programming","logistical tender","Applied Mathematics","Mathematics","Operational Research"],"dc:title":["Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:55:46Z"}