Determining the optimum section of tunnels using ant colony optimization (Q460444): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59023587, #quickstatements; #temporary_batch_1711486342377
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved ant colony optimization for constrained engineering design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling of biological intelligence for SCM system optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering design optimization using chaotic enhanced charged system search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic dynamics on complex networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear coupled fractional differential equations by direct operational method and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank

Latest revision as of 03:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Determining the optimum section of tunnels using ant colony optimization
scientific article

    Statements

    Determining the optimum section of tunnels using ant colony optimization (English)
    0 references
    0 references
    13 October 2014
    0 references
    Summary: Ant colony optimization is developed to determine optimum cross sections of tunnel structures. Tunnel structures are expensive infrastructures in terms of material, construction, and maintenance and the application of optimization methods has a great role in minimizing their costs. This paper presents the formulation of objective function and constraints of the problem for the first time, and the ant colony optimization, as a developed metaheuristic approach, has been used to solve the problem. The results and comparisons based on numerical examples show the efficiency of the algorithm.
    0 references

    Identifiers