Approximation results for a min-max location-routing problem

Authors:
Zhou Xu;Dongsheng Xu;Wenbin Zhu
Affiliations:
Department of Logistics and Maritime Studies, Faculty of Business, Hong Kong Polytechnic University, Hong Kong;Department of Management Science, Business School, Sun Yat-sen University, Guangzhou 510275, China;Department of Logistics and Maritime Studies, Faculty of Business, Hong Kong Polytechnic University, Hong Kong
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 11
Cited 0

A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

Discrete Applied Mathematics
(p-1)/(p+1)-approximate algorithms for p-traveling salemen problems on a tree with minmax objective

Discrete Applied Mathematics
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Discrete Applied Mathematics
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

Discrete Applied Mathematics
Approximating the Minmax Rooted-Subtree Cover Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Location-Routing Problems with Distance Constraints

Transportation Science
Routing for Relief Efforts

Transportation Science
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
Approximation hardness of min-max tree covers

Operations Research Letters
Min-max tree covers of graphs

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper studies a min-max location-routing problem, which aims to determine both the home depots and the tours for a set of vehicles to service all the customers in a given weighted graph, so that the maximum working time of the vehicles is minimized. The min-max objective is motivated by the needs of balancing or fairness in vehicle routing applications. We have proved that unless NP=P, it is impossible for the problem to have an approximation algorithm that achieves an approximation ratio of less than 4/3. Thus, we have developed the first constant ratio approximation algorithm for the problem. Moreover, we have developed new approximation algorithms for several variants, which improve the existing best approximation ratios in the previous literature.