OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING K-MEANS METHOD AND SAVING AND TABU SEARCH HYBRID ALGORITHM

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.

SHURVARZI HOSEIN; NAEIMI AHID; TALEAI MOHAMMAD

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Transportation Engineering Year:2016 | Volume:7 | Issue:4 Page(s): 665-678

Download Full-Text

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

Persian Verion

View:

2,035

Download:

Cites:

Information Journal Paper

Title

OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING K-MEANS METHOD AND SAVING AND TABU SEARCH HYBRID ALGORITHM

Author(s)

SHURVARZI HOSEIN | NAEIMI AHID | TALEAI MOHAMMAD | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEMS (VRP)Q2

TABU SEARCH ALGORITHMQ2

SAVING ALGORITHMQ2

K-MEANS ALGORITHMQ2

GISQ1

Abstract

Taking the advantage of transportation services for employees corporate, offices and factories is one of the outstanding solutions to reduce traffic congestion and fuel consumption. In this way planning and allocation of vehicles to passengers and also determining the transportation routes are major problems. Such problems are known as Vehicle Routing Problem (VRP) that fall into category of complex multi-purpose optimization problem. This paper attempts to simplify the problem by breaking it into several simple and single-purpose problems and also to propose a novel approach for path finding. At first, VRP converts to several single-purpose problems, using improvement K-MEANS ALGORITHM. Then, a hybrid method based on Saving and TABU SEARCH ALGORITHMs is developed to find shortest path. Results show that hybrid method of Saving and TABU SEARCH ALGORITHMs is better and faster than using only Tabu.

Cites

No record.

References

No record.

Cite

APA: Copy

SHURVARZI, HOSEIN, NAEIMI, AHID, & TALEAI, MOHAMMAD. (2016). OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING K-MEANS METHOD AND SAVING AND TABU SEARCH HYBRID ALGORITHM. JOURNAL OF TRANSPORTATION ENGINEERING, 7(4), 665-678. SID. https://sid.ir/paper/223984/en

Vancouver: Copy

SHURVARZI HOSEIN, NAEIMI AHID, TALEAI MOHAMMAD. OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING K-MEANS METHOD AND SAVING AND TABU SEARCH HYBRID ALGORITHM. JOURNAL OF TRANSPORTATION ENGINEERING[Internet]. 2016;7(4):665-678. Available from: https://sid.ir/paper/223984/en

IEEE: Copy

HOSEIN SHURVARZI, AHID NAEIMI, and MOHAMMAD TALEAI, “OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING K-MEANS METHOD AND SAVING AND TABU SEARCH HYBRID ALGORITHM,” JOURNAL OF TRANSPORTATION ENGINEERING, vol. 7, no. 4, pp. 665–678, 2016, [Online]. Available: https://sid.ir/paper/223984/en

Related Journal Papers