loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
7th International Conference on Hybrid Intelligent Systems (HIS 2007)
Model and algorithms for the Multicommodity Traveling Salesman Problem
Kaiserslautern, Germany
September 17-September 19
ISBN: 0-7695-2946-1
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
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
Usage of this product signifies your acceptance of the Terms of Use.