A TSP (1, 2) application arising in cable assembly shops

@article{Duman2005AT,
  title={A TSP (1, 2) application arising in cable assembly shops},
  author={Ekrem Duman and M. Hamdi {\"O}zçelik and Ahmet N. Ceranoglu},
  journal={JORS},
  year={2005},
  volume={56},
  pages={642-648}
}
One of the main operations in producing cable systems in the automotive industry is that of cutting/stripping/crimping. The most time-consuming activity in this operation is changing the heads whenever a different connector is to be crimped at either one of the ends. This set-up time is practically doubled when the heads at both ends are to be changed. Thus, one is faced with the problem of minimizing the total machine set-up time; which turns out to be a TSP where the distances between the… CONTINUE READING
2 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Geometric approaches to solve Chebyshev traveling salesman problem

  • YA Bozer, EC Shorn, GP Sharp
  • IIE Trans
  • 1990

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

  • EL Lawler
  • 1987

Similar Papers

Loading similar papers…