Abstract

A discrete variable optimization algorithm is presented based on peloton dynamics that occur during bicycle racing. Peloton dynamics are mainly attributable to the physical capacity of cyclists, energy saving by the coupling effects of drafting, and the capacity for cyclists to pass others. It also includes cooperating with other cyclists by changing positions inside the peloton, competitors’ positions, and their relative energy levels. The algorithm’s performance is tested on nine discrete benchmark truss structures subjected to multiple loading conditions. The performance of the peloton dynamics optimization (PDO) algorithm is compared with other optimization algorithms based on the success rate (ability to find the best solution) and computational effort (number of structural analyses required). Other metaheuristic methods generally consist of different components, and these components have several parameters that need to be set manually. As a result, it is not uncommon that these parameters need to be tuned to just the right values to obtain better results and are often specific to the problem to be solved. For the present algorithm, only two parameters are needed: the number of cyclists (solutions) and the maximum number of iterations. Results demonstrate that the performance of the PDO algorithm in terms of finding near optimum solutions and convergence behavior is comparable or better than various alternative optimization methods but with less user-specific parameter settings.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Some or all data, models, or code that support the findings of this study are available from the corresponding author upon reasonable request.

References

Achtziger, W., and M. Stolpe. 2007. “Truss topology optimization with discrete design variables-guaranteed global optimality and benchmark examples.” Struct. Multidiscip. Optim. 34 (1): 1–20. https://doi.org/10.1007/s00158-006-0074-2.
Achtziger, W., and M. Stolpe. 2008. “Global optimization of truss topology with discrete bar areas—Part I: Theory of relaxed problems.” Comput. Optim. Appl. 40 (2): 247–280. https://doi.org/10.1007/s10589-007-9138-5.
Achtziger, W., and M. Stolpe. 2009. “Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results.” Comput. Optim. Appl. 44 (2): 315–341. https://doi.org/10.1007/s10589-007-9152-7.
AISC. 1989. Specification for structural steel buildings. Chicago: AISC.
Azad, S. K., and O. Hasançebi. 2014. “An elitist self-adaptive step-size search for structural design optimization.” Appl. Soft Comput. 19 (Jun): 226–235. https://doi.org/10.1016/j.asoc.2014.02.017.
Bauer, J., W. Gutkowski, and Z. Iwanow. 1981. “A discrete method for lattice structures optimization.” Eng. Optim. 5 (2): 121–127. https://doi.org/10.1080/03052158108902439.
Bollapragada, S., O. Ghattas, and J. N. Hooker. 2001. “Optimal design of truss structures by logic-based branch and cut.” Oper. Res. 49 (1): 42–51. https://doi.org/10.1287/opre.49.1.42.11196.
Burke, E. R. 1996. High-tech cycling: The science of riding faster. Champaign, IL: Human Kinetics.
Camp, C. V. 2007. “Design of space trusses using big bang-big crunch optimization.” J. Struct. Eng. 133 (7): 999–1008. https://doi.org/10.1061/(ASCE)0733-9445(2007)133:7(999).
Camp, C. V., and B. J. Bichon. 2004. “Design of space trusses using ant colony optimization.” J. Struct. Eng. 130 (5): 741–751. https://doi.org/10.1061/(ASCE)0733-9445(2004)130:5(741).
Camp, C. V., and M. Farshchin. 2014. “Design of space trusses using modified teaching–learning based optimization.” Eng. Struct. 62–63 (Mar): 87–97. https://doi.org/10.1016/j.engstruct.2014.01.020.
Camp, C. V., S. Pezeshk, and G. Cao. 1998. “Optimized design of two-dimensional structures using a genetic algorithm.” J. Struct. Eng. 124 (5): 551–559. https://doi.org/10.1061/(ASCE)0733-9445(1998)124:5(551).
Capriles, P. V. S. Z., L. G. Fonseca, H. J. C. Barbosa, and A. C. C. Lemonge. 2007. “Rank-based ant colony algorithms for truss weight minimization with discrete variables.” Commun. Numer. Methods Eng. 23 (6): 553–575. https://doi.org/10.1002/cnm.912.
Cheng, M.-Y., D. Prayogo, Y.-W. Wu, and M. M. Lukito. 2016. “A hybrid harmony search algorithm for discrete sizing optimization of truss structure.” Autom. Constr. 69 (Sep): 21–33. https://doi.org/10.1016/j.autcon.2016.05.023.
Coello, C. A. 2002. “Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art.” Comput. Methods Appl. Mech. Eng. 191 (11–12): 1245–1287. https://doi.org/10.1016/S0045-7825(01)00323-1.
Coello, C. A., and A. D. Christiansen. 2000. “Multiobjective optimization of trusses using genetic algorithms.” Comput. Struct. 75 (6): 647–660. https://doi.org/10.1016/S0045-7949(99)00110-8.
Compton, T. 2018. “Analytical cycling.” Accessed November 15, 2018. www.analyticcycling.com.
CSA (Canadian Standard Association). 2009. Design of steel structures. CSA-S16-09. Rexdale, ON, Canada: CSA.
Dede, T., S. Bekiroğlu, and Y. Ayvaz. 2011. “Weight minimization of trusses with genetic algorithm.” Appl. Soft Comput. 11 (2): 2565–2575. https://doi.org/10.1016/j.asoc.2010.10.006.
Degertekin, S. O. 2012. “Improved harmony search algorithms for sizing optimization of truss structures.” Comput. Struct. 92–93 (Feb): 229–241. https://doi.org/10.1016/j.compstruc.2011.10.022.
DIN (Deutsches Institut fur Normung E.V.). 1994. Hot rolled equal leg angles with round toes dimensions, mass and static parameters. DIN 1028:1994-03. Berlin: DIN.
Dorigo, M. 1992. “Optimization, learning and natural algorithms.” Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano.
Elperin, T. 1988. “Monte Carlo structural optimization in discrete variables with annealing algorithm.” Int. J. Numer. Methods Eng. 26 (4): 815–821. https://doi.org/10.1002/nme.1620260405.
Erbatur, F., O. Hasançebi, I. Tütüncü, and H. Kiliç. 2000. “Optimal design of planar and space structures with genetic algorithms.” Comput. Struct. 75 (2): 209–224. https://doi.org/10.1016/S0045-7949(99)00084-X.
Geem, Z. W., J. H. Kim, and G. V. Loganathan. 2001. “A new heuristic optimization algorithm: Harmony search.” Simulation 76 (2): 60–68. https://doi.org/10.1177/003754970107600201.
Ghattas, O. N., and I. E. Grossmann. 1991. “MINLP and MILP strategies for discrete sizing structural optimization problems.” In Proc., ASCE 10th Conf. on Electronic Computation, 197–204. New York: ASCE.
Goldberg, D. E., and M. P. Samtani. 1986. “Engineering optimization via genetic algorithm.” In Proc., 9th Conf. on Electronic Computation, 471–482. New York: ASCE.
Groenwold, A. A., and N. Stander. 1997. “Optimal discrete sizing of truss structures subject to buckling constraints.” Struct. Optim. 14 (2): 71–80. https://doi.org/10.1007/BF01812508.
Groenwold, A. A., N. Stander, and J. A. Snyman. 1999. “A regional genetic algorithm for the discrete optimal design of truss structures.” Int. J. Numer. Methods Eng. 44 (6): 749–766. https://doi.org/10.1002/(SICI)1097-0207(19990228)44:6%3C749::AID-NME523%3E3.0.CO;2-F.
Grossmann, I. E., V. Voudouris, and O. Ghattas. 1992. “Mixed-integer linear programming reformulations for some nonlinear discrete design optimization problems.” In Recent advances in global optimization. Princeton, NJ: Princeton University Press.
Hagberg, J. M., and S. D. McCole. 1990. “The effect of drafting and aerodynamic equipment on the energy expenditure during cycling.” Cycling Sci. 2 (3): 19–22.
Hasançebi, O., and S. K. Azad. 2015. “Adaptive dimensional search: A new metaheuristic algorithm for discrete truss sizing optimization.” Comput. Struct. 154 (Jul): 1–16. https://doi.org/10.1016/j.compstruc.2015.03.014.
Hasançebi, O., and F. Erbatur. 2001. “Layout optimization of trusses using improved GA methodologies.” Acta Mech. 146 (1): 87–107. https://doi.org/10.1007/BF01178797.
Hasançebi, O., and F. Erbatur. 2002. “On efficient use of simulated annealing in complex structural optimization problems.” Acta Mech. 157 (1): 27–50. https://doi.org/10.1007/BF01182153.
Ho-Huu, V., T. Nguyen-Thoi, T. Vo-Duy, and T. Nguyen-Trang. 2016. “An adaptive elitist differential evolution for optimization of truss structures with discrete design variables.” Comput. Struct. 165 (Mar): 59–75. https://doi.org/10.1016/j.compstruc.2015.11.014.
Holland, J. H. 1992. Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
Jeukendrup, A. E., N. P. Craig, and J. A. Hawley. 2000. “The bioenergetics of world class cycling.” J. Sci. Med. Sport 3 (4): 414–433. https://doi.org/10.1016/S1440-2440(00)80008-0.
Juang, D. S., and W. T. Chang. 2006. “A revised discrete Lagrangian-based search algorithm for the optimal design of skeletal structures using available sections.” Struct. Multidiscip. Optim. 31 (3): 201–210. https://doi.org/10.1007/s00158-005-0571-8.
Kanno, Y., and X. Guo. 2010. “A mixed integer programming for robust truss topology optimization with stress constraints.” Int. J. Numer. Methods Eng. 83 (13): 1675–1699. https://doi.org/10.1002/nme.2871.
Karaboga, D. 2005. An idea based on honey bee swarm for numerical optimization. Kayseri, Turkey: Erciyes Univ.
Kaveh, A., and V. Kalatjari. 2002. “Genetic algorithm for discrete-sizing optimal design of trusses using the force method.” Int. J. Numer. Methods Eng. 55 (1): 55–72. https://doi.org/10.1002/nme.483.
Kaveh, A., and V. R. Mahdavi. 2014. “Colliding bodies optimization method for optimum discrete design of truss structures.” Comput. Struct. 139 (Jul): 43–53. https://doi.org/10.1016/j.compstruc.2014.04.006.
Kaveh, A., B. Mirzaei, and A. Jafarvand. 2015. “An improved magnetic charged system search for optimization of truss structures with continuous and discrete variables.” Appl. Soft Comput. 28 (Mar): 400–410. https://doi.org/10.1016/j.asoc.2014.11.056.
Kaveh, A., and H. Rahami. 2006a. “Analysis, design and optimization of structures using force method and genetic algorithm.” Int. J. Numer. Methods Eng. 65 (10): 1570–1584. https://doi.org/10.1002/nme.1506.
Kaveh, A., and H. Rahami. 2006b. “Nonlinear analysis and optimal design of structures via force method and genetic algorithm.” Comput. Struct. 84 (12): 770–778. https://doi.org/10.1016/j.compstruc.2006.02.004.
Kaveh, A., and S. Talatahari. 2009. “Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures.” Comput. Struct. 87 (5–6): 267–283. https://doi.org/10.1016/j.compstruc.2009.01.003.
Kennedy, J., and R. Eberhart. 1995. “Particle swarm optimization.” In Vol. 4 of Proc., IEEE Int. Conf. on Neural Networks, 1942–1948. New York: IEEE.
Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by simulated annealing.” Science 220 (4598): 671–680. https://doi.org/10.1126/science.220.4598.671.
Kyle, C. R. 1979. “Reduction of wind resistance and power output of racing cyclists and runners travelling in groups.” Ergonomics 22 (4): 387–397. https://doi.org/10.1080/00140137908924623.
Lamberti, L. 2008. “An efficient simulated annealing algorithm for design optimization of truss structures.” Comput. Struct. 86 (19–20): 1936–1953. https://doi.org/10.1016/j.compstruc.2008.02.004.
Lee, K. S., and Z. W. Geem. 2004. “A new structural optimization method based on the harmony search algorithm.” Comput. Struct. 82 (9–10): 781–798. https://doi.org/10.1016/j.compstruc.2004.01.002.
Lee, K. S., Z. W. Geem, S.-H. Lee, and K.-W. Bae. 2005. “The harmony search heuristic algorithm for discrete structural optimization.” Eng. Optim. 37 (7): 663–684. https://doi.org/10.1080/03052150500211895.
Li, L. J., Z. B. Huang, and F. Liu. 2009. “A heuristic particle swarm optimization method for truss structures with discrete variables.” Comput. Struct. 87 (7–8): 435–443. https://doi.org/10.1016/j.compstruc.2009.01.004.
Li, L.-J., Z. B. Huang, F. Liu, and Q. H. Wu. 2007. “A heuristic particle swarm optimizer for optimization of pin connected structures.” Comput. Struct. 85 (7–8): 340–349. https://doi.org/10.1016/j.compstruc.2006.11.020.
Luh, G.-C., and C.-Y. Lin. 2011. “Optimal design of truss-structures using particle swarm optimization.” Comput. Struct. 89 (23–24): 2221–2232. https://doi.org/10.1016/j.compstruc.2011.08.013.
Mahdavia, M., M. Fesanghary, and E. Damangir. 2007. “An improved harmony search algorithm for solving optimization problems.” Appl. Math. Comput. 188 (2): 1567–1579. https://doi.org/10.1016/j.amc.2006.11.033.
Martin, J. C., D. L. Milliken, J. E. Cobb, K. L. McFadden, and A. R. Coggan. 1998. “Validation of a mathematical model for road cycling power.” J. Appl. Biomech. 14 (3): 276–291. https://doi.org/10.1123/jab.14.3.276.
Mela, K. 2014. “Resolving issues with member buckling in truss topology optimization using a mixed variable approach.” Struct. Multidiscip. Optim. 50 (6): 1037–1049. https://doi.org/10.1007/s00158-014-1095-x.
Mezura-Montes, E., and C. A. Coello. 2011. “Constraint-handling in nature-inspired numerical optimization: Past, present and future.” Swarm Evol. Comput. 1 (4): 173–194. https://doi.org/10.1016/j.swevo.2011.10.001.
Miguel, L. F. F., and L. F. F. Miguel. 2012. “Shape and size optimization of truss structures considering dynamic constraints through modern metaheuristic algorithms.” Expert Syst. Appl. 39 (10): 9458–9467. https://doi.org/10.1016/j.eswa.2012.02.113.
Mortazavi, A., and V. Toğan. 2017. “Sizing and layout design of truss structures under dynamic and static constraints with an integrated particle swarm optimization algorithm.” Appl. Soft Comput. 51 (Feb): 239–252. https://doi.org/10.1016/j.asoc.2016.11.032.
Munoz, E., and M. Stolpe. 2011. “Generalized benders’ decomposition for topology optimization problems.” J. Global Optim. 51 (1): 149–183. https://doi.org/10.1007/s10898-010-9627-4.
NRC (National Research Council Canada). 2010. National building code of Canada. Ottawa: NRC.
Olds, T. 1998. “The mathematics of breaking away and chasing in cycling.” Eur. J. Appl. Physiol. 77 (6): 492–497. https://doi.org/10.1007/s004210050365.
Padilla, S., I. Mujika, J. Orbañanos, J. Santisteban, F. Angulo, and J. J. Goiriena. 2001. “Exercise intensity and load during mass-start stage races in professional road cycling.” Med. Sci. Sports Exercise 33 (5): 796–802. https://doi.org/10.1097/00005768-200105000-00019.
Perez, R. E., and K. Behdinan. 2007. “Particle swarm approach for structural design optimization.” Comput. Struct. 85 (19–20): 1579–1588. https://doi.org/10.1016/j.compstruc.2006.10.013.
Poitras, G. J., G. Cormier, and A. S. Nabolle. 2018. “Novel optimization algorithm for composite steel deck floor systems: Peloton dynamics optimization (PDO).” In Proc., CSCE 2018 Annual Conf. Montréal: Canadian Society for Civil Engineering.
Pyrz, M. 1990. “Discrete optimization of geometrically nonlinear truss structures under stability constraints.” Struct. Optim. 2 (2): 125–131. https://doi.org/10.1007/BF01745460.
Rajeev, S., and C. S. Krishnamoorthy. 1992. “Discrete optimization of structures using genetic algorithms.” J. Struct. Eng. 118 (5): 1233–1250. https://doi.org/10.1061/(ASCE)0733-9445(1992)118:5(1233).
Rajeev, S., and C. S. Krishnamoorthy. 1997. “Genetic algorithms-based methodologies for design optimization of trusses.” J. Struct. Eng. 123 (3): 350–358. https://doi.org/10.1061/(ASCE)0733-9445(1997)123:3(350).
Sadollah, A., H. Eskandar, A. Bahreininejad, and J. H. Kim. 2015. “Water cycle, mine blast and improved mine blast algorithms for discrete sizing optimization of truss structures.” Comput. Struct. 149 (Mar): 1–16. https://doi.org/10.1016/j.compstruc.2014.12.003.
Soh, C. K., and J. Yang. 1996. “Fuzzy controlled genetic algorithm search for shape optimization.” J. Comput. Civ. Eng. 10 (2): 143–150. https://doi.org/10.1061/(ASCE)0887-3801(1996)10:2(143).
Storn, R., and K. Price. 1997. “Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces.” J. Global Optim. 11 (4): 341–359. https://doi.org/10.1023/A:1008202821328.
Thierauf, G., and J. Cai. 1998. “Parallelization of the evolution strategy for discrete structural optimization problems.” Comput.-Aided Civ. Infrastruct. Eng. 13 (1): 23–30. https://doi.org/10.1111/0885-9507.00082.
Toakley, A. R. 1968. “Optimum design using available sections.” J. Struct. Div. 94 (5): 1219–1244. https://doi.org/10.1061/JSDEAG.0001952.
Toğan, V., and A. T. Daloğlu. 2008. “An improved genetic algorithm with initial population strategy and self-adaptive member grouping.” Comput. Struct. 86 (11–12): 1204–1218. https://doi.org/10.1016/j.compstruc.2007.11.006.
Tong, W. H., and G. R. Liu. 2001. “An optimization procedure for truss structures with discrete design variables and dynamic constraints.” Comput. Struct. 79 (2): 155–162. https://doi.org/10.1016/S0045-7949(00)00124-3.
Trenchard, H. 2012. “The complex dynamics of bicycle pelotons.” Preprint, submitted June 5, 2012. http://arxiv.org/abs/1206.0816.
Trenchard, H. 2013. “Peloton phase oscillations.” Chaos, Solitons Fractals 56 (Nov): 194–201. https://doi.org/10.1016/j.chaos.2013.08.004.
Trenchard, H., A. Richardson, E. Ratamero, and M. Perc. 2014. “Collective behavior and the identification of phases in bicycle pelotons.” Physica A 405 (Jul): 92–103. https://doi.org/10.1016/j.physa.2014.03.002.
Wu, S.-J., and P.-T. Chow. 1995. “Steady-state genetic algorithms for discrete optimization of trusses.” Comput. Struct. 56 (6): 979–991. https://doi.org/10.1016/0045-7949(94)00551-D.
Yang, X.-S. 2009. “Firefly algorithms for multimodal optimization.” In Vol. 76 of Stochastic algorithms: Foundations and applications, edited by O. Watanabe and T. Zeugmann, 169–178. Thousand Oaks, CA: SAGA.
Yang, X.-S., and S. Deb. 2009. “Cuckoo search via Lévy flights.” In Proc., of World Congress on Nature & Biologically Inspired Computing, 210–214. New York: IEEE.
Zhang, Y.-N., J.-P. Liu, B. Liu, C.-Y. Zhu, and Y. Li. 2005. “Application of improved hybrid genetic algorithm to optimized design of architecture structures.” J. South China Univ. Technol. 33 (3): 69–82.
Zorn, W. 2008. “Speed & power calculator.” Accessed November 15, 2018. http://kreuzotter.de/english/espeed.htm.

Information & Authors

Information

Published In

Go to Journal of Structural Engineering
Journal of Structural Engineering
Volume 147Issue 10October 2021

History

Received: Nov 19, 2019
Accepted: Apr 23, 2021
Published online: Aug 7, 2021
Published in print: Oct 1, 2021
Discussion open until: Jan 7, 2022

Permissions

Request permissions for this article.

Authors

Affiliations

Professor, Dept. of Civil Engineering, Université de Moncton, Moncton, NB, Canada E1A 3E9 (corresponding author). ORCID: https://orcid.org/0000-0003-0286-3195. Email: [email protected]
Professor, Dept. of Electrical Engineering, Université de Moncton, Moncton, NB, Canada E1A 3E9. ORCID: https://orcid.org/0000-0001-7514-7072. Email: [email protected]
Armel Stanislas Nabolle [email protected]
Undergraduate Student, Dept. of Civil Engineering, Université de Moncton, Moncton, NB, Canada E1A 3E9. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

  • Multi-objective SHADE with manta ray foraging optimizer for structural design problems, Applied Soft Computing, 10.1016/j.asoc.2023.110016, 134, (110016), (2023).

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share