Some applications of the clustered travelling salesman problem

The purpose of this article is to describe several applications of the clustered travelling salesman problem arising in areas as diverse as vehicle routing, manufacturing, computer operations, examination timetabling, cytological testing, and integrated circuit testing.

[1]  Nagraj Balakrishnan,et al.  Scheduling examinations to reduce second-order conflicts , 1992, Comput. Oper. Res..

[2]  R. Nigel Horspool,et al.  An improved block sequencing method for program restructuring , 1983, J. Syst. Softw..

[3]  Udatta S. Palekar,et al.  Heuristics for the plate-cutting traveling salesman problem , 1997 .

[4]  Gilbert Laporte,et al.  A tiling and routing heuristic for the screening of cytological samples , 1998, J. Oper. Res. Soc..

[5]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[6]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[7]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

[8]  Michel Gendreau,et al.  HEURISTICS FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM. , 1994 .

[9]  James A. Chisman,et al.  The clustered traveling salesman problem , 1975, Comput. Oper. Res..

[10]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[11]  F.C.J. Lokin.  Procedures for travelling salesman problems with additional constraints , 1979 .

[12]  Hark Hwang,et al.  Order batching algorithms for a man-on-board automated storage and retrieval system , 1988 .

[13]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..

[14]  Gilbert Laporte,et al.  Optimal Sequencing Rules for Some Large-Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics , 1995 .

[15]  Michel Gendreau,et al.  The Traveling Salesman Problem with Backhauls , 1996, Comput. Oper. Res..

[16]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[17]  G Laporte,et al.  An emergency vehicle dispatching system for an electric utility in Chile , 1999, J. Oper. Res. Soc..

[18]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[19]  Curtis L. Stowers,et al.  Lot sizing problems with strong set-up interactions , 1997 .

[20]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[21]  Ton Volgenant,et al.  The symmetric clustered traveling salesman problem , 1985 .

[22]  Gilbert Laporte,et al.  Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem , 1999 .

[23]  François Vanderbeck,et al.  A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..

[24]  Chiun-Ming Liu,et al.  Clustering techniques for stock location and order-picking in a distribution center , 1999, Comput. Oper. Res..