---

The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the increased economic competition. This research is mainly concerned with the Intermodal Terminal Location Problem introduced recently in scientific literature which consists to determine a set of potential sites to open and how to route requests to a set of customers through the network while minimizing the total cost of transportation. We begin by presenting a description of the problem. Then, we present a mathematical formulation of the problem and discuss the sense of its constraints. The objective function to minimize is the sum of road costs and railroad combined transportation costs. As the Intermodal Terminal Location Problemproblem is NP-hard, we propose an efficient real coded genetic algorithm for solving the problem. Our solutions are compared to CPLEX and also to the heuristics reported in the literature. Numerical results show that our approach outperforms the other approaches.

---

Regarding the large number of developed Particle Swarm Optimization (PSO) algorithms and the various applications for which PSO has been used, selecting the most suitable variant of PSO for solving a particular optimization problem is a challenge for most researchers. In this paper, using a comprehensive survey and taxonomy on different types of PSO, an Expert System (ES) is designed to identify the most proper PSO for solving different optimization problems. Algorithms are classified according to aspects like particle, variable, process, and swarm. After integrating different acquirable information and forming the knowledge base of the ES consisting 100 rules, the system is able to logically evaluate all the algorithms and report the most appropriate PSO-based approach based on interactions with users, referral to knowledge base and necessary inferences via user interface. In order to examine the validity and efficiency of the system, a comparison is made between the system outputs against the algorithms proposed by newly published articles. The result of this comparison showed that the proposed ES can be considered as a proper tool for finding an appropriate PSO variant that matches the application under consideration.

---

Accidents and natural disasters and crises coming out of them indicate the importance of an integrated planning to reduce their effected. Therefore, disaster relief logistics is one of the main activities in disaster management. In this paper, we study the response phase of the disaster management cycle and a bi-objective model has been developed for relief chain logistic in uncertainty condition including uncertainty in traveling time an also amount of demand in damaged areas. The proposed mathematical model has two objective functions. The first one is to minimize the sum of arrival times to damaged area multiplying by amount of demand and the second objective function is to maximize the minimum ratio of satisfied demands in total period in order to fairness in the distribution of goods. In the proposed model, the problem has been considered periodically and in order to solve the mathematical model, Global Criterion method has been used and a case study has been done at South Khorasan.

---

The study determined optimum inventory levels for various bakery resources using the bread supply chain network in Onitsha City. Structured questionnaires were administered among bakery factories. The optimum design achieved through the optimization model was compared with the existing systems. Analysis of 90 bakeries with a combined capacity of 3960 revealed that total money N 564,408,477.28 is spent on energy annually. Of this amount, 66.75% is expended annually to meet diesel requirements, while firewood and petrol account for 22.57% and 10.66%, respectively. The results of the ABC analysis show that flour ranks as class A with over 78%, followed by sugar at 13%, whilst the remainder of the ingredients constitutes 9%. High operating costs was identified as a major factor militating against the growth of the sector. Consequently, baked bread is expensive and remuneration is very poor, making the industry less attractive. The implementation of optimization practice adds value leading to savings amounting to N 6,957.51, thus enhancing the supply chain competiveness. The annual supply chain performance measured by inventory turnover shows a frequency of 73 inventory turns. Since the bakeries contribute to ensuring food security, these findings, if implemented, will assuage the rising food insecurity in the nation.

---

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP.

---

In this paper, robust optimization of a bi-objective mathematical model in a dynamic cell formation problem considering labor utilization with uncertain data is carried out. The robust approach is used to reduce the effects of fluctuations of the uncertain parameters with regards to all the possible future scenarios. In this research, cost parameters of the cell formation and demand fluctuations are subject to uncertainty and a mixed-integer programming (MIP) model is developed to formulate the related robust dynamic cell formation problem. Then the problem is transformed into a bi-objective linear one. The first objective function seeks to minimize relevant costs of the problem including machine procurement and relocation costs, machine variable cost, inter-cell movement and intra-cell movement costs, overtime cost and labor shifting cost between cells, machine maintenance cost, inventory, holding part cost. The second objective function seeks to minimize total man-hour deviations between cells or indeed labor utilization of the modeled.

---

In most manufacturing processes, each product may contain a variety of quality characteristics which are of the interest to be optimized simultaneously through determination of the optimum setting of controllable factors. Although, classic experimental design presents some solutions for this regard, in a fuzzy environment, and in cases where the response data follow non-normal distributions, the available methods do not apply any more. In this paper, a general framework is introduced in which NORTA inverse transformation technique and fuzzy goal programming are used to deal with non-normality distribution of the response data and the fuzziness of response targets respectively. Moreover, the presented framework uses a simulation approach to investigate the effectiveness of the determined setting of controllable factors obtained from statistical analysis, for optimization of sink mark index, deflection rate and volumetric shrinkage in plastic molding manufacturing processes. The accuracy of the proposed method is verified through a real case study.

---

In this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. Various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. The goal of the proposed model is to efficiently respond to the customers’ demands in the presence of the pre-existing competitors and the price inelasticity of demands. The proposed optimization model considers multiple objectives that incorporate both market share and total profit of the considered supply chain network, simultaneously. To tackle the proposed multi-objective mixed-integer nonlinear programming model, an efficient hybrid meta-heuristic algorithm is developed that incorporates a Taguchi-based non-dominated sorting genetic algorithm-II and a particle swarm optimization. A variable neighborhood decomposition search is applied to enhance a local search process of the proposed hybrid solution algorithm. Computational results illustrate that the proposed model and solution algorithm are notably efficient in dealing with the competitive pressure by adopting the proper marketing strategies.

---

The school bus routing problem (SBRP) represents a variant of the well-known vehicle routing problem. The main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. In this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. Exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. Two metaheuristics, called N-ILS (a variant of the Nearest Neighbourhood with Iterated Local Search algorithm) and I-ILS (a variant of Insertion with Iterated Local Search algorithm) are proposed to solve SBRP. Our experimental procedure is based on the two data sets. The results show that N-ILS is able to obtain better solutions in shorter computing times. Additionally, N-ILS appears to be very competitive in comparison with the best existing metaheuristics suggested for SBRP