Procedures for travelling salesman problems with additional constraints

Share/Save/Bookmark

Lokin, F.C.J. (1979) Procedures for travelling salesman problems with additional constraints. European Journal of Operational Research, 3 (2). pp. 135-141. ISSN 0377-2217

open access
[img]
Preview
PDF
957kB
Abstract:In the real world problems occur that can be regarded as travelling salesman problems in which the solution must have some predescribed structure. For example it can be obligatory that some cities must be visited before others or some cities must be visited contiguously. Exact branch and bound procedures will de described for solving general travelling salesman problems with additional constraints.
The travelling salesman problem is expanded to include the following situations.
1. A subset (or subsets) of cities - called a cluster - must be visited contiguously. - 2. Precedence relations are imposed on some points. - 3. Situation 1 and precedence relations are imposed on some clusters.Some real world applications of these constrained travelling salesman problems are mentioned.
Item Type:Article
Copyright:© 1979 Elsevier Science
Link to this item:http://purl.utwente.nl/publications/68455
Official URL:http://dx.doi.org/10.1016/0377-2217(79)90099-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page