• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Journal of Optimization in Industrial Engineering
Articles in Press
Current Issue
Journal Archive
Volume Volume 11 (2018)
Volume Volume 10 (2017)
Volume Volume 9 (2016)
Volume Volume 8 (2015)
Volume Volume 7 (2014)
Volume Volume 6 (2013)
Volume Volume 5 (2012)
Volume Volume 4 (2011)
Volume Volume 3 (2010)
Volume Volume 2 (2009)
Issue Issue 4
Issue Issue 3
Volume Volume 1 (2008)
Masehian, E. (2010). New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP). Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), 49-58.
Ellips Masehian. "New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)". Journal of Optimization in Industrial Engineering, Volume 2, Issue 3, 2010, 49-58.
Masehian, E. (2010). 'New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)', Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), pp. 49-58.
Masehian, E. New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP). Journal of Optimization in Industrial Engineering, 2010; Volume 2(Issue 3): 49-58.

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Article 7, Volume 2, Issue 3, Winter and Spring 2009, Page 49-58  XML PDF (298 K)
Author
Ellips Masehian
Industrial Engineering Department, Tarbiat Modares University, Tehran, 14155-4838, Iran.
Abstract
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to find a minimum-length tour containing exactly one node from each cluster. In this paper, a new heuristic method is presented for solving singlevehicle single-depot GTSP with the ability of controlling the search strategy from conservative to greedy and vice versa. A variant algorithm is then developed to accommodate the multi-vehicle single-depot condition, which is modified afterwards to accommodate the multi-vehicle multi-depot GTSP.
Keywords
Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problem; Traveling salesman problem
Statistics
Article View: 4,021
PDF Download: 1,994
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

web analytics    web usage statistics  Real Time Web Analytics

Journal Management System. Designed by sinaweb.