Title :
Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem
Author :
Sarubbi, João ; Luna, Henrique Pacca ; de Miranda, G. ; De Camargo, Ricardo S.
Author_Institution :
Fed. Univ. of Minas Gerais, Patos de Minas
Abstract :
The minimum latency problem, also known as traveling repairman problem, the Deliveryman problem and the traveling salesman problem with cumulative costs is a variant of the Traveling Salesman Problem in which a repairman is required to visit customers located on each node of a graph in such a way that the overall waiting times of these customers is minimized. In the present work, an algorithm based on tight different linear programming lower- bounds and a specialized GRASP procedure are presented. The linear programming based lower-bounds are based on the Quadratic Assignment Problem with the aid of side constraints. Instances from 10 up to 60 nodes are solved very close to optimality in reasonable time.
Keywords :
linear programming; travelling salesman problems; GRASP procedure; deliveryman problem; linear programming; minimum latency problem; quadratic assignment problem; sharp lower bounds; traveling repairman problem; traveling salesman problem; upper bounds; Cost function; Delay; Dynamic programming; Hybrid intelligent systems; Lagrangian functions; Linear programming; Single machine scheduling; Time sharing computer systems; Traveling salesman problems; Upper bound;
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.39
