旅行商问题约束重新presentation [英] Travelling Salesman Problem Constraint Representation

问题描述

我读了关于如何解决TSP遗传算法和蚁群算法等几篇文章和样本code，但一切，我发现并没有包括时间（窗）的限制，例如。 我必须要在客户X上午12点前），并假设对称。

I read a couple of articles and sample code about how to solve TSP with Genetic Algorithms and Ant Colony Optimization etc. But everything I found didn't include time (window) constraints, eg. "I have to be at customer x before 12am)" and assumed symmetry.

有人可以点我到一些示例code或文章解释如何我可以添加约束，TSP，我怎么可以重新present那些在code的方向。

Can somebody point me into the direction of some sample code or articles that explain how I can add constraints to TSP and how I can represent those in code.

谢谢！

推荐答案

Reinelt教授在海德堡的德国大学是为TSP的主要专家之一。他对TSP的各种变体文集。

Professor Reinelt at university of heidelburg in germany is one of the leading experts for the TSP. He has a collection of papers on the various variants of the TSP.

看<一href="http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/">http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

我觉得你变体被称为有时间窗车辆路径问题。 （<一href="http://en.wikipedia.org/wiki/Vehicle_routing_problem">http://en.wikipedia.org/wiki/Vehicle_routing_problem ）

I think your variant is called Vehicle Routing Problem with Time Windows. ( http://en.wikipedia.org/wiki/Vehicle_routing_problem )

这篇关于旅行商问题约束重新presentation的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！