By Topic

A transportation service procurement problem with combinatorial auction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tian Tian ; Dept. of Manage. Sci., City Univ. of Hong Kong, Hong Kong, China ; Ning Wang ; Hong Ma ; Lim, A.

This paper discusses a practical transportation service procurement problem, which is originated from an external project with the department of transportation purchasing at Royal Philips. A combinatorial auction strategy is developed to help the department to determine the annual transportation service procurement cost. Because of a few preset internal and external policies, to settle an optimal purchasing plan becomes a challenging job for the company. We formulate this problem into a linear integer programming model, and prove it is MV-Hard. We also find that the integer programming model is only solvable for very small cases with only a few lanes, bidders and bids using the state-of-the-art commercial solver ILOG CPLEX 11. We propose an iterative rounding heuristic algorithm that works on the linear-relaxation of the integer programming model. Experiments show that good-quality solutions are achieved for instances of moderate size.

Published in:

Service Systems and Service Management (ICSSSM), 2011 8th International Conference on

Date of Conference:

25-27 June 2011