Giter VIP home page Giter VIP logo

tangarfff's Projects

csp icon csp

Algorithm for Cutting Stock Problem using Google OR-Tools. Link to the tool:

cutting_stock icon cutting_stock

列生成求解下料问题(Column generation solving cutting stock problem)

drl_binpacking icon 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 icon dwave4tsplib

This repository contains a modification of the Quantum TSP for using TSPLIB instances in DWAVE platform

gomorycut icon gomorycut

I implement two phase simplex method, dual simplex method, gomory-cut constraint to solve Integer Linear Programming

learn2cut icon learn2cut

a reinforcement learning policy gradient implementation of integer progamming solver

pulp icon pulp

A python Linear Programming API

pytorch-drl4vrp icon pytorch-drl4vrp

Implementation of: Nazari, Mohammadreza, et al. "Deep Reinforcement Learning for Solving the Vehicle Routing Problem." arXiv preprint arXiv:1802.04240 (2018).

qio-samples icon qio-samples

Samples for using optimization solvers through Azure Quantum.

simrlfab icon simrlfab

Simulation and reinforcement learning framework for production planning and control of complex job shop manufacturing systems

tap-net icon tap-net

TAP-Net: Transport-and-Pack using Reinforcement Learning

tsp-solver icon tsp-solver

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.