IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v193y2009i1p289-302.html
   My bibliography  Save this article

Spectral analysis for performance evaluation in a bus network

Author

Listed:
  • Nait-Sidi-Moh, A.
  • Manier, M.-A.
  • El Moudni, A.

Abstract

This paper deals with the performance evaluation of a public transportation system in terms of waiting times at various connection points. The behaviour of a bus network is studied in the framework of Discrete Event Systems (DES). Two possible operating modes of buses can be observed at each connection stop: periodic and non-periodic mode. Two complementary tools, Petri nets and (max, +) algebra, are used to describe the network by a non-stationary linear state model. This one can be solved after solving the structural conflicts associated to the graphical representation. From the characteristic matrix of the mathematical model, we determine eigenvalues and eigenvectors that we use to evaluate the connection times of passengers. This work is finally illustrated with a numerical example.

Suggested Citation

  • Nait-Sidi-Moh, A. & Manier, M.-A. & El Moudni, A., 2009. "Spectral analysis for performance evaluation in a bus network," European Journal of Operational Research, Elsevier, vol. 193(1), pages 289-302, February.
    • Handle: RePEc:eee:ejores:v:193:y:2009:i:1:p:289-302
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01058-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bocker, Jorg & Lind, Jurgen & Zirkler, Bernd, 2001. "Using a multi-agent approach to optimise the train coupling and sharing system," European Journal of Operational Research, Elsevier, vol. 131(2), pages 242-252, June.
    2. J. Schulze & T. Fahle, 1999. "A parallel algorithm for the vehicle routing problem with time window constraints," Annals of Operations Research, Springer, vol. 86(0), pages 585-607, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jin Qin & Yuxin He & Linglin Ni, 2014. "Quantitative Efficiency Evaluation Method for Transportation Networks," Sustainability, MDPI, vol. 6(12), pages 1-15, November.
    2. Zhai, Wei & Bai, Xueyin & Peng, Zhong-ren & Gu, Chaolin, 2019. "A bottom-up transportation network efficiency measuring approach: A case study of taxi efficiency in New York City," Journal of Transport Geography, Elsevier, vol. 80(C).

    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. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    3. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    4. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    5. Nguyen, Phuong Khanh & Crainic, Teodor Gabriel & Toulouse, Michel, 2013. "A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 231(1), pages 43-56.
    6. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    7. Shaopei Chen & Ji Yang & Yong Li & Jingfeng Yang, 2017. "Multiconstrained Network Intensive Vehicle Routing Adaptive Ant Colony Algorithm in the Context of Neural Network Analysis," Complexity, Hindawi, vol. 2017, pages 1-9, September.
    8. Homberger, Jorg & Gehring, Hermann, 2005. "A two-phase hybrid metaheuristic for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 162(1), pages 220-238, April.
    9. Bo Sun & Ming Wei & Senlai Zhu, 2018. "Optimal Design of Demand-Responsive Feeder Transit Services with Passengers’ Multiple Time Windows and Satisfaction," Future Internet, MDPI, vol. 10(3), pages 1-15, March.
    10. Jahangirian, Mohsen & Eldabi, Tillal & Naseer, Aisha & Stergioulas, Lampros K. & Young, Terry, 2010. "Simulation in manufacturing and business: A review," European Journal of Operational Research, Elsevier, vol. 203(1), pages 1-13, May.
    11. Anita Agárdi & László Kovács & Tamás Bányai, 2022. "Mathematical Model for the Generalized VRP Model," Sustainability, MDPI, vol. 14(18), pages 1-22, September.
    12. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
    13. Olli Bräysy, 2003. "A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 347-368, November.
    14. Mes, Martijn & van der Heijden, Matthieu & van Harten, Aart, 2007. "Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems," European Journal of Operational Research, Elsevier, vol. 181(1), pages 59-75, August.
    15. Chris Groër & Bruce Golden & Edward Wasil, 2011. "A Parallel Algorithm for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 315-330, May.

    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:eee:ejores:v:193:y:2009:i:1: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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.