A META HEURISTIC ALGORITHMS BASED ON ANT COLONY SYSTEM FOR SOLVING MULTI DEPOTS LOCATION-ROUTING PROBLEM WITH MULTIPLE USING OF VEHICLE

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.

RAZAVI MARYAM; SOUKHAKIAN MOHAMAD ALI; ZIARATI KOUROSH

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

Journal Paper

Paper Information

Journal: Industrial Management Journal Year:2011 | Volume:3 | Issue:6 Page(s): 17-38

Download Full-Text

Persian Verion

View:

1,471

Download:

Cites:

Information Journal Paper

Title

A META HEURISTIC ALGORITHMS BASED ON ANT COLONY SYSTEM FOR SOLVING MULTI DEPOTS LOCATION-ROUTING PROBLEM WITH MULTIPLE USING OF VEHICLE

Author(s)

RAZAVI MARYAM | SOUKHAKIAN MOHAMAD ALI | ZIARATI KOUROSH | Issue Writer Certificate

Keywords

META HEURISTICQ2

GREEDY SEARCHQ1

ANT COLONY SYSTEMQ2

BIN PACKING PROBLEMQ2

LOCATIONQ2

ROUTING PROBLEMQ1

Abstract

In a logistic system, decisions on LOCATION of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. The LOCATION-routing problems are defined to find the optimal number and LOCATIONs of depots, and at the same time with the distribution routes for the vehicles. Because of the complexity and the time consuming computation, this problem belongs to a class of combinatorial optimization and NP-hard problems. Finding an optimal solution for this type of complex, huge problem in reasonable computational time by using traditional and exact approaches and optimization tools is very difficult. So a META HEURISTIC algorithm based on ANT COLONY SYSTEM is proposed to solve this problem. According to the experiments, this proposed algorithm reports near-optimal and promising solutions in reasonable time. Also in this paper the assumption of assigning several routes to a vehicle during its available time is considered. Finally, the computational results obtained by this algorithm are compared with the results reported by Lingo software.

Cites

OPTIMIZATION OF OFFICE TRANSPORTATION SYSTEM BY USING CLUSTERING AND GENETIC ALGORITHMS

References

No record.

Cite

APA: Copy

RAZAVI, MARYAM, SOUKHAKIAN, MOHAMAD ALI, & ZIARATI, KOUROSH. (2011). A META HEURISTIC ALGORITHMS BASED ON ANT COLONY SYSTEM FOR SOLVING MULTI DEPOTS LOCATION-ROUTING PROBLEM WITH MULTIPLE USING OF VEHICLE. JOURNAL OF INDUSTRIAL MANAGEMENT, 3(6), 17-38. SID. https://sid.ir/paper/139987/en

Vancouver: Copy

RAZAVI MARYAM, SOUKHAKIAN MOHAMAD ALI, ZIARATI KOUROSH. A META HEURISTIC ALGORITHMS BASED ON ANT COLONY SYSTEM FOR SOLVING MULTI DEPOTS LOCATION-ROUTING PROBLEM WITH MULTIPLE USING OF VEHICLE. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2011;3(6):17-38. Available from: https://sid.ir/paper/139987/en

IEEE: Copy

MARYAM RAZAVI, MOHAMAD ALI SOUKHAKIAN, and KOUROSH ZIARATI, “A META HEURISTIC ALGORITHMS BASED ON ANT COLONY SYSTEM FOR SOLVING MULTI DEPOTS LOCATION-ROUTING PROBLEM WITH MULTIPLE USING OF VEHICLE,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 3, no. 6, pp. 17–38, 2011, [Online]. Available: https://sid.ir/paper/139987/en

Related Journal Papers