SOLVING THE VEHICLE ROUTING PROBLEM BY A 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.

YOUSEFIKHOSHBAKHT MAJID; KHORRAM ESMAILE

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2012 | Volume:8 | Issue:8 Page(s): 1-9

Download Full-Text

View:

346

Download:

168

Cites:

Information Journal Paper

Title

SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID META-HEURISTIC ALGORITHM

Author(s)

YOUSEFIKHOSHBAKHT MAJID | KHORRAM ESMAILE | Issue Writer Certificate

Keywords

ANT COLONY SYSTEM

NP-HARD PROBLEMS

SWEEP ALGORITHM

VEHICLE ROUTING PROBLEM

Abstract

The VEHICLE ROUTING PROBLEM (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called SWEEP ALGORITHM (SW) +ANT COLONY SYSTEM (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.

Cites

A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN VEHICLE ROUTING PROBLEM

References

Cite

APA: Copy

YOUSEFIKHOSHBAKHT, MAJID, & KHORRAM, ESMAILE. (2012). SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-9. SID. https://sid.ir/paper/309900/en

Vancouver: Copy

YOUSEFIKHOSHBAKHT MAJID, KHORRAM ESMAILE. SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-9. Available from: https://sid.ir/paper/309900/en

IEEE: Copy

MAJID YOUSEFIKHOSHBAKHT, and ESMAILE KHORRAM, “SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID META-HEURISTIC ALGORITHM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–9, 2012, [Online]. Available: https://sid.ir/paper/309900/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops