Return
A bilevel model and solution algorithm for a freight tariff-setting problem
DOI:10.1287/trsc.34.3.289.12299.png)
Abstract
En 中文
We consider a bilevel programming formulation of a freight tariff-setting problem where the leader consists in one among a group of competing carriers anal the follower is a shipper. At the upper level, the leader's revenue corresponds to the total tariffs levied, whereas the shipper minimizes its transportation cost, given the tariff schedule set by the leader. We propose for this problem a class of heuristic procedures whose relative efficiencies, on small problem instances, could be validated with respect to optimal solutions obtained from a mixed integer reformulation of the mathematical model. We also present numerical results on large instances that could not be solved to optimality by an exact method.
Keywords:
NETWORK
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K
Organization
No organization information available

