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

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

全面介紹

Saved in:
書目詳細資料
Main Authors: XU, Zhou, RODRIGUES, Brian Charles
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2017
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/4999
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English