Skip to main content
SpringerLink
Log in

Optimal Passenger Transportation Planning in a Regional Air Network

  • Published:
Mathematical Models and Computer Simulations Aims and scope

Abstract

The problem of optimizing air passenger transport schedules is investigated. It is required to minimize renting and operating costs taking into account heterogeneous fleet, the possibility of multiple visits to the same location, inaccessibility of specified air corridors, etc. Two formalizations of this problem are presented in the form of multi-index problems of binary linear programming and mixed-integer linear programming (depending on whether the time periods of airports accessibility are taken into account). In the future, based on the constructed analytical model, algorithms for estimating globally optimal schedules can be developed.

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

Fig. 1.

Similar content being viewed by others

REFERENCES

  1. P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, 2002).

  2. K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Comput. Ind. Eng. 99, 300–313 (2016).

    Article  Google Scholar 

  3. D. Cattaruzza, N. Absi, and D. Feillet, “Vehicle routing problems with multiple trips,” 4OR−Q. J. Oper. Res. 14 (3), 223–259 (2016).

    Article  Google Scholar 

  4. C. K. Y. Lin and R. C. W. Kwok, “Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data,” Eur. J. Oper. Res. 175 (3), 1833–1849 (2006).

    Article  Google Scholar 

  5. M. Battarra, M. Monaci, and D. Vigo, “An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem,” Comput. Oper. Res. 36 (11), 3041–3050 (2009).

    Article  Google Scholar 

  6. A. Ceselli, G. Righini, and M. Salani, “A column generation algorithm for a rich vehicle-routing problem,” Transp. Sci. 43 (1), 56–69 (2009).

    Article  Google Scholar 

  7. M. Oberscheider, J. Zazgornik, M. Gronalt, and P. Hirsch, “An exact approach to minimize the greenhouse gas emissions in timber transport,” J. Appl. Oper. Res. 7 (2), 43–59 (2015).

    Google Scholar 

  8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    MATH  Google Scholar 

  9. C. Prins, “Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case,” J. Math. Model. Algorithms 1 (2), 135–150 (2002).

    Article  MathSciNet  Google Scholar 

  10. J. Caceres-Cruz, A. Grasas, H. Ramalhinho, and A. A. Juan, “A savings-based randomized heuristic for the heterogeneous fixed fleet vehicle routing problem with multi-trips,” J. Appl. Oper. Res. 6 (2), 69–81 (2014).

    Google Scholar 

  11. F. Despaux and S. Basterrech, “Multi-trip vehicle routing problem with time windows and heterogeneous fleet,” Int. J. Comput. Inf. Syst. Ind. Manage. 8, 355–363 (2016).

    Google Scholar 

  12. J. Brandão and A. Mercer, “A tabu search algorithm for the multi-trip vehicle routing and scheduling problem,” Eur. J. Oper. Res. 100 (1), 180–191 (1997).

    Article  Google Scholar 

  13. S. Salhi and R. J. Petch, “A GA based heuristic for the vehicle routing problem with multiple trips,” J. Math. Model. Algorithms Oper. Res. 6 (4), 591–613 (2007).

    Article  MathSciNet  Google Scholar 

  14. F. Alonso, M. J. Alvarez, and J. E. Beasley, “A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions,” J. Oper. Res. Soc. 59 (7), 963–976 (2008).

    Article  Google Scholar 

  15. R. J. Petch and S. Salhi, “A multi-phase constructive heuristic for the vehicle routing problem with multiple trips,” Discrete Appl. Math. 133 (1–3), 69–92 (2003).

    Article  MathSciNet  Google Scholar 

  16. N. Azi, M. Gendreau, and J.-Y. Potvin, “An adaptive large neighborhood search for a vehicle routing problem with multiple routes,” Comput. Oper. Res. 41, 167–173 (2014).

    Article  MathSciNet  Google Scholar 

  17. Z. Ye and H. Mohamadian, “Multiple ant colony optimization for single depot multiple trip vehicle routing problems,” in PSI 2014. Ershov Informatics Conference. EPiC Series Comput. 23, 43–54 (2014).

  18. I. P. Bogdanov, “Optimal routing of regional passenger air transportation,” KIAM Preprint No. 113 (Keldysh Inst. Appl. Math., Moscow, 2019) [in Russian].

    Google Scholar 

  19. A. Mingozzi, R. Roberti, and P. Toth, “An exact algorithm for the multitrip vehicle routing problem,” INFORMS J. Comput. 25 (2), 193–207 (2013).

    Article  MathSciNet  Google Scholar 

  20. I. Karaoğlan, “A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles,” Int. J. Lean Thinking 6 (1), 21–46 (2015).

    Google Scholar 

  21. N. Azi, M. Gendreau, and J.-Y. Potvin, “An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles,” Eur. J. Oper. Res. 202 (3), 756–763 (2010).

    Article  Google Scholar 

  22. R. Macedo, C. Alves, J. M. V. de Carvalho, F. Clautiaux, and S. Hanafi, “Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model,” Eur. J. Oper. Res. 214 (3), 536–545 (2011).

    Article  MathSciNet  Google Scholar 

  23. F. Hernandez, D. Feillet, R. Giroudeau, and O. Naud, “A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration,” 4OR−Q. J. Oper. Res. 12 (3), 235–259 (2014).

    Article  Google Scholar 

  24. M. P. Seixas and A. B. Mendes, “A branch-and-price approach for a multi-trip vehicle routing problem with time windows and driver work hours,” in Congreso Latino-Iberoamericano de Investigación Operativa. Simpósio Brasileiro de Pesquisa Operacional (CLAIO/SBPO) (Rio de Janeiro, Brazil, September 24-28, 2012), pp. 3469–3480.

  25. I. Gribkovskaia, B. O. Gullberg, K. J. Hovden, and S. W. Wallace, “Optimization model for a livestock collection problem,” Int. J. Phys. Distrib. Logist. Manage. 36 (2), 136–152 (2006).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Moscow, Russia

    I. P. Bogdanov

Authors
  1. I. P. Bogdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. P. Bogdanov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bogdanov, I.P. Optimal Passenger Transportation Planning in a Regional Air Network. Math Models Comput Simul 13, 408–415 (2021). https://doi.org/10.1134/S2070048221030030

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S2070048221030030

Keywords:

Search

Navigation