An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem

• المؤلفون الرئيسيون: XU, Zhou, RODRIGUES, Brian Charles
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2017
• الموضوعات: Approximation algorithm; Multiple depots; Traveling salesman problem; Operations and Supply Chain Management; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/4999
• المؤسسة: Singapore Management University

We study a generalization of the classical traveling salesman problem, where multiple salesmen are positioned at different depots, of which only a limited number (k) can be selected to service customers. For this problem, only two 2-approximation algorithms are available in the literature. Here, we...