Title :
Model and algorithms for the Multicommodity Traveling Salesman Problem
Author :
Sarubbi, João ; Mateus, Geraldo Robson ; Luna, Henrique Pacca ; De Miranda, Gilberto, Jr.
Author_Institution :
Fed. Univ. of Minas Gerais, Patos de Minas
Abstract :
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.
Keywords :
integer programming; linear programming; travelling salesman problems; Lagrangean based heuristic approach; mixed integer linear programming; multicommodity traveling salesman problem; Cities and towns; Cost function; Educational institutions; Hybrid intelligent systems; Lagrangian functions; Large-scale systems; Mixed integer linear programming; Roads; Traveling salesman problems; Vehicles;
Conference_Titel :
Hybrid Intelligent Systems, 2007. HIS 2007. 7th International Conference on
Conference_Location :
Kaiserlautern
Print_ISBN :
978-0-7695-2946-2
DOI :
10.1109/HIS.2007.40
