In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

the main design objective of axial compressor is the efficiency increasing, pressure ratio and weight loss. these three parameters are used as an objective function and they are computed according to adopted design procedures. in this paper, a design method is presented that named quasi-three-dimensional. physical flow conditions are applied to design by some constraints to avoid irrational res...

improving mechanical properties of composites based on strength-to-weight ratio has been gained much attention in various applications. having the most resistant and at the same time the lightest and the most economical structure is believed as an aim in these applications. these three factors are usually opposed to each other. so, applying optimization algorithms for improving mechanical prope...

The two-stage assembly flowshop scheduling problem is addressed with the objective of minimizing total tardiness. An insertion algorithm, a genetic algorithm, and a hybrid of the insertion and genetic algorithms, are developed for the problem. Conducted computational experiments reveal that the hybrid algorithm significantly outperforms the genetic algorithm while the best performing algorithm ...

The aim of this study is to present a hybrid algorithm based on two meta-heuristic algorithms named Vibration Damping Optimization (VDO) algorithm and Genetic Algorithm (GA) for solving the stochastic capacitated location-allocation problem. For solving the model more efficiently, the simplex algorithm, stochastic simulation and the proposed hybrid algorithm are integrated to design a powerful ...

G/SPLINES ate a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least-squares computations, and allows significantly larger problems to be considered.

in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

A hybrid Neural-Genetic algorithm (NG) is presented for FPGA Segmented Channel Routing Problems (FSCRP). The NG algorithm consists in a Hopfield Neural Network (HNN) which manages the problem constraints, hybrided with a Genetic Algorithm (GA) for improving the solutions obtained. Six hard FSCRP instances have been generated in order to test the performance of the NG algorithm. Key-Words: FPGAs...