Solution of Branched Network Problems Using Meta-heuristics

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Over the last few years, meta-heuristics algorithms are very popular for solving different types of optimization problems in various fields. In the present study, three nature-inspired algorithms (PSO, ABC, CS), two evolutionary algorithms (GA, DE) and one classical method (SA) are applied in branched network problem to find optimal design cost of network. The branched network consists of two types of problems: first is single load branched network problem and second is multiple load branched network problem.

Cite

CITATION STYLE

APA

Bilal, Vig, G., & Pant, M. (2020). Solution of Branched Network Problems Using Meta-heuristics. In Advances in Intelligent Systems and Computing (Vol. 1053, pp. 439–452). Springer. https://doi.org/10.1007/978-981-15-0751-9_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free