智慧物流>> Coursera_Discrete_Optimization>> 返回
项目作者： LucasBoTang

项目描述 ：
Exact and meta-heuristic algorithms for NP problems
高级语言： Python
项目地址: git://github.com/LucasBoTang/Coursera_Discrete_Optimization.git
创建时间： 2018-05-17T23:56:03Z
项目社区：https://github.com/LucasBoTang/Coursera_Discrete_Optimization
开源协议：MIT License
下载


Discrete Optimization Solver

01 Knapsack Problem

Method:

  • Dynamic Programming
  • Branch and Bound
  • Greedy Heuristic

02 Graph Coloring Problem

Method:

  • Depth First Search
  • Constraint Programming

03 Traveling Salesman Problem

Method:

  • Simulated Annealing
  • K Opt
  • Visualization

04 Facility Location Problem

Method:

  • Branch and Bound
  • Tabu Search
  • Visualization

05 Vehicle Routing Problem

Method:

  • Genetic Algorithm
  • 2 Opt
  • Variable Neighborhood Search
  • Visualization

handout_1649749546068.pdf
handout_1649749546123.pdf
handout_1649749546232.pdf
handout_1649749546321.pdf
handout_1649749546410.pdf
handout_1649749546483.pdf