Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Effective neural algorithms for the traveling salesman problem
Neural Networks
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Tabu search performance on the symmetric traveling salesman problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Evolutionary divide and conquer (i): A novel genetic approach to the tsp
Evolutionary Computation
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Operations Research Letters
| Hi-index | 0.00 |
With the rapid growth of printed circuit board technology today, board density is becoming an important concern. In every aspect of production, productivity and cost are crucial matters. The aim of this research is the optimization of printed circuit board manufacturing by improving the process productivity. Attention was focused on reducing tool path length and processing time. The paper is divided in two main parts. First part presents an original hybrid heuristic algorithm, for solving traveling salesman problem. The algorithm is based on the structure of a general optimization procedure, and is used to reduce the tool path length. Also, it is developed a practical mathematical model for printed circuit board processing time calculation. The case study on the second part of the paper shows basically the efficient use of the above algorithm in finding the optimal length of the tool path. It is shown the influence of stacked printed circuit board on process productivity. By means of its concepts management, the paper represent a real guide for optimal design of printed circuit board drilling technology.