A MODIFIED ANT COLONY SYSTEM HYBRIDIZED WITH INSERT AND SWAP HEURISTIC ALGORITHMS 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.

AZAMI SH.; BASSIRI P.; DIDEHVAR F.; RAHMATI F.; YOUSEFI KHOSHBAKHT M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2016 | Volume:13 | Issue:1 (46) Page(s): 81-91

Download Full-Text

Persian Verion

View:

899

Download:

Cites:

Information Journal Paper

Title

A MODIFIED ANT COLONY SYSTEM HYBRIDIZED WITH INSERT AND SWAP HEURISTIC ALGORITHMS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Author(s)

Keywords

VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

ANT COLONY SYSTEM

INSERT MOVE

SWAP MOVE

COMBINATORIAL OPTIMIZATION PROBLEMS

Abstract

The VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) is one of the most well-known combinatorial problems in the transportation domain. Because this problem belongs to NP-Hard problems, many researchers have presented meta-heuristics for it. In this paper, aimed at the disadvantages existed in the current ANT COLONY SYSTEM (ACS), a modification of this algorithm called HACS is proposed for solving VRPTW. To improve the performance of ACS, two neighborhood search in the name of insert and swap algorithms are used. This new algorithm can avoid premature convergence and exploit more strong solutions. Finally, the effectiveness of the HACS on solving a number of the Solomon’s 56 VRPTW is validated by comparing the computational results with those previously presented in the literature. The results show that not only the proposed HACS algorithm can find good solutions but also seven best known solutions of the benchmark problem are also found by the proposed method.

Cites

No record.

References

No record.

Cite

APA: Copy

AZAMI, SH., BASSIRI, P., DIDEHVAR, F., RAHMATI, F., & YOUSEFI KHOSHBAKHT, M.. (2016). A MODIFIED ANT COLONY SYSTEM HYBRIDIZED WITH INSERT AND SWAP HEURISTIC ALGORITHMS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. JOURNAL OF TRANSPORTATION RESEARCH, 13(1 (46)), 81-91. SID. https://sid.ir/paper/83766/en

Vancouver: Copy

AZAMI SH., BASSIRI P., DIDEHVAR F., RAHMATI F., YOUSEFI KHOSHBAKHT M.. A MODIFIED ANT COLONY SYSTEM HYBRIDIZED WITH INSERT AND SWAP HEURISTIC ALGORITHMS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2016;13(1 (46)):81-91. Available from: https://sid.ir/paper/83766/en

IEEE: Copy

SH. AZAMI, P. BASSIRI, F. DIDEHVAR, F. RAHMATI, and M. YOUSEFI KHOSHBAKHT, “A MODIFIED ANT COLONY SYSTEM HYBRIDIZED WITH INSERT AND SWAP HEURISTIC ALGORITHMS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 13, no. 1 (46), pp. 81–91, 2016, [Online]. Available: https://sid.ir/paper/83766/en

Related Journal Papers