Yubin-Liu

Yubin-Liu's Stars

• datawhalechina/undingable-optimization

  顶不住的运筹优化

  17828

• MeikeReusken/Matheuristic-for-CVRP-SDSW

  This repository contains the code used for article "Vehicle routing with stochastic demand, service and waiting times - The case of food bank collection problems" published in European Journal of Operational Research by Meike Reusken, Gilbert Laporte, Sonja U. K. Rohmer, and Frans Cruijssen

  Language:Python5

• hibestil/deliver

  Multi Depot Vehicle Routing Problem (MDVRP) with genetic algorithm & brute force solver written in Python.

  Language:Python184

• Rintarooo/MDVRP_MHA

  Multi-Depot Vehicle Routing Problem solver using Deep RL, GA and Google OR-Tools

  Language:Python689

• mpinta/evovrp

  🧬 Solving MDVRP using evolutionary algorithms.

  Language:Python166

• PyVRP/PyVRP

  Open-source, state-of-the-art vehicle routing problem solver in an easy-to-use Python package.

  Language:Python38562

• Nikronic/Optimized-MDVRP

  "Using Genetic Algorithms for Multi-depot Vehicle Routing" paper implementation.

  Language:Python498

• Valdecy/pyVRP

  The pyVRP is python library that solves (using Genetic Algorithms): Capacitated VRP, Multiple Depot VRP, VRP with Time Windows, VRP with Homogeneous or Heterogeneous Fleet, VRP with Finite or Infinite Fleet, Open or Closed Routes, TSP, mTSP and various combination of these types.

  Language:Python3510

• FanYouCN/dynamic_stochastic_matching

  This repository includes source code for working paper titled "An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching"

  Language:Python61

• tegarwicaksono/knapsack

  Python code to solve knapsack (integer optimization) problem using (1) dynamic programming and (2) branch and bound

  Language:Python64

• mod0/knapsack

  This is the dynamic programming, branch and bound and branch and bound low memory solver to solve large instances of the knapsack problem. This was written as part of the course Discrete Optimization on Coursera by Professor. Pascal Van Hentenryck of University of Melbourne.

  Language:Python87

• nishkaks/Capacitated-Vehicle-Routing

  In this project we focus on the set covering based formulation for the capacitated vehicle routing problem (CVRP). A column generation approach based on dynamic programming has been used to find a lower bound to the optimal solution.

  Language:Python159

• phvargas/TSP-python

  Dynamic Programming Implementation of Travel Salesman Problem

  Language:Python167

• yushinliu/Adaptive-Dynamic-programming

  Language:Python3011

• cuntou0906/Adaptive-dynamic-programming

  Adaptive dynamic programming（ADP） 自适应动态规划

  Language:Python412

• rameziophobia/Travelling_Salesman_Optimization

  Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer

  Language:Python8020

• coverdrive/MDP-DP-RL

  Markov Decision Processes, Dynamic Programming and Reinforcement Learning

  Language:Python280134

• ezstoltz/genetic-algorithm

  Genetic algorithm tutorial for Python

  Language:Jupyter Notebook173169

• david-simoes-93/Mixed-Policy-Asynchronous-Deep-Q-Learning

  Deep learning implementations (Asynchronous Deep Q-Learning) of multiple Game Theory algorithms for adversarial learning (WoLF-PHC, GIGA-WoLF, WPL, EMA-QL, PGA-APP)

  Language:Python153

• ismorphism/DeepGame

  Multi-agent reinforcement learning programs based on Game theory

  Language:Python376

• tirthajyoti/Papers-Literature-ML-DL-RL-AI

  Highly cited and useful papers related to machine learning, deep learning, AI, game theory, reinforcement learning

  2.6k753