Skip to main content
SpringerLink
Log in

A column generation method for inverse shortest path problems

  • Articles
  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

In this paper we formulate an inverse shortest path problem as a special linear programming problem. A column generation scheme is developed that is able to keep most columns of the LP model implicit and to generate necessary columns by shortest path algorithms. This method can get an optimal solution in finitely many steps. Some numerical results are reported to show that the algorithm has a good performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53:45–61

    Google Scholar 

  2. Burton D, Toint PhL (1994) On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming 63:1–22

    Google Scholar 

  3. Burton D, Pulleyblank B, Toint PhL (1993) The inverse shortest problem with upper bounds on shortest path costs. Internal Report FUNDP

  4. Burton D (1992) On the inverse shortest path problem. Doctoral Dissertation, Facultes Universitaires Notre-Dame de la Paix de Namur, Department de Mathematique, Namur, Belgium

    Google Scholar 

  5. Xu S, Zhang J: An inverse problem of the weighted shortest path problem. To appear in The Japan Journal of Industrial and Applied Mathematics

  6. Goldfarb D, Idnani A (1983) A numerical stable dual method for solving strictly convex quadratic programs. Mathematical Programming 27:1–33

    Google Scholar 

  7. Lasdon L (1970) Optimization theory with large systems. Mcmillan, New York

    Google Scholar 

  8. Bazaraa M, Jarvis M, Sherali H (1990) Linear programming and network flows. 2nd ed. Wiley, New York

    Google Scholar 

  9. Papadimitriou C, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, City University of Hong Kong, Hong Kong

    Jianzhong Zhang

  2. Institute of Systems Sciences, Academia Sinica, Beijing, China

    Zhongfan Ma

  3. Department of Mathematics, City University of Hong Kong, Hong Kong

    Chao Yang

Authors
  1. Jianzhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhongfan Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chao Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The authors gratefully acknowledge the partial support of Croucher Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, J., Ma, Z. & Yang, C. A column generation method for inverse shortest path problems. ZOR - Methods and Models of Operations Research 41, 347–358 (1995). https://doi.org/10.1007/BF01432364

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01432364

Key words

Search

Navigation