Integer linear programming formulations of multiple salesman problems and its variations

  • Kara I
  • Bektas T
  • 71


    Mendeley users who have this article in their library.
  • 76


    Citations of this article.


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. © 2005 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Integer programming
  • Multidepot multisalesmen problem
  • Subtour elimination constraints

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free