IDEAS home Printed from https://ideas.repec.org/a/pcz/alspcz/v7y2013i2p95-102.html
   My bibliography  Save this article

Preliminary Studies On The Fixed Destination Mmtsp Solved By Discrete Firefly Algorithm

Author

Listed:
  • LÁSZLÓ KOTA

    (University of Miskolc)

  • KÁROLY JÁRMAI

    (University of Miskolc)

Abstract

The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the salesmen and after the round route the salesman go back to its home location. But unlike at the TSP the salesman does not start from the same location. The firefly algorithm is a member of the swarm optimizations family. Originally it was developed to solve continuous state space problems but with discretization it is capable to solve combinatorial problems also. In this article we will show a potential discretization variant. In the firefly algorithm every firefly represent a solution. In our algorithm the salesmen using a multi chromosome model, where there are a separate list for every salesman for the cities to visit.

Suggested Citation

  • László Kota & Károly Jármai, 2013. "Preliminary Studies On The Fixed Destination Mmtsp Solved By Discrete Firefly Algorithm," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 7(2), pages 95-102, December.
    • Handle: RePEc:pcz:alspcz:v:7:y:2013:i:2:p:95-102
    as

    Download full text from publisher

    File URL: http://www.als.zim.pcz.pl/files/ALS7_No2_p95_102_Kota_Jarmai.pdf
    Download Restriction: no
    File URL: http://www.als.zim.pcz.pl/7.2.php
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kara, Imdat & Bektas, Tolga, 2006. "Integer linear programming formulations of multiple salesman problems and its variations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1449-1458, November.
    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. Li, Kunpeng & Liu, Tengbo & Ram Kumar, P.N. & Han, Xuefang, 2024. "A reinforcement learning-based hyper-heuristic for AGV task assignment and route planning in parts-to-picker warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    2. Bektaş, Tolga, 2012. "Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing," European Journal of Operational Research, Elsevier, vol. 216(1), pages 83-93.
    3. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    4. 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.
    5. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    6. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    7. Enrique Benavent & Antonio Martínez, 2013. "Multi-depot Multiple TSP: a polyhedral study and computational results," Annals of Operations Research, Springer, vol. 207(1), pages 7-25, August.
    8. Tuğçe Uzun Kocamiş & Gülçin Yildirim, 2016. "Sustainability Reporting in Turkey: Analysis of Companies in the BIST Sustainability Index," European Journal of Economics and Business Studies Articles, Revistia Research and Publishing, vol. 2, ejes_v2_i.
    9. Bruck, Bruno P. & Cordeau, Jean-François & Iori, Manuel, 2018. "A practical time slot management and routing problem for attended home services," Omega, Elsevier, vol. 81(C), pages 208-219.
    10. Bräysy, Olli & Dullaert, Wout & Nakari, Pentti, 2009. "The potential of optimization in communal routing problems: case studies from Finland," Journal of Transport Geography, Elsevier, vol. 17(6), pages 484-490.
    11. Tingxi Wen & Zhongnan Zhang & Kelvin K L Wong, 2016. "Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-22, May.
    12. Nourinejad, Mehdi & Roorda, Matthew J., 2014. "A dynamic carsharing decision support system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 66(C), pages 36-50.
    13. Khalid Mekamcha & Mehdi Souier & Hakim Nadhir Bessenouci & Mohammed Bennekrouf, 2021. "Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case," Operational Research, Springer, vol. 21(3), pages 1641-1661, September.
    14. Mahmoud Masoud & Mohammed Elhenawy & Shi Qiang Liu & Mohammed Almannaa & Sebastien Glaser & Wael Alhajyaseen, 2023. "A Simulated Annealing for Optimizing Assignment of E-Scooters to Freelance Chargers," Sustainability, MDPI, vol. 15(3), pages 1-15, January.
    15. Przemysław Kowalik & Grzegorz Sobecki & Piotr Bawoł & Paweł Muzolf, 2023. "A Flow-Based Formulation of the Travelling Salesman Problem with Penalties on Nodes," Sustainability, MDPI, vol. 15(5), pages 1-28, February.
    16. Albareda-Sambola, Maria & Fernández, Elena & Nickel, Stefan, 2012. "Multiperiod Location-Routing with Decoupled Time Scales," European Journal of Operational Research, Elsevier, vol. 217(2), pages 248-258.
    17. Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
    18. José Alejandro Cornejo-Acosta & Jesús García-Díaz & Julio César Pérez-Sansalvador & Carlos Segura, 2023. "Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems," Mathematics, MDPI, vol. 11(13), pages 1-25, July.

    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:pcz:alspcz:v:7:y:2013:i:2:p:95-102. 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: Paula Bajdor (email available below). General contact details of provider: https://edirc.repec.org/data/wzpczpl.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.