| Article ID: | iaor20021374 |
| Country: | United Kingdom |
| Volume: | 52 |
| Issue: | 8 |
| Start Page Number: | 945 |
| End Page Number: | 951 |
| Publication Date: | Aug 2001 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Ghiani G., Improta G. |
| Keywords: | engineering, programming: travelling salesman, vehicle routing & scheduling |
Laser-plotters are used in the manufacturing industry to draw trademarks and decorations on the metallic surfaces of some products and devices. Given a pattern, the laser-plotter beam routing problem amounts to routing a laser-plotter beam in such a way that the total drawing time is minimised and some additional requirements are met. The aim of this paper is to model and solve the laser-plotter beam routing problem as a constrained Arc Routing Problem. Computational results on test problems with up to 225 vertices are reported.