Cost and CO2 emission optimization of precast prestressed concrete U-beam road bridges by a hybrid glowworm swarm algorithm
This paper describes a methodology to optimize cost and CO2 emissions when designing precast-prestressed concrete road bridges with a double U-shape cross-section. To this end, a hybrid glowworm swarm optimization algorithm (SAGSO) is used to combine the synergy effect of the local search with simul...
| Authors: | , |
|---|---|
| Format: | article |
| Publication Date: | 2015 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | English |
| OAI Identifier: | oai:riunet.upv.es:10251/48918 |
| Online Access: | https://riunet.upv.es/handle/10251/48918 |
| Access Level: | Open access |
| Keyword: | Optimization Glowworm swarm algorithm Computer aided design Structural design Sustainable design Precast concrete Bridges INGENIERIA DE LA CONSTRUCCION |
| Summary: | This paper describes a methodology to optimize cost and CO2 emissions when designing precast-prestressed concrete road bridges with a double U-shape cross-section. To this end, a hybrid glowworm swarm optimization algorithm (SAGSO) is used to combine the synergy effect of the local search with simulated annealing (SA) and the global search with glowworm swarm optimization (GSO). The solution is defined by 40 variables, including the geometry, materials and reinforcement of the beam and the slab. Regarding the material, high strength concrete is used as well as self-compacting concrete in beams. Results provide engineers with useful guidelines to design PC precast bridges. The analysis also revealed that reducing costs by 1 Euro can save up to 1.75 kg in CO2 emissions. Finally, the parametric study indicates that optimal solutions in terms of monetary costs have quite a satisfactory environmental outcome and differ only slightly from the best possible environmental solution obtained. (C) 2014 Elsevier B.V. All rights reserved. |
|---|