Routing heuristics for automated pick and place machines

DOI10.1016/S0377-2217(98)00231-8zbMath0937.90020MaRDI QIDQ1806942

Reza H. Ahmadi, John W. Mamer

Publication date: 14 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsinteger programmingerror boundsprobabilistic analysistraveling salesman problemworst case analysis

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Production models (90B30)

Related Items (4)

The traveling salesman problem with flexible coloring ⋮ System identification of a pick-and-place mechanism driven by a permanent magnet synchronous motor ⋮ The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey ⋮ A triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine

Cites Work

• Unnamed Item
• Unnamed Item
• Vehicle routing with full loads
• A parallel tabu search algorithm for large traveling salesman problems
• The convex-hull-and-line traveling salesman problem: A solvable case
• Tabu search performance on the symmetric travelling salesman problem
• Neural methods for the traveling salesman problem: Insights from operations research
• Spacefilling curves and the planar travelling salesman problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Optimal tool partitioning rules for numerically controlled punch press operations
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space

This page was built for publication: Routing heuristics for automated pick and place machines