An optimization approach for winner determination problem considering transportation cost discounts

This study proposes a mixed-integer nonconvex programming (MINP) model for the winner determination problem (WDP) considering two discount functions in a combinatorial auction to save shipper’s transportation cost. For the WDP, the shipper allows carriers to submit bids for a bundle of lanes. Then t...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 80; no. 3; pp. 711 - 728
Main Authors:	Yang, Fang, Huang, Yao-Huei
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2021 Springer Springer Nature B.V
Subjects:	Combinatorial analysis Computer Science Computing time Cost control Discounts Linear programming Linearization Mathematics Mathematics and Statistics Mixed integer Operating costs Operations Research/Decision Theory Optimization Real Functions Transportation Mixed-integer nonconvex programming Big-M constraints Winner determination problem Discount function Branch-and-bound trees
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!