Integer linear programming formulations of multiple salesman problems and its variations
Kara, I. and Bektas, T. (2006) Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174, (3), 1449-1458. (doi:10.1016/j.ejor.2005.03.008).
Full text not available from this repository.
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
|Keywords:||integer programming, multidepot multisalesmen problem, subtour elimination constraints|
|Subjects:||H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management|
|Divisions:||University Structure - Pre August 2011 > School of Management
|Date Deposited:||08 Aug 2007|
|Last Modified:||01 Jun 2011 11:57|
|Contributors:||Kara, I. (Author)
Bektas, T. (Author)
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)