IDEAS home Printed from https://ideas.repec.org/a/exl/1trans/v13y2018i2p133-144.html
   My bibliography  Save this article

Application Of Ant-Colony Algorithm To The Issue Of Improving Rectified Voltage Parameters In Electric Tram Traction

Author

Listed:
  • Barbara Kulesz

    (Silesian University of Technology Akademicka 2, 44-100 Gliwice, Poland)

  • Andrzej Sikora

    (Silesian University of Technology Akademicka 2, 44-100 Gliwice, Poland)

  • Adam Zielonka

    (Silesian University of Technology Akademicka 2, 44-100 Gliwice, Poland)

Abstract

In this paper, the problem related to transformation of ac voltage into DC voltage used in tram supply is considered....

Suggested Citation

  • Barbara Kulesz & Andrzej Sikora & Adam Zielonka, 2018. "Application Of Ant-Colony Algorithm To The Issue Of Improving Rectified Voltage Parameters In Electric Tram Traction," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 13(2), pages 133-144, June.
    • Handle: RePEc:exl:1trans:v:13:y:2018:i:2:p:133-144
    DOI: 10.20858/tp.2018.13.2.13
    as

    Download full text from publisher

    File URL: https://www.exeley.com/exeley/journals/transport_problems/13/2/pdf/10.20858_tp.2018.13.2.13.pdf
    Download Restriction: no
    File URL: https://www.exeley.com/transport_problems/doi/10.20858/tp.2018.13.2.13
    Download Restriction: no
    File URL: https://libkey.io/10.20858/tp.2018.13.2.13?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. Qing Wu & Colin Cole & Tim McSweeney, 2016. "Applications of particle swarm optimization in the railway domain," International Journal of Rail Transportation, Taylor & Francis Journals, vol. 4(3), pages 167-190, August.
    2. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    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. repec:exl:1trans:v:13:y:2018:i:2:p:- is not listed on IDEAS
    2. Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
    3. Jiang Liu & Tian-tian Li & Bai-gen Cai & Jiao Zhang, 2020. "Boundary Identification for Traction Energy Conservation Capability of Urban Rail Timetables: A Case Study of the Beijing Batong Line," Energies, MDPI, vol. 13(8), pages 1-25, April.
    4. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    5. 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.
    6. Muyldermans, L. & Pang, G., 2010. "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm," European Journal of Operational Research, Elsevier, vol. 206(1), pages 93-103, October.
    7. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    8. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    9. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    10. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    11. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    12. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    13. Markus Frey & Ferdinand Kiermaier & Rainer Kolisch, 2017. "Optimizing Inbound Baggage Handling at Airports," Transportation Science, INFORMS, vol. 51(4), pages 1210-1225, November.
    14. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    15. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    16. Michele Monaci & Paolo Toth, 2006. "A Set-Covering-Based Heuristic Approach for Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 71-85, February.
    17. Vansteenwegen, Pieter & Souffriau, Wouter & Berghe, Greet Vanden & Oudheusden, Dirk Van, 2009. "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 118-127, July.
    18. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    19. Egeblad, Jens & Nielsen, Benny K. & Odgaard, Allan, 2007. "Fast neighborhood search for two- and three-dimensional nesting problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1249-1266, December.
    20. Palhazi Cuervo, Daniel & Goos, Peter & Sörensen, Kenneth & Arráiz, Emely, 2014. "An iterated local search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 237(2), pages 454-464.
    21. Erfan Hassannayebi & Seyed Hessameddin Zegordi & Mohammad Reza Amin-Naseri & Masoud Yaghini, 2018. "Optimizing headways for urban rail transit services using adaptive particle swarm algorithms," Public Transport, Springer, vol. 10(1), pages 23-62, May.

    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:exl:1trans:v:13:y:2018:i:2:p:133-144. 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: MPS Ltd. (email available below). General contact details of provider: https://www.exeley.com/journal/transport_problems .

    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.