Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
نویسندگان
چکیده
منابع مشابه
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
متن کاملThe Dynamic Traveling Repairman Problem
We propose and analyze a generic mathematical model for dynamic vehicle routing problems, which we call the dynamic traveling repairman problem (DTRP). The model is motivated by applications in which the objective is minimizing the wait for service in a stochastic and dynamically changing environment. This is a departure from traditional vehicle routing problems which seek to minimize total tra...
متن کاملNew Formulations for the Traveling Repairman Problem
Given a complete directed graph G = (V,E), the traveling repairman problem consists of determining a Hamiltonian circuit minimizing the sum of the waiting times of customers located at the nodes of the graph. In this paper, we propose two new linear integer formulations for TRP and computationally evaluate the strength of their linear programming relaxations. Computational results show the effi...
متن کاملThe Machine Learning and Traveling Repairman Problem
The goal of the Machine Learning and Traveling Repairman Problem (ML&TRP) is to determine a route for a “repair crew,” which repairs nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, but the failure probabilities are not known and must be estimated. If there is uncertainty in the failure probability estimates, we take this uncertainty into account in an unusu...
متن کاملA Review on Traveling Repairman Problem
Suppose G=(V,A) be an undirected graph with n nodes and a source vertex s Є V. Each node has a problem that must be solved by the repairman that has send. We are given the time required by the repairman to travel among nodes. The objective is to find a tour that minimizes the total waiting time of all the problems that are waiting to be solved. Traveling Repairman problem (TRP) is also known as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2011
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-011-0153-0