Pinned Repositories
1d_cutting
csp
Algorithm for Cutting Stock Problem using Google OR-Tools. Link to the tool:
cutting_stock
列生成求解下料问题（Column generation solving cutting stock problem）
drl_binpacking
3D bin packing is a classical and challenging combinatorial optimization problem in logistics and production systems. An effective bin packing algorithm means the reduction of total packing cost and increase in utilization of resources. Because the cost of packing materials, which is mainly determined by their surface area, occupies the most part of packing cost, and in many real business scenarios there is no bin with fixed size, so AI Department of Cainiao proposed a new type of 3D bin packing problem. The objective of this new type of 3D bin packing problem is to pack all items into a bin with minimized surface area. And a DRL method based on the sequence-to-sequence model is proposed to solve the problem. This is the research paper link: https://arxiv.org/abs/1708.05930. Source code of this method can be found in the project.
DWAVE4TSPLIB
This repository contains a modification of the Quantum TSP for using TSPLIB instances in DWAVE platform
GomoryCut
I implement two phase simplex method, dual simplex method, gomory-cut constraint to solve Integer Linear Programming
job-shop-scheduling
Determine a schedule for running a set of jobs
learn2cut
a reinforcement learning policy gradient implementation of integer progamming solver
pulp
A python Linear Programming API
pytorch-drl4vrp
Implementation of: Nazari, Mohammadreza, et al. "Deep Reinforcement Learning for Solving the Vehicle Routing Problem." arXiv preprint arXiv:1802.04240 (2018).
tangarfff's Repositories
tangarfff/1d_cutting
tangarfff/pulp
A python Linear Programming API
tangarfff/csp
Algorithm for Cutting Stock Problem using Google OR-Tools. Link to the tool:
tangarfff/learn2cut
a reinforcement learning policy gradient implementation of integer progamming solver
tangarfff/job-shop-scheduling
Determine a schedule for running a set of jobs
tangarfff/qio-samples
Samples for using optimization solvers through Azure Quantum.
tangarfff/RLintern
tangarfff/TAP-Net
TAP-Net: Transport-and-Pack using Reinforcement Learning
tangarfff/SimRLFab
Simulation and reinforcement learning framework for production planning and control of complex job shop manufacturing systems
tangarfff/GomoryCut
I implement two phase simplex method, dual simplex method, gomory-cut constraint to solve Integer Linear Programming
tangarfff/DWAVE4TSPLIB
This repository contains a modification of the Quantum TSP for using TSPLIB instances in DWAVE platform
tangarfff/pytorch-drl4vrp
Implementation of: Nazari, Mohammadreza, et al. "Deep Reinforcement Learning for Solving the Vehicle Routing Problem." arXiv preprint arXiv:1802.04240 (2018).
tangarfff/cutting_stock
列生成求解下料问题（Column generation solving cutting stock problem）
tangarfff/tsp-solver
Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.
tangarfff/simplex
线性规划-单纯形算法
tangarfff/drl_binpacking
3D bin packing is a classical and challenging combinatorial optimization problem in logistics and production systems. An effective bin packing algorithm means the reduction of total packing cost and increase in utilization of resources. Because the cost of packing materials, which is mainly determined by their surface area, occupies the most part of packing cost, and in many real business scenarios there is no bin with fixed size, so AI Department of Cainiao proposed a new type of 3D bin packing problem. The objective of this new type of 3D bin packing problem is to pack all items into a bin with minimized surface area. And a DRL method based on the sequence-to-sequence model is proposed to solve the problem. This is the research paper link: https://arxiv.org/abs/1708.05930. Source code of this method can be found in the project.
tangarfff/Vehicle-Routing-Problem-GPU-CUDA
This repo contains a source code in Python as well CUDA for VRP