Model and algorithms for the Multicommodity Traveling Salesman Problem

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Joao Sarubbi Articles by Geraldo Robson Mateus Articles by Henrique Pacca Luna Articles by Gilberto Jr. de Miranda

7th International Conference on Hybrid Intelligent Systems (HIS 2007)

Kaiserslautern, Germany

September 17-September 19

ISBN: 0-7695-2946-1

	ASCII Text	x
	Joao Sarubbi, Geraldo Robson Mateus, Henrique Pacca Luna, Gilberto Jr. de Miranda, "Model and algorithms for the Multicommodity Traveling Salesman Problem," Hybrid Intelligent Systems, International Conference on, pp. 113-119, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007.

	BibTex	x
	@article{ 10.1109/HIS.2007.40, author = {Joao Sarubbi and Geraldo Robson Mateus and Henrique Pacca Luna and Gilberto Jr. de Miranda}, title = {Model and algorithms for the Multicommodity Traveling Salesman Problem}, journal ={Hybrid Intelligent Systems, International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2946-1}, pages = {113-119}, doi = {http://doi.ieeecomputersociety.org/10.1109/HIS.2007.40}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hybrid Intelligent Systems, International Conference on TI - Model and algorithms for the Multicommodity Traveling Salesman Problem SN - 0-7695-2946-1 SP113 EP119 A1 - Joao Sarubbi, A1 - Geraldo Robson Mateus, A1 - Henrique Pacca Luna, A1 - Gilberto Jr. de Miranda, PY - 2007 KW - null VL - 0 JA - Hybrid Intelligent Systems, International Conference on ER -

Joao Sarubbi, Federal University of Minas Gerais

Geraldo Robson Mateus, Federal University of Minas Gerais

Henrique Pacca Luna, Federal University of Alagoas

Gilberto Jr. de Miranda, Federal University of Minas Gerais

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HIS.2007.40

We are introducing in this article the Multicommodity Traveling Salesman Problem (MTSP), where the objective is to deliver all the demands of different commodities by a tour that minimizes the sum of the fixed and variable costs for the selected arcs. The MTSP yields then a large scale mixed integer linear programming problem. In this article we devise a Lagrangean based heuristic approach to tackle this more general TSP variant.

Citation:

Joao Sarubbi, Geraldo Robson Mateus, Henrique Pacca Luna, Gilberto Jr. de Miranda, "Model and algorithms for the Multicommodity Traveling Salesman Problem," his, pp.113-119, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.