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

A new approach to solving the multiple traveling salesperson problem using genetic algorithms

Author

Listed:
  • Carter, Arthur E.
  • Ragsdale, Cliff T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:1:p:246-257
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00423-6
    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. Malmborg, Charles J., 1996. "A genetic algorithm for service level based vehicle scheduling," European Journal of Operational Research, Elsevier, vol. 93(1), pages 121-134, August.
    2. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    3. Carter, Arthur E. & Ragsdale, Cliff T., 2002. "Scheduling pre-printed newspaper advertising inserts using genetic algorithms," Omega, Elsevier, vol. 30(6), pages 415-421, December.
    4. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
    5. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    6. Moon, Chiung & Kim, Jongsoo & Choi, Gyunghyun & Seo, Yoonho, 2002. "An efficient genetic algorithm for the traveling salesman problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 140(3), pages 606-617, August.
    7. Schmitt, Lawrence J. & Amini, Mohammad M., 1998. "Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 551-570, August.
    8. Park, Yang-Byung, 2001. "A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines," International Journal of Production Economics, Elsevier, vol. 73(2), pages 175-188, September.
    9. Mandell Bellmore & John C. Malone, 1971. "Pathology of Traveling-Salesman Subtour-Elimination Algorithms," Operations Research, INFORMS, vol. 19(2), pages 278-307, April.
    10. Chatterjee, Sangit & Carrera, Cecilia & Lynch, Lucy A., 1996. "Genetic algorithms and traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 93(3), pages 490-510, September.
    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. Sonela Stillo & Gentisa Furxhi, 2016. "The Retention of the Employees as Long as Possible in the Organization, Through Finding the Right Factors of Motivation. Albania as a Case of Study," European Journal of Economics and Business Studies Articles, Revistia Research and Publishing, vol. 2, May - Aug.
    2. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    3. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    4. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
    5. Zhenqiang Zhang & Sile Ma & Xiangyuan Jiang, 2022. "Research on Multi-Objective Multi-Robot Task Allocation by Lin–Kernighan–Helsgaun Guided Evolutionary Algorithms," Mathematics, MDPI, vol. 10(24), pages 1-17, December.
    6. Carter, Arthur E. & Ragsdale, Cliff T., 2009. "Quality inspection scheduling for multi-unit service enterprises," European Journal of Operational Research, Elsevier, vol. 194(1), pages 114-126, April.
    7. 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.
    8. García-Villoria, Alberto & Pastor, Rafael, 2010. "Solving the response time variability problem by means of a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 202(2), pages 320-327, April.
    9. Culley, D.M. & Funke, S.W. & Kramer, S.C. & Piggott, M.D., 2016. "Integration of cost modelling within the micro-siting design optimisation of tidal turbine arrays," Renewable Energy, Elsevier, vol. 85(C), pages 215-227.
    10. 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.

    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. Carter, Arthur E. & Ragsdale, Cliff T., 2009. "Quality inspection scheduling for multi-unit service enterprises," European Journal of Operational Research, Elsevier, vol. 194(1), pages 114-126, April.
    2. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    3. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    4. Zhou, Gengui & Min, Hokey & Gen, Mitsuo, 2003. "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses," International Journal of Production Economics, Elsevier, vol. 86(1), pages 35-45, October.
    5. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A hybrid genetic algorithm for no-wait flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 128(1), pages 144-152, November.
    6. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.
    7. 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.
    8. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    9. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    10. Belhoul, Lyes, 2014. "Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14672 edited by Vanderpooten, Daniel.
    11. Culley, D.M. & Funke, S.W. & Kramer, S.C. & Piggott, M.D., 2016. "Integration of cost modelling within the micro-siting design optimisation of tidal turbine arrays," Renewable Energy, Elsevier, vol. 85(C), pages 215-227.
    12. Nait Tahar, Djamel & Yalaoui, Farouk & Chu, Chengbin & Amodeo, Lionel, 2006. "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 63-73, February.
    13. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.
    14. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    15. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    16. Su, Fuyong & Kong, Linglu & Wang, Hui & Wen, Zhi, 2021. "Modeling and application for rolling scheduling problem based on TSP," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    17. Kumar, Akhilesh & Prakash & Tiwari, M.K. & Shankar, Ravi & Baveja, Alok, 2006. "Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1043-1069, December.
    18. Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
    19. Lin, Hung-Tso & Lee, Hong-Tau & Pan, Wen-Jung, 2008. "Heuristics for scheduling in a no-wait open shop with movable dedicated machines," International Journal of Production Economics, Elsevier, vol. 111(2), pages 368-377, February.
    20. Joaquín Antonio Pacheco Bonrostro, 1995. "Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 3, pages 69-86, Junio.

    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:eee:ejores:v:175:y:2006:i:1:p:246-257. 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.