作者: Vladimir Deineko
DOI:
关键词: Variety (cybernetics) 、 Block (data storage) 、 Mathematical optimization 、 Destination-Sequenced Distance Vector routing 、 Test data 、 Travelling salesman problem 、 Routing (electronic design automation) 、 Vehicle routing problem 、 Computer science 、 Dynamic programming
摘要: In this paper we consider a 2-vehicle routing problem which can be viewed as building block for the varieties of vehicle problems (VRPs). To approach problem, suggest framework based on Held and Karp dynamic programming algorithm classical travelling salesman problem. An shows an exceptionally good performance published test data. Our easily extended to variety constraints/attributes in VRP, hence wording "small but rich" title our paper.