Search

This paper presents a research that investigates solutions and algorithms for determining the optimum machine layout served by autonomous material handling system, like mobile robot or automated guided vehicle. Unlike previous works which solved the layout problem by optimizing the distance between facilities, in this paper the machine layout is addressed based on optimizing the travel time of the material handling system. The proposed approach can include boundary kinematic constraints of vehicle while optimizing the objective function such as velocity, acceleration, orientation, and trajectory curvature. The nonlinear constrained model is transformed to unconstrained problem using penalty method. Then, a simulated annealing-based algorithm is used to search for the optimum locations of machines among all possible feasible layouts. The simulation results showed that the proposed approach was efficient enough to use in real factories due to including a vehicle path planner integrated in an overall layout design scheme that involves searching of vehicle control parameters. [ABSTRACT FROM AUTHOR]

This paper presents an optimized path generation algorithm for direction parallel milling, which is commonly used in the roughing and finishing stages. First, a geometrically efficient tool path generation algorithm using an intersection points graph is introduced. Second, the generated tool path is modified as an optimized tool path that maintains a constant material removal rate to achieve a constant cutting force and avoid chatter vibration, and the results are verified. Additional tool path segments are appended to the basic tool path through a pixel-based simulation technique. The algorithm is implemented for two-dimensional contiguous end milling operations with flat end mills, and cutting tests are conducted by measuring the spindle current, which reflects the changing machining situations, to verify the performance of the proposed method. [ABSTRACT FROM AUTHOR]

With the development of casting process and its numerical simulation technique, many demands of realism and clearness in post-processing have arisen. This paper introduces the implicit surface to post-processing for the results of casting simulation so as to meet these demands. In this paper, a robust and fully automatic algorithm is proposed for extracting the implicit surface in the signed distance function calculated from the import stereolithography files. Then several applications of implicit surface in the post-processing of casting simulation are listed in two categories. The applications in the first category include fast rendering of massive data, section view in arbitrary direction, visualization of residual liquid, and casting deformation, giving clear and pretty visualization of the results in simulation, and making it possible for engineers and process designers to look through the opaque mold, gain insights to casting process, and locate possible defects. The applications in the second category involve thickness distribution and modulus calculation, which offer important characteristics of castings and facilitate the optimization of casting processes. [ABSTRACT FROM AUTHOR]

In this paper, the berth allocation problem with stochastic vessel handling times is formulated as a bi-objective problem. To solve the resulting problem, an evolutionary algorithm-based heuristic and a simulation-based Pareto front pruning algorithm is proposed. Computational examples show that the proposed approach provides solutions superior to the ones where the expected value of the vessel handling times is used. [ABSTRACT FROM AUTHOR]

Due to the continuous growth in the application of networks in manufacturing, quality of service (QoS) has become an important issue. In this paper, the concept of QoS for manufacturing networks is discussed. To provide overall performance assurance for manufacturing networks, a service framework integrating the QoS mechanisms of the networked resource service management function and the communication networks is proposed. The novel framework maps an application to resource services and then to communication networks, adopts an intelligent optimisation algorithm for QoS management of resource services, and provides QoS schemes for data transfer across communication networks. A prototype implementation has been realised and a set of simulation experiments conducted to evaluate the validity of the framework. The results obtained demonstrate the ability of the framework to satisfy the various performance requirements posed by such applications and provide efficient overall performance assurance for manufacturing networks. [ABSTRACT FROM AUTHOR]

The main point of this paper is to provide a simple and efficient threshold value for the threshold accepting (TA) algorithm to attempt an optimal solution for the regular grid travelling salesman problems (TSPs) in a reliable way. This new algorithm is named the single value threshold accepting algorithm (SVTA). The number of the threshold value is one and its value is: [(2-√2)g*10,0001/10,000 where g is the grid size and [x] is the smallest integer not less than a real number x. For the regular-grid TSPs, g can be set as 1/√n where n is the problem size. It is shown empirically, with 100 independent simulations performed with 441 cities, in 16 different cases, that the SVTA is far superior to (at least five times faster on average than) the previous double threshold accepting (DTA) with respect to the speed of finding a global optimal reliably. Particularly in the case of the 441 cities, the proposed algorithm is at least 21 times faster and rises up to 96 times on average and optimistically 284 times faster than the previous one. Important insight is provided that reveals how the formula works and why it works successfully. [ABSTRACT FROM AUTHOR]

With the aim to achieve the dwell time calculation and the optimization of tool path planning in optical figuring, an improved algorithm is proposed and experimentally validated. Firstly, the principle of the algorithm is introduced, of which tool path planning is added. After that, a two-part simulation is conducted. In the first part, the high convergence accuracy of the proposed algorithm is verified. And it also reveals that although the convergence accuracy of the algorithm without tool path planning is higher, the surface grid size changes with the tool path spacing (TPS) would affect the initial surface error and make the algorithm unpractical. In the second part, the optimization of tool path planning using the proposed algorithm is investigated, in terms of RMS, polishing time, and polishing track. The result reveals that the proposed algorithm can be used to find out the optimal TPS. Finally, polishing experiment is carried out, by using the optimal TPS obtained from the optimization process. Considering the instability of the removal functions in the polishing process and the gradient of the initial surface, the experimental result has shown an acceptable convergence ratio. Therefore, the accuracy and practicality of the presented algorithm are proven. [ABSTRACT FROM AUTHOR]

An improved artificial bee colony (IABC) optimization algorithm for the accurate evaluation of minimum zone axis straightness error from a set of coordinate measurement data points was proposed. In the proposed algorithm, the opposition-based learning method was employed to produce initial population and scouts, the employed bees used greedy selection mechanism to update the best food source achieved so far one by one, and a new search mechanism inspired by differential evaluation was used for onlookers. The nonlinear mathematical model for axis straightness error evaluation and the fitness function of IABC were introduced in detail. Four classical test functions were selected in the experiments; the simulation results verified the feasibility of IABC algorithm. According to two practical examples, the results obtained by the IABC algorithm are more accurate and efficient than other conventional methods. It is a unified approach for other form and position error evaluations and is well suited for high-precision measuring equipments such as the CMM. [ABSTRACT FROM AUTHOR]

The loading path is crucial to the quality of forming parts in the process of tube hydroforming, and thus the design and optimization of loading path is an important issue for tube hydroforming. Wrinkling is a catastrophic defect for thin-walled tube hydroforming. In order to avoid wrinkling, an adaptive simulation approach integrated with a fuzzy control algorithm is used to optimize the loading path of hydroforming a T-shaped tube. The tubular material used is stainless steel and has an outer diameter of 103 mm and the wall thickness of 1.5 mm. The controlled variables are the axial feeding, the counterpunch displacement, and the internal pressure. A code is developed to make the optimization automatically, which works together with LS-DYNA. Six evaluation functions are adopted for identifying geometrical shape and quality of T-shape. Failure indicators obtained from the simulation results are used as the input of the fuzzy control, and then process parameters are adjusted according to the expert experiences in the fuzzy controller. In this way, a reasonable loading path for producing a sound T-shape is obtained, and also a T-shaped product is successfully hydroformed by experiment. The result shows that the fuzzy control algorithm can provide an adequately reliable loading path for hydroforming T-shaped tubes. [ABSTRACT FROM AUTHOR]