Abstract
According to previous researches, automated guided vehicles and quay cranes in container terminals have a high potential synergy. In this paper, a mixed integer programming model is formulated to optimize the coordinated scheduling of cranes and vehicles in container terminals. Objectives of the model are to minimize total traveling time of the vehicles and delays in tasks of cranes. A genetic algorithm is developed to solve the problem in reasonable computational time. The most appropriate control parameters for the proposed genetic algorithm are investigated in a medium size numerical test case. It is shown that balanced crossover and mutation rates have the best performance in finding a near optimal solution for the problem. Then, ten small size test cases are solved to evaluate the performance of the proposed optimization methods. The results show the applicability of the genetic algorithm since it can find near optimal solutions, precisely and accurately.

Abstract
Bonding is an important process used in all fields of industry, where the tight joining of two materials is required. It includes a wide variety of processing technologies that can be placed in a framework of chemistry, physics, and materials science. Although most of these bonding processes have only recently appeared in textbooks, the basic phenomena have been known and used for many centuries. Choosing an appropriate bonding process may result in the improved end-use performance, increased efficiency, and greater design flexibility. Through various bonding techniques, this study aims at investigating the following ones: direct bonding, thermocompression bonding, surface activated bonding, eutectic bonding, adhesive bonding, and glass frit bonding. The characteristic features of these techniques with respect to their many-sided aspects and a review of the current state of the art of each technique are briefly outlined in this chapter.

Abstract

Abstract
Neural regression provides a rapid solution to modeling complex systems with minimal computation effort. Recurrent structures such as fuzzy cognitive map (FCM) enable for drawing cause effect relationships among system variables assigned to graph nodes. Accordingly, the obtained matrix of edges, known as adjacency model, represents the overall behavior of the system. With this, there are many applications of semantic networks in data mining, computational geometry, physics-based modeling, pattern recognition, and forecast. This article examines a methodology for drawing application-specific adjacency models. The idea is to replace crisp neural weights with functions such as polynomials of desired degree, a property beyond the current scope of neural regression. The notion of natural adjacency matrix is discussed and examined as an alternative to classic neural adjacency matrix. There are examples of stochastic and complex engineering systems mainly in the context of modeling residential electricity demand to examine the proposed methodology.

Abstract
Logistics network design is a major strategic issue due to its impact on the efficiency and responsiveness of the supply chain. This paper focuses on strategic and tactical design of steel supply chain (SSC) networks. Ever-increasing demand for steel products enforces the steel producers to expand their production and storage capacities. The main purpose of the paper includes preparing a countrywide production, inventory, distribution, and capacity expansion plan to design an SSC network. The SSC networks consist of iron ore mines as suppliers, raw steel producer companies as producers, and downstream steel companies as customers. Demand is assumed stochastic with normal distribution and known at the beginning of planning horizon. To achieve the service level of interest, a potential production capacity along with two kinds of safety stocks including emergency and shared safety stocks are suggested by the authors. A mixed integer nonlinear programming (MINLP) model and a mixed integer linear programming (MILP) model are presented to design dynamic multi-commodity SSC networks. To evaluate the performance of the MILP model, a real case of SSC network design is solved. Furthermore, solving two proposed models by using a commercial solver for a set of numerical test cases shows that the MILP model outperforms MINLP in medium- and large-scale problems in terms of computational time. Finally, the complexity of the linear model is investigated by relaxing some major assumptions.

Abstract
Commonly in container terminals, the containers are stored in yards on top of each other using yard cranes. The split-platform storage/retrieval system (SP-AS/RS) has been invented to store containers more efficiently and to access them more quickly. The integrated scheduling of quay cranes, automated guided vehicles and handling platforms in SP-AS/RS has been formulated and solved using the simulated annealing algorithm in previous literatures. This paper presents a genetic algorithm (GA) to solve this problem more accurately and precisely. The GA includes a new operator to make a random string of tasks observing the precedence relations between the tasks. For evaluating the performance of the GA, 10 small size test cases were solved by using the proposed GA and the results were compared to those from the literature. Results show that the proposed GA is able to find fairly near optimal solutions similar to the existing simulated annealing algorithm. Moreover, it is shown that the proposed GA outperforms the existing algorithm when the number of tasks in the scheduling horizon increases (e.g. 30 to 100).