ADDRESSING THE VEHICLE ROUTING PROBLEM IN LARGE SCALE NETWORK VIA NOVEL NATURE-INSPIRED 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.

FAZLI M.; HAJIAGHAEI KESHTELI M.; Fathollahi Fard A.M.

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

100

Download:

Information Seminar Paper

Title

ADDRESSING THE VEHICLE ROUTING PROBLEM IN LARGE SCALE NETWORK VIA NOVEL NATURE-INSPIRED ALGORITHM

Author(s)

FAZLI M. | HAJIAGHAEI KESHTELI M. | Fathollahi Fard A.M.

Keywords

VEHICLE ROUTING PROBLEM (VRP)

METAHEURISTICS

RED DEER ALGORITHM (RDA)

Abstract

NOWADAYS, NATURE-INSPIRED PLAYS A KEY ROLE ESPECIALLY IN TRANSPORTATION PROBLEMS AND OPERATION MANAGEMENT PROBLEMS. THIS STUDY PRESENTS THE APPLICATION OF A NOVEL NATURE-INSPIRED ALGORITHM TO THE BASIC VEHICLE ROUTING PROBLEM (VRP) IN THE LARGE SCALE NETWORK, IN WHICH CUSTOMERS OF KNOWN DEMAND ARE SUPPLIED FROM A SINGLE DEPOT. VEHICLES ARE SUBJECT TO A WEIGHT LIMIT AND, IN SOME CASES, TO A LIMIT ON THE DISTANCE TRAVELLED. ONLY ONE VEHICLE IS ALLOWED TO SUPPLY EACH CUSTOMER. FURTHERMORE, TO ADDRESS THE PROPOSED PROBLEM, RDA INSPIRED BY RED DEER’S MATING AND PRESENTED RECENTLY AS ONE OF NOVEL METAHEURISITC METHODS IS INTRODUCED. THIS ISSUE AIMS TO EXPLORE THE RDA ON THE PROPOSED VRP FOR THE FIRST TIME. IN ADDITION, COMPUTATIONAL RESULTS ARE COMPUTED FOR THE RDA WHICH IS PUT FORWARD. FURTHER RESULTS ARE GIVEN USING AN IMPERIALIST COMPETITIVE ALGORITHM AND GENETIC ALGORITHM, SHOWING THAT THIS APPROACH IS COMPETITIVE WITH OTHER STRONG METAHURISTICS IN TERMS OF SOLUTION TIME AND QUALITY.

Cites

No record.

References

No record.

Cite

APA: Copy

FAZLI, M., HAJIAGHAEI KESHTELI, M., & Fathollahi Fard, A.M.. (2017). ADDRESSING THE VEHICLE ROUTING PROBLEM IN LARGE SCALE NETWORK VIA NOVEL NATURE-INSPIRED ALGORITHM. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/938284/en

Vancouver: Copy

FAZLI M., HAJIAGHAEI KESHTELI M., Fathollahi Fard A.M.. ADDRESSING THE VEHICLE ROUTING PROBLEM IN LARGE SCALE NETWORK VIA NOVEL NATURE-INSPIRED ALGORITHM. 2017. Available from: https://sid.ir/paper/938284/en

IEEE: Copy

M. FAZLI, M. HAJIAGHAEI KESHTELI, and A.M. Fathollahi Fard, “ADDRESSING THE VEHICLE ROUTING PROBLEM IN LARGE SCALE NETWORK VIA NOVEL NATURE-INSPIRED ALGORITHM,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/938284/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops