New heuristic for single row routing problems

Naveed A. Sherwani, Jitender S. Deogun

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

A novel heuristic algorithm for the classical single-row routing problem is presented. The algorithm is based on a graph-theoretic decomposition scheme and uses modified cut-numbers. The algorithm was implemented in C on VAX 8200. The experimental results show that the quality of solutions generated by the proposed algorithm could be up to 36% better than that generated by existing algorithms.

Original languageEnglish (US)
Pages (from-to)167-172
Number of pages6
JournalProceedings - Design Automation Conference
StatePublished - 1989
Event26th ACM/IEEE Design Automation Conference - Las Vegas, NV, USA
Duration: Jun 25 1989Jun 29 1989

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'New heuristic for single row routing problems'. Together they form a unique fingerprint.

Cite this