定向运动问题 [英] orienteering problem

问题描述

如何使用通用算法解决自动路由生成. 我可以使用哪个代码. 描述: 如今，地理服务(例如，提供地图或查找两个位置之间的路线)在万维网上得到了广泛的应用. 游客始终需要搜索两点之间的路线并抛出特定的位置.该项目的想法是建立一个在线系统，以帮助游客自动生成路线. 客观的: -确定2个地点之间的路线，并在许多属性(例如自然美景，历史重要性等)上以不同的相关分数访问不同的中间地点. -目标是确定总得分最高的路线取决于用户的期望. 在哪里可以找到带有约束(时间和距离)的分支切分算法和代码?

how to use generic algorithm to solve Automatic Route Generation. which code can I use. describtin: Geographical services, such as presenting a map or finding a route between two locations are widespread today on the World-Wide Web. Tourist always needs to search about the route between two points and throw specific locations. The project idea is to build an on-line system to help tourist in automatic generation of the routes. objective: - Determine the route between 2 locations and visit different intermediate locations with different associated score on a number of attributes such as: natural beauty, historical importance, etc. - The goal is to determine the route that has the highest total score depends on user desired. and where can I found branch-and-cut allgorithm and code with constraint (time and distance)

推荐答案

我相信这里的内容很粗糙相当复杂的编程任务的一些要求的近似值.我建议您花一些时间开发它们以完成操作，然后将其发布到Code Project的工作委员会中.以合理的价格，我相信有人会为您编写应用程序的后端.

I believe that what you have here is a rough approximation of some requirements for a fairly complicated programming task. I suggest that you spend some time developing them to completion and then post them in Code Project''s  Job Board. For the right price, I am sure that someone will be glad to write the back end of your application for you.

顺便说一句，我对您的问题的编辑只用"generic"代替了"generic".  

by the way, my edit of your question simply substituted "generic," for "genetic." 

这篇关于定向运动问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！