NEW HEURISTIC ALGORITHMS FOR SOLVING SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEMS (GTSP)

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MASEHIAN ELLIPS

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2009 | Volume:3 | Issue:PRE. NO. 3 Page(s): 49-58

Download Full-Text

View:

287

Download:

134

Cites:

Information Journal Paper

Title

NEW HEURISTIC ALGORITHMS FOR SOLVING SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEMS (GTSP)

Author(s)

MASEHIAN ELLIPS | Issue Writer Certificate

Keywords

TRAVELING SALESMAN PROBLEM

SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEM

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 single-vehicle 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.

Cites

No record.

References

Cite

APA: Copy

MASEHIAN, ELLIPS. (2009). NEW HEURISTIC ALGORITHMS FOR SOLVING SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEMS (GTSP). JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 3(PRE. NO. 3), 49-58. SID. https://sid.ir/paper/575184/en

Vancouver: Copy

MASEHIAN ELLIPS. NEW HEURISTIC ALGORITHMS FOR SOLVING SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEMS (GTSP). JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;3(PRE. NO. 3):49-58. Available from: https://sid.ir/paper/575184/en

IEEE: Copy

ELLIPS MASEHIAN, “NEW HEURISTIC ALGORITHMS FOR SOLVING SINGLE-VEHICLE AND MULTI-VEHICLE GENERALIZED TRAVELING SALESMAN PROBLEMS (GTSP),” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 3, no. PRE. NO. 3, pp. 49–58, 2009, [Online]. Available: https://sid.ir/paper/575184/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops