Integer linear programming formulations of multiple salesman problems and its variations [An article from: European Journal of Operational Research] | ![Integer linear programming formulations of multiple salesman problems and its variations [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: I. Kara, T. Bektas
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Pages: 9
Publication Date: November 1, 2006
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In this paper, we extend the classical multiple traveling salesman problem (mTSP) by imposing a minimal number of nodes that a traveler must visit as a side condition. We consider single and multidepot cases and propose integer linear programming formulations for both, with new bounding and subtour elimination constraints. We show that several variations of the multiple salesman problem can be modeled in a similar manner. Computational analysis shows that the solution of the multidepot mTSP with the proposed formulation is significantly superior to previous approaches.
|
|
|
