期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 43, 期 2, 页码 173-191出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2005.01.004
关键词
transportation procurement; carrier bid generation; combinatorial auction; vehicle routing; branch and bound; integer programming decomposition
We consider the carrier's optimal bid generation problem in combinatorial auctions for transportation procurement. Bidders (carriers) employ vehicle routing models to identify sets of lanes (origin-destination pairs) based on the actual routes that a fleet of trucks will follow in order to maximize profit. Routes are constructed by optimally trading off repositioning costs of vehicles and the rewards associated with servicing lanes. The carrier optimization represents simultaneous generation and selection of routes and can incorporate any existing commitment. We employ both column generation and Lagrangian based techniques for solving the carrier optimization model and present numerical results. (c) 2005 Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据