旅行商问题
皮卡
旅行购买者问题
一般化
车辆路径问题
数学优化
分支和切割
2-选项
产品(数学)
瓶颈旅行商问题
数学
整数(计算机科学)
整数规划
计算机科学
算法
布线(电子设计自动化)
人工智能
几何学
程序设计语言
数学分析
图像(数学)
计算机网络
作者
Hipólito Hernández‐Pérez,Juan‐José Salazar‐González
标识
DOI:10.1016/j.dam.2003.09.013
摘要
We study a generalization of the well-known traveling salesman problem (TSP) where each customer provides or requires a given non-zero amount of product, and the vehicle in a depot has a given capacity. Each customer and the depot must be visited exactly once by the vehicle supplying the demand while minimizing the total travel distance. We assume that the product collected from pickup customers can be delivered to delivery customers. We introduce a 0-1 integer linear model for this problem and describe a branch-and-cut procedure for finding an optimal solution. The model and the algorithm are adapted to solve instances of TSP with pickup and delivery. Some computational results are presented to analyze the performance of our proposal.
科研通智能强力驱动
Strongly Powered by AbleSci AI