OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC 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.

SADATI ESKANDARI ZAHRA; ZARIE HASSAN; MAHMMUD JANLO AHMAD; MAHMMUDI DARAIE NARGES; YOUSEFI KHOSHBAKHT MAJID

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

Journal Paper

Paper Information

Journal: Year:2013 | Volume:8 | Issue:24 Page(s): 99-112

Download Full-Text

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

Persian Verion

View:

1,714

Download:

Cites:

Information Journal Paper

Title

OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC ALGORITHM

Author(s)

Keywords

ELITE ANT COLONYQ2

NP-COMPLETE PROBLEMSQ2

OPEN VEHICLE ROUTING PROBLEMQ2

MIXED META-HEURISTIC ALGORITHMQ2

Abstract

The OPEN VEHICLE ROUTING PROBLEM (OVRP) is one of the most intensively studied problems in computational mathematics that nowadays and it has been receiving much attention by researchers and scientists. In this Problem, the objective is to define minimized distance traveled of the several vehicles that start to move simultaneously from the depot and visit some customers. It is noted that against to the Vehicle Routing Problem (VRP), it is not necessary that vehicles return to the depot after servicing the customers. This paper proposes a meta-heuristic algorithm in which at the first stage, a modified ELITE ANT COLONY (EAS) is applied for finding a suboptimal solution, and at the second stage, the insert and swap local search algorithms are used for finding better solutions. Computational results on fifteen standard benchmark problem instances show that the proposed algorithm is comparable in terms of solution quality of other meta-heuristic algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

SADATI ESKANDARI, ZAHRA, ZARIE, HASSAN, MAHMMUD JANLO, AHMAD, MAHMMUDI DARAIE, NARGES, & YOUSEFI KHOSHBAKHT, MAJID. (2013). OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL MANAGEMENT, 8(24), 99-112. SID. https://sid.ir/paper/171140/en

Vancouver: Copy

SADATI ESKANDARI ZAHRA, ZARIE HASSAN, MAHMMUD JANLO AHMAD, MAHMMUDI DARAIE NARGES, YOUSEFI KHOSHBAKHT MAJID. OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2013;8(24):99-112. Available from: https://sid.ir/paper/171140/en

IEEE: Copy

ZAHRA SADATI ESKANDARI, HASSAN ZARIE, AHMAD MAHMMUD JANLO, NARGES MAHMMUDI DARAIE, and MAJID YOUSEFI KHOSHBAKHT, “OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC ALGORITHM,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 8, no. 24, pp. 99–112, 2013, [Online]. Available: https://sid.ir/paper/171140/en

Related Journal Papers