We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

Flood is a common global natural hazard, and detailed flood susceptibility maps for specific watersheds are important management measures. We compute the map Kaiser watershed in Iran using machine learning models such as support vector (SVM), Particle swarm optimization (PSO), genetic algorithm (GA) along with ensembles (PSO-GA SVM-GA). The application of assessment mapping analyzed, future res...

The main aim of the present study is to achieve optimum design of reinforced concrete (RC) plane moment frames using bat algorithm (BA) which is a newly developed meta-heuristic optimization algorithm based on the echolocation behaviour of bats. The objective function is the total cost of the frame and the design constraints are checked during the optimization process based on ACI 318-08 code. ...

Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...