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

Genetic algorithms and traveling salesman problems

Author

Listed:
  • Chatterjee, Sangit
  • Carrera, Cecilia
  • Lynch, Lucy A.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:93:y:1996:i:3:p:490-510
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00077-1
    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. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    2. B. Golden & L. Bodin & T. Doyle & W. Stewart, 1980. "Approximate Traveling Salesman Algorithms," Operations Research, INFORMS, vol. 28(3-part-ii), pages 694-711, June.
    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. 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.
    2. Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
    3. Yang, Zhao & Xiao, Ming-Qing & Ge, Ya-Wei & Feng, De-Long & Zhang, Lei & Song, Hai-Fang & Tang, Xi-Lang, 2018. "A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods," European Journal of Operational Research, Elsevier, vol. 265(1), pages 65-80.
    4. 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.
    5. 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.
    6. Xiuqiao Sun & Jian Wang & Weitiao Wu & Wenjia Liu, 2018. "Genetic Algorithm for Optimizing Routing Design and Fleet Allocation of Freeway Service Overlapping Patrol," Sustainability, MDPI, vol. 10(11), pages 1-15, November.
    7. 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.
    8. Qi, Chun & Tang, John C.S., 2006. "Foreign direct investment: A genetic algorithm approach," Socio-Economic Planning Sciences, Elsevier, vol. 40(2), pages 143-155, June.
    9. 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.
    10. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.

    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. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    2. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
    3. 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.
    4. Schuijbroek, J. & Hampshire, R.C. & van Hoeve, W.-J., 2017. "Inventory rebalancing and vehicle routing in bike sharing systems," European Journal of Operational Research, Elsevier, vol. 257(3), pages 992-1004.
    5. 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.
    6. Castellano, Davide & Gallo, Mosè & Grassi, Andrea & Santillo, Liberatina C., 2019. "The effect of GHG emissions on production, inventory replenishment and routing decisions in a single vendor-multiple buyers supply chain," International Journal of Production Economics, Elsevier, vol. 218(C), pages 30-42.
    7. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    8. Gagliardi, Jean-Philippe & Ruiz, Angel & Renaud, Jacques, 2008. "Space allocation and stock replenishment synchronization in a distribution center," International Journal of Production Economics, Elsevier, vol. 115(1), pages 19-27, September.
    9. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    10. Mengtang Li & Guoku Jia & Xun Li & Hao Qiu, 2023. "Efficient Trajectory Planning for Optimizing Energy Consumption and Completion Time in UAV-Assisted IoT Networks," Mathematics, MDPI, vol. 11(20), pages 1-19, October.
    11. 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.
    12. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    13. del Castillo, Jose M., 1998. "A heuristic for the traveling salesman problem based on a continuous approximation," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 123-152, April.
    14. Tatiana Bassetto & Francesco Mason, 2007. "The 2-period balanced traveling salesman problem," Working Papers 154, Department of Applied Mathematics, Università Ca' Foscari Venezia, revised Oct 2007.
    15. Chen, Xi, 2018. "When does store consolidation lead to higher emissions?," International Journal of Production Economics, Elsevier, vol. 202(C), pages 109-122.
    16. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    17. Pages, Laia & Jayakrishnan, R. & Cortes, Cristian E., 2005. "Real-Time Mass Passenger Transport Network Optimization Problems," University of California Transportation Center, Working Papers qt7w88d089, University of California Transportation Center.
    18. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
    19. Luitpold Babel, 2020. "New heuristic algorithms for the Dubins traveling salesman problem," Journal of Heuristics, Springer, vol. 26(4), pages 503-530, August.
    20. Alice Vasconcelos Nobre & Caio Cézar Rodrigues Oliveira & Denilson Ricardo de Lucena Nunes & André Cristiano Silva Melo & Gil Eduardo Guimarães & Rosley Anholon & Vitor William Batista Martins, 2022. "Analysis of Decision Parameters for Route Plans and Their Importance for Sustainability: An Exploratory Study Using the TOPSIS Technique," Logistics, MDPI, vol. 6(2), pages 1-12, 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:eee:ejores:v:93:y:1996:i:3:p:490-510. 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.