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

A random-key genetic algorithm for the generalized traveling salesman problem

Author

Listed:
  • Snyder, Lawrence V.
  • Daskin, Mark S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Snyder, Lawrence V. & Daskin, Mark S., 2006. "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 38-53, October.
    • Handle: RePEc:eee:ejores:v:174:y:2006:i:1:p:38-53
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00252-3
    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. Moshe Dror & Mohamed Haouari, 2000. "Generalized Steiner Problems and Other Variants," Journal of Combinatorial Optimization, Springer, vol. 4(4), pages 415-436, December.
    2. Charles S. Revelle & Gilbert Laporte, 1996. "The Plant Location Problem: New Models and Research Prospects," Operations Research, INFORMS, vol. 44(6), pages 864-874, December.
    3. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    4. Jacques Renaud & Fayez F. Boctor & Gilbert Laporte, 1996. "A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 134-143, May.
    5. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    6. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    7. Moshe Dror & André Langevin, 1997. "A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem," Transportation Science, INFORMS, vol. 31(2), pages 187-192, May.
    8. James C. Bean, 1994. "Genetic Algorithms and Random Keys for Sequencing and Optimization," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 154-160, May.
    9. Charles E. Noon & James C. Bean, 1991. "A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 39(4), pages 623-632, August.
    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. F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi, 2018. "A two-level metaheuristic for the all colors shortest path problem," Computational Optimization and Applications, Springer, vol. 71(2), pages 525-551, November.
    2. Gang Du & Xi Liang & Chuanwang Sun, 2017. "Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows," Sustainability, MDPI, vol. 9(2), pages 1-22, February.
    3. Izabela Nielsen & Quang-Vinh Dang & Grzegorz Bocewicz & Zbigniew Banaszak, 2017. "A methodology for implementation of mobile robot in adaptive manufacturing environments," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1171-1188, June.
    4. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Amir M. Fathollahi-Fard & Abbas Ahmadi & Behrooz Karimi, 2021. "Multi-Objective Optimization of Home Healthcare with Working-Time Balancing and Care Continuity," Sustainability, MDPI, vol. 13(22), pages 1-33, November.
    6. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    7. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    8. Fu, Yuqiang & Yuan, Tao & Zhu, Xiaoyan, 2019. "Importance-measure based methods for component reassignment problem of degrading components," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    9. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.
    10. Bernardino, Raquel & Paias, Ana, 2018. "Solving the family traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 267(2), pages 453-466.
    11. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    12. Michael Dienstknecht & Nils Boysen & Dirk Briskorn, 2022. "The traveling salesman problem with drone resupply," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1045-1086, December.
    13. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
    14. Bismark Singh & Lena Oberfichtner & Sergey Ivliev, 2023. "Heuristics for a cash-collection routing problem with a cluster-first route-second approach," Annals of Operations Research, Springer, vol. 322(1), pages 413-440, March.
    15. Peng, Peng & Snyder, Lawrence V. & Lim, Andrew & Liu, Zuli, 2011. "Reliable logistics networks design with facility disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1190-1211, September.
    16. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    17. Sourirajan, Karthik & Ozsen, Leyla & Uzsoy, Reha, 2009. "A genetic algorithm for a single product network design model with lead time and safety stock considerations," European Journal of Operational Research, Elsevier, vol. 197(2), pages 599-608, September.
    18. S.A. Torabi & J. Namdar & S.M. Hatefi & F. Jolai, 2016. "An enhanced possibilistic programming approach for reliable closed-loop supply chain network design," International Journal of Production Research, Taylor & Francis Journals, vol. 54(5), pages 1358-1387, March.
    19. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    20. Mehdi El Krari & Belaïd Ahiod & Youssef Bouazza El Benani, 2021. "A pre-processing reduction method for the generalized travelling salesman problem," Operational Research, Springer, vol. 21(4), pages 2543-2591, December.
    21. Karapetyan, D. & Gutin, G., 2012. "Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 234-251.
    22. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    23. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    24. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.
    25. Parisa Rafigh & Ali Akbar Akbari & Hadi Mohammadi Bidhandi & Ali Husseinzadeh Kashan, 2022. "A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1387-1432, October.

    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. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    2. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    3. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    4. Mehdi El Krari & Belaïd Ahiod & Youssef Bouazza El Benani, 2021. "A pre-processing reduction method for the generalized travelling salesman problem," Operational Research, Springer, vol. 21(4), pages 2543-2591, December.
    5. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    6. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    7. W Zahrouni & H Kamoun, 2011. "Transforming part-sequencing problems in a robotic cell into a GTSP," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 114-123, January.
    8. Karapetyan, D. & Gutin, G., 2012. "Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 234-251.
    9. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.
    10. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    12. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    13. J-Y Potvin & M-A Naud, 2011. "Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 326-336, February.
    14. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
    15. Pop, Petrica C. & Kern, W. & Still, G., 2006. "A new relaxation method for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 170(3), pages 900-908, May.
    16. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    17. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
    18. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    19. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    20. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).

    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:174:y:2006:i:1:p:38-53. 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.