MODIFIED ANT COLONY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

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.

TAGHAVIFARD MOHAMMAD TAGHI; SHEYKH K.; SHAHSAVARI ARIAN

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2009 | Volume:20 | Issue:2 Page(s): 23-30

Download Full-Text

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

Persian Verion

View:

1,017

Download:

Cites:

Information Journal Paper

Title

MODIFIED ANT COLONY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Author(s)

TAGHAVIFARD MOHAMMAD TAGHI | SHEYKH K. | SHAHSAVARI ARIAN | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEM WITH TIME WINDOWSQ3

ANT COLONY ALGORITHMQ3

SOLOMON TESTPROBLEMSQ3

Abstract

VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) is an NP-Complete Optimization Problem. Even finding an optimal solution for small size problems is too hard and time-consuming. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with dissimilar demands and time window constraints at minimum cost, without violating the capacity and time window constraints. This problem has been solved with a number of heuristic and meta-heuristic solution algorithms and optimal or near optimal solutions gained. In this paper, a modified ANT COLONY ALGORITHM is proposed. In this algorithm we tried to simplify the solution procedure and computational complexities of ant colony metaheuristic. To gain this capability, we sacrificed some computational accuracy. Testing the solution procedure on the Solomon test-problems showed that this algorithm is capable of generating relatively good solutions.

Cites

OFFERING A MATHEMATICAL MODEL AND HEURISTIC METHOD FOR SOLVING MULTI-DEPOT AND MULTI-PRODUCT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS VEHICLE

References

No record.

Cite

APA: Copy

TAGHAVIFARD, MOHAMMAD TAGHI, SHEYKH, K., & SHAHSAVARI, ARIAN. (2009). MODIFIED ANT COLONY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 20(2), 23-30. SID. https://sid.ir/paper/65737/en

Vancouver: Copy

TAGHAVIFARD MOHAMMAD TAGHI, SHEYKH K., SHAHSAVARI ARIAN. MODIFIED ANT COLONY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2009;20(2):23-30. Available from: https://sid.ir/paper/65737/en

IEEE: Copy

MOHAMMAD TAGHI TAGHAVIFARD, K. SHEYKH, and ARIAN SHAHSAVARI, “MODIFIED ANT COLONY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 20, no. 2, pp. 23–30, 2009, [Online]. Available: https://sid.ir/paper/65737/en

Related Journal Papers