کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
382608 | 660772 | 2013 | 10 صفحه PDF | دانلود رایگان |
• We focus on heterogeneous TRPTW, a generalization of the TRP.
• The problem is mathematically formulated as MILP.
• We propose heuristic algorithm based on the VNS metaheuristic framework.
• We propose reduction strategies for VNS to reduce algorithm’s running time.
• Efficiency of proposed algorithm is tested on four sets of benchmark instances.
The focus of this paper is generalized traveling repairman problem (TRP), a special case of the well known and well studied traveling salesman problem (TSP). Because of its specific objective function, that minimizes the sum of overall time all clients wait for until the end of a service, TRP has great applicability potential in client oriented practical problems. Therefore it has been known in literature as traveling deliveryman problem, minimum latency problem and cumulative capacitated vehicle routing problem. However, most studies that have treated TRP related problems have implied that only one repairman is present in the system and/or that all clients are available for service at the beginning of the planning horizon. In this paper we consider a TRP with a heterogeneous fleet of repairmen serving a set of clients whose arrival times are distributed over a planning horizon, i.e. heterogeneous TRPTW (hetTRPTW). For the hetTRPTW we present a mixed integer linear programming model, and a heuristic algorithm based on a variable neighborhood search (VNS) framework. Additionally, we propose a reduction strategy for neighborhoods in the VNS algorithm and test efficiency of implemented algorithms on four benchmark sets of problem instances. Results show that proposed algorithms could be used in real systems for solving small and moderate problem instances.
Journal: Expert Systems with Applications - Volume 40, Issue 15, 1 November 2013, Pages 5997–6006