Hacktoberfest 2026:维护者为十月标记出来的 issue,仍然开放、适合新手。 浏览 Hacktoberfest issue

Travelling Purchaser Problem

未关闭
#382 2 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看

维护者通常 2 天内回复

还没有人认领这个 Issue。

评估

难度
5/5
预计耗时
一周以上
新手友好度
25/100
Issue 类型
功能
描述清晰度
需要澄清
活跃度
停滞
技术栈
cpp, postgresql
领域
backend, databases

调研方向

The issue asks about implementing the Travelling Purchaser Problem (TPP) as a generalization of the Travelling Salesman Problem (TSP) in pgRouting. Start by examining existing TSP implementations in the codebase, likely in the src/ directory. Research the algorithm and academic literature on TPP. Determine if this is a feasible extension or requires a new module. 'Done' would be a design proposal or proof-of-concept implementation.

由索引模型根据 Issue 内容生成。

描述

Functionality Request

May be there is already a solution inside pgRouting regarding how to solve Travelling Purchaser Problem (TPP). Kindly redirect me there or any old thread where similar issues have been discussed.

Travelling Salesman Problem (TSP) is an special case of TPP (https://en.wikipedia.org/wiki/Traveling_purchaser_problem) where we know all the starting, ending and intermediate nodes. But what if we are not sure which intermediate nodes because of many intermediate node options? I even tried to ask on gis.stackexchange (http://gis.stackexchange.com/questions/123528/solving-traveling-purchaser-problem) but couldn't get much info.

Before saying much I will wait for some comments. Is there any Feature Development already going on in pgRouting?

主要语言
C++
星标
1.4k
派生
397
平均合并
2 天 2 小时
30 天内合并 PR
4

环境准备

从这里开始

  1. 先读完整个 Issue,再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库,在一个分支上完成修改。
  4. 提交 Pull Request,并在描述里引用这个 Issue 编号。

pgRouting/pgrouting 的其他 Issue

查看 pgRouting/pgrouting 的全部 Issue

相似的 Issue

更多 C++ Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。