IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v34y2000i3p289-302.html
   My bibliography  Save this article

A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem

Author

Listed:
  • Luce Brotcorne

    (LAMIH, Université de Valenciennes, Le Mont Houy BP311, 59304 Valenciennes France, ISRO and SMG, Université libre de Bruxelles CP 210/01, Boulevard du Triomphe B-1050 Bruxelles, Belgium, and CRT, Université de Montréal, C.P. 6128 Succursale Centre-Ville, Montréal H3C 3J7, Canada)

  • Martine Labbé

    (ISRO and SMG, Université libre de Bruxelles CP 210/01, Boulevard du Triomphe B-1050 Bruxelles, Belgium)

  • Patrice Marcotte

    (CRT and DIRO, Université de Montréal, C.P. 6128 Succursale Centre-Ville, Montréal H3C 3J7, Canada)

  • Gilles Savard

    (GERAD and DMGI, École Polytechnique de Montréal, CP 6079 Succursale Centre-Ville, Montréal H3C 3A7, Canada)

Abstract

We consider a bilevel programming formulation of a freight tariff-setting problem where the leader consists in one among a group of competing carriers and 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.

Suggested Citation

  • Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2000. "A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem," Transportation Science, INFORMS, vol. 34(3), pages 289-302, August.
    • Handle: RePEc:inm:ortrsc:v:34:y:2000:i:3:p:289-302
    DOI: 10.1287/trsc.34.3.289.12299
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.34.3.289.12299
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.34.3.289.12299?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Patrick T. Harker, 1988. "Multiple Equilibrium Behaviors on Networks," Transportation Science, INFORMS, vol. 22(1), pages 39-46, February.
    2. Martine Labbé & Patrice Marcotte & Gilles Savard, 1998. "A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing," Management Science, INFORMS, vol. 44(12-Part-1), pages 1608-1622, December.
    3. W. J. Hurley & E. R. Petersen, 1994. "Nonlinear Tariffs and Freight Network Equilibrium," Transportation Science, INFORMS, vol. 28(3), pages 236-245, August.
    4. Terry L. Friesz & Joel A. Gottfried & Edward K. Morlok, 1986. "A Sequential Shipper-Carrier Network Model for Predicting Freight Flows," Transportation Science, INFORMS, vol. 20(2), pages 80-91, May.
    5. Caroline S. Fisk, 1986. "A Conceptual Framework for Optimal Transportation Systems Planning with Integrated Supply and Demand Models," Transportation Science, INFORMS, vol. 20(1), pages 37-47, February.
    6. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    7. Andrew V. Goldberg & Robert E. Tarjan, 1990. "Finding Minimum-Cost Circulations by Successive Approximation," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 430-466, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shibasaki, Ryuichi & Ieda, Hitoshi & Watanabe, Tomihiro, 2005. "An International Container Shipping Model in East Asia and its Transferability," Research in Transportation Economics, Elsevier, vol. 13(1), pages 299-336, January.
    2. Fernández L., J. Enrique & de Cea Ch., Joaquín & O., Alexandra Soto, 2003. "A multi-modal supply-demand equilibrium model for predicting intercity freight flows," Transportation Research Part B: Methodological, Elsevier, vol. 37(7), pages 615-640, August.
    3. Mustapha Bouhtou & Stan van Hoesel & Anton F. van der Kraaij & Jean-Luc Lutton, 2007. "Tariff Optimization in Networks," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 458-469, August.
    4. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2001. "A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network," Transportation Science, INFORMS, vol. 35(4), pages 345-358, November.
    5. Christine Tawfik & Sabine Limbourg, 2018. "Pricing Problems in Intermodal Freight Transport: Research Overview and Prospects," Sustainability, MDPI, vol. 10(9), pages 1-22, September.
    6. Avinash Unnikrishnan & Varunraj Valsaraj & Steven Waller, 2009. "Stochastic and Dynamic Shipper Carrier Network Design Problem," Networks and Spatial Economics, Springer, vol. 9(4), pages 525-550, December.
    7. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    8. Li, Xinyan & Xie, Chi & Bao, Zhaoyao, 2022. "A multimodal multicommodity network equilibrium model with service capacity and bottleneck congestion for China-Europe containerized freight flows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    9. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    10. Grigoriev, A. & van Hoesel, C.P.M. & van der Kraaij, A.F. & Uetz, M.J. & Bouhtou, M., 2004. "Pricing network edges to cross a river," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    11. Boile, Maria & Theofanis, Sotirios & Spasovic, Lazar, 2006. "The Role Of Various Players In The Port Industry – Theory And Practice," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208028, Transportation Research Forum.
    12. Casavant, Ken & Jessup, Eric, 2005. "What Makes them Viable? Determining the Attributes that Offer Potential Viability to Inter-Modal Truck-Rail Facilities in Washington State," 46th Annual Transportation Research Forum, Washington, D.C., March 6-8, 2005 208221, Transportation Research Forum.
    13. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    14. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    15. Çiğdem Güler & Horst W. Hamacher, 2010. "Capacity inverse minimum cost flow problem," Journal of Combinatorial Optimization, Springer, vol. 19(1), pages 43-59, January.
    16. Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
    17. He, Fang & Yin, Yafeng & Shirmohammadi, Nima & Nie, Yu (Marco), 2013. "Tradable credit schemes on networks with mixed equilibrium behaviors," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 47-65.
    18. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
    19. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    20. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:34:y:2000:i:3:p:289-302. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.