Application of Intelligence Fusion Algorithm in Path Optimization Problem

2012 ◽  
Vol 151 ◽  
pp. 632-636 ◽  
Author(s):  
Shi Gang Wang ◽  
Yu Juan Wang ◽  
Guan Xiong Wu ◽  
Yi Li Fu
Keyword(s):  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Tool Path ◽  
Path Optimization ◽  
Fusion Algorithm ◽  
Drilling Tool ◽  
Integration System ◽  
Cad Cam ◽  
Set Up ◽  
The Mathematical Model

In CAD/CAM integration system, the problem of the path optimization to be thorough researched. Through numerical describe of information elements, by using graph theory of traveling salesman problem，set up the mathematical model of path optimization problem. Based on ant colony algorithm and lin-kernighan (LK) algorithm, an intelligence fusion algorithm is put forward. With group of holes processing as an example, the group of holes drilling tool path of optimized, and realize the CAD/CAM many features of optimization, which greatly improve the processing precision and efficiency.

Sheet Hemming with Rolling Tools: Analysis and Optimization of the Part Quality

2007 ◽  
Vol 344 ◽  
pp. 357-364 ◽  
Author(s):  
Elisabetta Ceretti ◽  
Aldo Attanasio ◽  
Antonio Fiorentino ◽  
Claudio Giardini
Keyword(s):  
Tool Path ◽  
Outer Part ◽  
Experimental Tests ◽  
Process Time ◽  
Cnc Machine ◽  
Whole Process ◽  
Cad Cam ◽  
In Series ◽  
Aluminium Sheets ◽  
Set Up

The present paper is the continuation of a research conducted on hemming operations by using rolling tools. Sheet hemming is a joining operation widely used in automotive industry when it is necessary to join two sheet parts (such as the engine hood or the door panels with their internal frame) by plastic deformation of the edge of the outer part. The whole process is characterised by a 90° sheet flanging, a pre-hemming (up to approximately 135°) and the final hemming where the outer sheet edge is bended up to 180° clamping the inner sheet. Hemming processes are normally performed using rigid dies in series production and manually in pre-series and small batch production, due to the high cost of the dies. Nowadays, rollers moved by robots are becoming an interesting alternative to the manual operations especially when flexible productions are required. Even if the process time is higher, this solution can help in minimizing set-up times and costs. The required equipments are a support and a blocking system for the sheets together with the rollers mounted on a CNC machine or on a robot. The production flexibility is guaranteed by changing the 3D tool path using a CAD/CAM system. Authors are dealing with this technique having conducted many experiments studying the influence of the hemming process parameters such as flange geometry (edge height, fillet radius), distance of the inner panel from the flange, tool path sequence, along straight paths on steel sheets. The goal of the present research is to study the material behaviour and the produced parts quality when working on aluminium sheets. In particular, both experimental tests and simulations will be carried out in order to optimize the process.

Based on Genetic Algorithm Research of Stocker Picking Shortest Path

2012 ◽  
Vol 155-156 ◽  
pp. 186-190
Author(s):  
Fu Cai Wan ◽  
Duo Chen ◽  
Yong Qiang Wu
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Optimization Problem ◽  
Traveling Salesman ◽  
Path Optimization ◽  
Improved Genetic Algorithm ◽  
Operating Process ◽  
Path Distance ◽  
Simulation Results ◽  
The Mathematical Model

This paper analyzes characteristics of automated warehouse stocker picking operating process. Path optimization problem is considered as traveling salesman problem. The coordinates of picking points by calculating determine a stocker running route. The mathematical model of a path distance is built. And using the improved genetic algorithm solves the above problem. Finally, M-file program of stocker running path optimization is written and run in MATLAB. The simulation results that, in solving stocker path optimization problem, it can search for a shortest path by genetic algorithm. Thereby enhance the efficiency of automated warehouse system, increase greater benefits of the enterprise.

Solution to Holes Machining Path Planning by Intelligence Computation

2013 ◽  
Vol 319 ◽  
pp. 491-496
Author(s):  
Jing Zhang
Keyword(s):  
Production Efficiency ◽  
Ant Colony Algorithm ◽  
Tool Path ◽  
Simulated Annealing Algorithm ◽  
Movement Time ◽  
Rapid Development ◽  
Optimization Techniques ◽  
Path Optimization ◽  
Circuit Board ◽  
Local Optimum

The rapid development of electronic information industry has posed serious challenges to the electronics manufacturing technology and intense competition in the market. For the most basic parts of electronic components - holes of the printed circuit board processing efficiency issues need to be resolved, the machining tool path optimization techniques. Optimize holes machining path reducing tool movement time is an effective way to improve production efficiency. Machining path optimization problem is transformed into a traveling salesman problem, shortest processing path established path optimization mathematical model on the basis of the model, the analysis of a variety of typical optimization algorithm, simulated annealing algorithm, genetic algorithm, ant colony algorithm, particle swarm optimization, comparing the various algorithms, based on theoretical analysis and experimental research, for the complexity of the algorithm evaluation, flexibility, local optimum probability, feedback information utilization and weight.

Study on the Path Optimized Method Based on an Improved Clustering Ant Colony Algorithm for CNC Laser Drilling

2014 ◽  
Vol 556-562 ◽  
pp. 4439-4442 ◽  
Author(s):  
En Te Guo ◽  
Ting Wu ◽  
Li Bing Zhang ◽  
Feng Li Huang
Keyword(s):  
Mathematical Model ◽  
Ant Colony Algorithm ◽  
Laser Drilling ◽  
Ant Colony ◽  
Path Optimization ◽  
Experimental Result ◽  
Machining Efficiency ◽  
Clustering Approach ◽  
The Mathematical Model ◽  
Improved Ant Colony Algorithm

In order to improve the machining efficiency of the CNC laser drilling, this paper presents the path optimized method based on an improved ant colony algorithm of the k-means clustering approach. The mathematical model of the path optimization is constructed, and the path optimized method based on the improved clustering ant colony algorithm is designed and actualized. The optimized path method for CNC laser drilling based on the improved clustering ant colony algorithm is tested, and the simulative and experimental result have shown that the proposed method is better performance, and the machining efficiency is greatly improved.

An Improved Ant Colony Algorithm Based on Path Optimization Strategy for TSP

2014 ◽  
Vol 543-547 ◽  
pp. 1681-1684 ◽  
Author(s):  
Ben Can Gong ◽  
Ting Yao Jiang ◽  
Shou Zhi Xu ◽  
Peng Chen
Keyword(s):  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Ant Colony ◽  
Path Optimization ◽  
Optimization Strategy ◽  
Local Optimal Solution ◽  
Np Hard Problem ◽  
Improved Ant Colony Algorithm ◽  
High Application

Traveling salesman problem (TSP) is not only a combinatorial optimization problem but also a classical NP-hard problem, which has high application value. Ant colony algorithm (ACA) is very effective for solving TSP problem, but basic ant colony algorithm has drawbacks of low convergence rate and easily trapping in local optimal solution. An improved ant colony algorithm was proposed. It used path optimization strategy to exchange the position of cities to find the better solution for TSP. Simulation results show the improved algorithm has better optimal solution and higher efficiency.

scholarly journals Application of precedence constrained travelling salesman problem model for tool path optimization in CNC milling machines

2019 ◽  
Vol 9 (3) ◽  
pp. 59-68
Author(s):  
Ilker Kucukoglu ◽  
Tulin Gunduz ◽  
Fatma Balkancioglu ◽  
Emine Chousein Topal ◽  
Oznur Sayim
Keyword(s):  
Optimization Problem ◽  
Tool Path ◽  
Travelling Salesman Problem ◽  
Numerical Control ◽  
Path Optimization ◽  
Cnc Milling ◽  
Travelling Salesman ◽  
Tool Path Optimization ◽  
Milling Machines ◽  
Internal Operations

In this study, a tool path optimization problem in Computer Numerical Control (CNC) milling machines is considered to increase the operational efficiency rates of a company. In this context, tool path optimization problem of the company is formulated based on the precedence constrained travelling salesman problem (PCTSP), where the general form of the TSP model is extended by taking the precedence of the tool operations into account. The objective of the model is to minimize total idle and unnecessary times of the tools for internal operations. To solve the considered problem, a recent optimization algorithm, called Satin Bowerbird Optimizer (SBO), is used. Since the SBO is first introduced for the global optimization problems, the original version of the SBO is modified for the PCTSP with discretization and local search procedures. In computational studies, first, the performance of the proposed algorithm is tested on a well-known PCTSP benchmark problems by comparing the proposed algorithm against two recently proposed meta-heuristic approaches. Results of the comparisons show that the proposed algorithm outperforms the other two competitive algorithms by finding better results. Then, the proposed algorithm is carried out to optimize the hole drilling processes of three different products produced by the company. For this case, with up to 4.05% improvement on the operational times was provided for the real-life problem of the company. As a consequence, it should be noted that the proposed solution approach for the tool path optimization is capable of providing considerable time reductions on the CNC internal operations for the company.

Path Optimization for Automatic Guided Vehicle Based on Fusion Algorithm of Particle Swarm and Ant Colony

2012 ◽  
Vol 182-183 ◽  
pp. 1452-1457 ◽  
Author(s):  
Yuan Bin Hou ◽  
Yi Qian Yuan ◽  
Bai Ping Li
Keyword(s):  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Particle Swarm ◽  
Ant Colony ◽  
Path Optimization ◽  
Particle Swarm Algorithm ◽  
Ant System ◽  
Fusion Algorithm ◽  
Automatic Guided Vehicle ◽  
Swarm Algorithm

Aim at search precocity of particle swarm algorithm and slow convergence speed problem for ant colony algorithm, in the automatic guided vehicle path optimization a path optimization algorithm is proposed, which is fused by particle swarm algorithm and ant colony algorithm. Firstly, robot motion space model of the algorithm is created using link figure. After got fixed circulation rapid global, search to get more optimal path by means of improved fastest convergence ant system, then using a particle ants information communication method to update pheromone, finally, optimal path is drew. The simulation experiment shows that, even in the complex environment, this algorithm can also has the advantage of ant colony algorithm to optimize the result accurately and particle swarm algorithm local optimization accurately and rapidly, and a global security obstacle avoidance of optimal path is plot, the route is shorten 8% compare than the general ant colony algorithm.

Research on Dynamic Balance Method of Precision Centrifuge

2014 ◽  
Vol 945-949 ◽  
pp. 777-780
Author(s):  
Tao Liu ◽  
Yong Xu ◽  
Bo Yuan Mao
Keyword(s):  
Mathematical Model ◽  
Balance Control ◽  
Dynamic Balance ◽  
Dynamic Balancing ◽  
Structure Characteristics ◽  
Balance System ◽  
Simulation Results ◽  
Set Up ◽  
System Controller ◽  
The Mathematical Model

Firstly, according to the structure characteristics of precision centrifuge, the mathematical model of its dynamic balancing system was set up, and the dynamic balancing scheme of double test surfaces, double emendation surfaces were established. Then the dynamic balance system controller of precision centrifuge was designed. Simulation results show that the controller designed can completely meet the requirements of precision centrifuge dynamic balance control system.

Sign in / Sign up

Export Citation Format

Share Document