index.php/en/
https://w1.cirrelt.ca/~vidalt/en/VRP-resources.html
기존에 최적화 문제를 풀기 위해서 ortools 를 많이 써왔었는데 GUROBI 라는 최적화 솔버를 발견했다. 현존하는 솔버중에 가장 성능이 좋다고 평가되며 당연히 open source인 ortools 보다 성능이 뛰어나다. 튜토리얼도 상세하고 예제 코드도 많아 google ortools 를 이용할 정도의 실력이라면 무리 없이 사용할 수 있다. 학생이라면 아카데믹 라이센스를 신청해서 무료로 사용할 수 있다.
https://www.gurobi.com/resource/modeling-examples-using-the-gurobi-python-api-in-jupyter-notebook/
Gurobi Jupyter Notebook Modeling Examples
These Jupyter Notebooks Modeling Examples illustrate optimization with python and important features of the Gurobi Python API modeling objects.
www.gurobi.com
이 밖에도 다양한 솔버가 있다
https://www.math.uwaterloo.ca/tsp/concorde.html
Concorde Home
Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. The code is written in the ANSI C programming language and it is available for academic research use; for other uses, contact Wil
www.math.uwaterloo.ca
Home - VRP-REP: the vehicle routing problem repository
Welcome to VRP-REP: the vehicle routing problem repository VRP-REP is a collaborative open-data platform for sharing vehicle routing problem benchmark instances and solutions. With VRP-REP you can: Upload VRP instances in a pre-defined format (the VRP-REP
www.vrp-rep.org
http://vrp.atd-lab.inf.puc-rio.br/index.php/en/
CVRPLIB - All Instances
vrp.atd-lab.inf.puc-rio.br
https://w1.cirrelt.ca/~vidalt/en/VRP-resources.html
Vehicle routing instances and other resources
This page contains supplementary research material (test instances, detailed solutions, open source code) related to vehicle routing problems. Most of this material is connected to the papers hereby listed. Split Library A simple implementation, in C++, of
w1.cirrelt.ca
'석박사 > 최적화는 사기가 아니얏!' 카테고리의 다른 글
| Column Generation 과 Dantzig-Wolfe Decomposition (0) | 2022.07.19 |
|---|---|
| [Gurobi] big-M constraint 가 일으킬 수 있는 문제 (0) | 2021.11.23 |
| ILP 문제를 푸는 exact method (cutting plane, branch-and-bound, branch-and-cut) (0) | 2021.11.05 |
| TSP 연구에 사용할만한 솔버와 예제 문제 (0) | 2021.10.13 |
| Benders decomposition (2) | 2021.05.28 |
