2009 · 18 citations · 4 references
ComputingManufacturing EngineeringDesign OptimizationOptimizationProduction PlanningCombinatorial OptimizationGenetic AlgorithmsGeometric OptimizationHeuristic OptimizationHeuristic SearchShortest Path AlgorithmsManufacturingProgram OptimizationShortest Path LengthShortest Path ModelingShortest Path OptimizationTool Path OptimizationToolpath OptimizationTraveling Salesman Problem
Applies TSP(Traveling Salesman Problem) and solving algorithm to hole swarm NC programing, it could optimize tool path, reduce cutting time. According to points coordinates, the distance between points could be computed, take the link lines and distance between points as factors, the TSP model could be established. Applies backtracking algorithm and genetic algorithm to solve this model, the shortest path length that pass through all points could be ascertained, NC program could be made rapidly through software based on the algorithm, in CAD/CAM system, combined with this method, to some parts and products composed of large numbers of holes characteristic, the optimization of tool path and rapid making of NC program could be accomplished and the manufacturing efficiency could be improved.
4
Molecular Computation of Solutions to Combinatorial Problems
Leonard M. Adleman · Science · 1994 · 4.5K citations
Genetic algorithms for function optimization
Anne Brindle · University of Alberta Library · 1980 · 269 citations · Full text