CUCKOO SEARCH VIA LE´ VY FLIGHTS FOR THE CAPACITATED VEHICLE ROUTINGPROBLEM

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.

SANTILLAN JON HENLY; TAPUCAR SAMANTHA; MANLIGUEZ CINMAYII; CALAG VICENTE

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2018 | Volume:14 | Issue:2 Page(s): 293-304

Download Full-Text

View:

201

Download:

111

Cites:

Information Journal Paper

Title

CUCKOO SEARCH VIA LE´ VY FLIGHTS FOR THE CAPACITATED VEHICLE ROUTINGPROBLEM

Author(s)

SANTILLAN JON HENLY | TAPUCAR SAMANTHA | MANLIGUEZ CINMAYII | CALAG VICENTE | Issue Writer Certificate

Keywords

CAPACITATED VEHICLE ROUTING PROBLEM

COMBINATORIAL OPTIMIZATION

CUCKOO SEARCH

LE´

VY FLIGHTS

Abstract

For this paper, we explored the implementationof the cuckoo search algorithm applied to the capacitatedvehicle routing problem. The cuckoo search algorithm wasimplemented with LE´; VY FLIGHTS with the 2-opt and doublebridgeoperations, and with 500 iterations for each run. Thealgorithm was tested on the problem instances from theAugerat benchmark dataset. The algorithm did not performwell on the problem instances, save for a select few onwhich the algorithm achieved the close to near-optimalresult and one on which the algorithm achieved the optimalresult. Increasing the number of iterations for each run ofthe algorithm on the two large-scale problem instances ledto obtaining solutions closer to the optimal solution comparedto the ones obtained with fewer number iterations. This gives an idea that the larger the problem instancebecomes, the slower the algorithm converges to the optimalsolution. Several other factors may also have contributed tothe overall performance of the algorithm. Regardless of itsperformance, the algorithm was able to obtain routes thatsatisfied the constraints of the capacitated vehicle routingproblem. The potential of the cuckoo search algorithm insolving combinatorial problems is demonstrated in thisstudy in which the performance of the algorithm on routingproblems was explored.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SANTILLAN, JON HENLY, TAPUCAR, SAMANTHA, MANLIGUEZ, CINMAYII, & CALAG, VICENTE. (2018). CUCKOO SEARCH VIA LE´ VY FLIGHTS FOR THE CAPACITATED VEHICLE ROUTINGPROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 14(2), 293-304. SID. https://sid.ir/paper/310133/en

Vancouver: Copy

SANTILLAN JON HENLY, TAPUCAR SAMANTHA, MANLIGUEZ CINMAYII, CALAG VICENTE. CUCKOO SEARCH VIA LE´ VY FLIGHTS FOR THE CAPACITATED VEHICLE ROUTINGPROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2018;14(2):293-304. Available from: https://sid.ir/paper/310133/en

IEEE: Copy

JON HENLY SANTILLAN, SAMANTHA TAPUCAR, CINMAYII MANLIGUEZ, and VICENTE CALAG, “CUCKOO SEARCH VIA LE´ VY FLIGHTS FOR THE CAPACITATED VEHICLE ROUTINGPROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 14, no. 2, pp. 293–304, 2018, [Online]. Available: https://sid.ir/paper/310133/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops