Abstract
Several applications of the clustered travelling salesman problem (CTSP) were described. The problem can be applied in vehicle routing, manufacturing, computer operations, examination timetabling, integrated circuit testing and cytological testing. It is also applicable to the problem of restructuring of computer programs for the minimization of paging faults and reduction of execution times. It was described as a versatile modeling tool for several operational research applications.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 972-976 |
| Number of pages | 5 |
| Journal | Journal of the Operational Research Society |
| Volume | 53 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2002 |
Keywords
- Applications
- Clustered travelling salesman problem
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing