期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 196, 期 3, 页码 987-995出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.05.009
关键词
Traveling salesman; Pickup-and-delivery; Branch-and-cut; Dial-a-Ride
资金
- Ministerio de Educacion y Ciencia, Spain [MTM2006-14961-C05-03]
This paper concerns a generalization of the traveling salesman problem (TSP) called multi-commodity one-to-one pickup-and-delivery traveling salesman problem (m-PDTSP) in which cities correspond to customers providing or requiring known amounts of m different commodities, and the vehicle has a given upper-limit capacity. Each commodity has exactly one origin and one destination, and the vehicle must visit each customer exactly once. The problem can also be defined as the capacitated version of the classical TSP with precedence constraints. This paper presents two mixed integer linear programming models, and describes a decomposition technique for each model to find the optimal solution. Computational experiments on instances from the literature and randomly generated compare the techniques and show the effectiveness Of Our implementation. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据