The multiple traveling purchaser problem
The multiple traveling purchaser problem
复制标题
多次旅行购买者问题
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Sang
中科院分区：
文献类型：
--
作者：
M. Choi;Sang
旅行购买者问题（TPP）是著名的旅行推销员问题（TSP）的推广，并有许多现实世界的应用，如购买所需的原材料制造工厂，调度一组工作的某些机器，和许多其他。TPP也可以扩展到车辆路径问题（VRP），通过引入额外的约束，如多个购买者，容量，距离和时间的限制。在过去的十年中，TPP已经得到了一些业务研究人员的关注。然而，它没有收到与TSP和VRP相同的利息。因此，没有针对多个TPP的研究。本文的目的是介绍的ILP制定的能力和无能力限制的多TPP。
The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP) and has many real-world applications, such as purchasing required raw materials for manufacturing factories, scheduling a set of jobs for certain machines, and many others. TPP also could be extended to the vehicle routing problem (VRP) by incorporating additional constraints, such as multi-purchaser, capacity, distance, and time restrictions. In the last decade, TPP has received the attention of some operational researchers. However, it has not received the same amount of interest as TSP and VRP. Therefore, there are no studies for the multiple TPP. The purpose of this paper is to introduce the ILP formulation for capacitated and uncapacitated multiple TPP.