In this study, teaching-learning-based optimization (TLBO) algorithm is employed for the first time for optimization of real world truss bridges. The objective function considered is the weight of the structure subjected to design constraints including internal stress within bar elements and serviceability (deflection). Two examples demonstrate the effectiveness of TLBO algorithm in optimizatio...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

Meta-heuristic algorithms inspired by the natural processes are part of the optimization algorithms that they have been considered in recent years, such as genetic algorithm, particle swarm optimization, ant colony optimization, Firefly algorithm. Recently, a new kind of evolutionary algorithm has been proposed that it is inspired by the human sociopolitical evolution process. This new algorith...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

Particle swarm optimization (PSO) algorithm is a heuristic optimization technique based on colony intelligence, developed through inspiration from social behaviors of bird flocks and fish schools. It is widely used in problems in which the optimal value of an objective function is searched. Geometrically nonlinear analysis of trusses is a problem of this kind. The deflected shape of the truss w...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

This paper proposes a refined version of particle swarm optimization technique for the optimum design of steel structures. Swarm is composed of a number of particles and each particle in the swarm represents a candidate solution of the optimum design problem. Design constraints in accordance with ASD-AISC (Allowable Stress Design Code of American Institute of Steel Institution) are imposed by t...

The goal of this thesis is the development of theoretical methods targeting the implementation of topology optimization in structural engineering applications. In civil engineering applications, structures are typically assemblies of many standardized components, such as bars, where the largest gains in efficiency can be made during the preliminary design of the overall structure [4]. The work ...

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...