AN ANT COLONY OPTIMIZATION ALGORITHM FOR A SITE-DEPENDENT VEHICLE ROUTING PROBLEM WITH MAXIMUM TOUR TIME LENGTH

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.

ZARE REISABADI E.; MIRMOHAMMADI S.H.; HEJAZI S.R.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2015 | Volume:12 | Issue:1 (42) Page(s): 23-36

Download Full-Text

Persian Verion

View:

1,240

Download:

Cites:

Information Journal Paper

Title

AN ANT COLONY OPTIMIZATION ALGORITHM FOR A SITE-DEPENDENT VEHICLE ROUTING PROBLEM WITH MAXIMUM TOUR TIME LENGTH

Author(s)

ZARE REISABADI E. | MIRMOHAMMADI S.H. | HEJAZI S.R. | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEMQ2

TRAFFIC PLANQ2

SITE-DEPENDENCYQ2

ANT COLONY OPTIMIZATIONQ2

MAXIMUM TOUR TIME LENGTHQ2

Abstract

Traffic inhibitory rules are one of the strategies applied in traffic control, especially in capital cities with large amount of daily transportation. "Traffic plan" and "even-odd TRAFFIC PLAN" are such of these strategies implemented in some large cities such as Tehran. Based on these traffic inhibitory rules, transportation in some crowded regions would be prohibited. Considering TRAFFIC PLAN limitation in VEHICLE ROUTING PROBLEM, turns this problem in to a site dependent VEHICLE ROUTING PROBLEM. At first, in this paper, we consider this limitation as a SITE-DEPENDENCY assumption in the problem and then we present the Mixed Integer Programming model of the problem in which each vehicle, depending on its type, has a MAXIMUM TOUR TIME LENGTH. Secondly, an ANT COLONY OPTIMIZATION-based algorithm is presented for the problem. This presented algorithm has become more explorative via local searches. Finally, some test problems are solved and analyzed in both small and large.

Cites

No record.

References

No record.

Cite

APA: Copy

ZARE REISABADI, E., MIRMOHAMMADI, S.H., & HEJAZI, S.R.. (2015). AN ANT COLONY OPTIMIZATION ALGORITHM FOR A SITE-DEPENDENT VEHICLE ROUTING PROBLEM WITH MAXIMUM TOUR TIME LENGTH. JOURNAL OF TRANSPORTATION RESEARCH, 12(1 (42)), 23-36. SID. https://sid.ir/paper/83971/en

Vancouver: Copy

ZARE REISABADI E., MIRMOHAMMADI S.H., HEJAZI S.R.. AN ANT COLONY OPTIMIZATION ALGORITHM FOR A SITE-DEPENDENT VEHICLE ROUTING PROBLEM WITH MAXIMUM TOUR TIME LENGTH. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2015;12(1 (42)):23-36. Available from: https://sid.ir/paper/83971/en

IEEE: Copy

E. ZARE REISABADI, S.H. MIRMOHAMMADI, and S.R. HEJAZI, “AN ANT COLONY OPTIMIZATION ALGORITHM FOR A SITE-DEPENDENT VEHICLE ROUTING PROBLEM WITH MAXIMUM TOUR TIME LENGTH,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 12, no. 1 (42), pp. 23–36, 2015, [Online]. Available: https://sid.ir/paper/83971/en

Related Journal Papers