Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem

Joao Sarubbi,Gilberto De Miranda,Ricardo Saraiva De Camargo,Henrique Pacca Luna

doi:10.1109/his.2007.39

Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem

Joao Sarubbi, Gilberto De Miranda + Show 2 more

https://doi.org/10.1109/his.2007.39

Copy DOI

Publication Date: Sep 1, 2007

Citations: 16

Affiliation: Universidade Federal de Alagoas, Universidade Federal de Ouro Preto, Universidade Federal de Minas Gerais

#Traveling Repairman Problem #Minimum Latency Problem + Show 8 more

Abstract
Full-Text
Similar Papers

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 lowerbounds 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.