tinajiwona Goto Github PK

adm-vrp

Dynamic Attention Model for Vehicle Routing Problem (arXiv:2002.03282)

admm_grouplasso

My practice of using ADMM to solve group lasso

admm_python

Solomon benchmark instances

algorithms_for_solving_vrp

Implementation of VRP solution algorithm in Python

assignment-jiangting

assignment

assignment2-jiang-ting

assignment2

assignment_1_-jiang

A repository is about the fist assignment

assignment_1__jiangting

A repository about assignment

assignment_1_jiang-ting

A repository is about my assignment

assinment_2_jiang-ting

creat a new Rmarket file

av-drone-delivery

A simulation project that merges Autonomous Vehicle (AV) car-sharing with drone deliveries to optimize out-of-range deliveries.

bc_cvrp

A branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP)

branch-and-cut

branch-and-cut-clique

cbcdata

cfrlm_code

cgvrptw_pulse

column generation + ESPPRC + pulse algorithm

conjoint-analysis

This project aims to conduct a random survey design for collecting responses regarding wine preferences of Italian consumers. Furthermore, it attempts to understand how preference share gets affected as we vary different attributes associated with wine with the use of a research method called Conjoint Analysis..

cvrpsep-for-rcc

Code for finding the lower bound of CVRP instances using Gurobi and the CVRPSEP package

cvxbook_additional_exercises

Additional exercises and data for EE364a. No solutions; for public consumption.

graph

hmsme-vrp-instances

Instances of the Hierarchal Multi-Switch Multi-Echelon VRP

insatances-for-2e-evrp

kmo-and-bartlett-

lagrangian-relaxation-algorithm-for-rrslrp

To solve the RRS-LRP problem based on resource-space-time network, we developed a Lagrangian Relaxation Algorithm framework to decompose the origin problem into classic knapsack sub-problem and vehicle routing problem with recharging station (VRP-RS). The knapsack problem is solved by dynamic programming algorithm and a dynamic programming algorith

lazy-theta-with-optimization-any-angle-pathfinding

Efficient implementations of the Lazy Theta Star algorithm in C++, and a Python wrapper.

learn-statistical-learning-method

Implementation of Statistical Learning Method, Second Edition.《统计学习方法》第二版，算法实现。

mdp-with-value-iteration-and-policy-iteration

An introduction to Markov decision process (MDP) and two algorithms that solve MDPs (value iteration & policy iteration) along with their Python implementations.

mfstsp-vds

Test problems and heuristic pseudo-code for solving the Multiple Flying Sidekicks Traveling Salesman Problem with Variable Drone Speeds (mFSTSP-VDS)

modelling-and-analysis-of-a-vehicle-routing-problem-with-time-windows-in-freight-delivery

A MSc's Dissertation Project which focuses on Vehicle Routing Problem with Time Windows (VRPTW), using both exact method and heuristic approach (General Variable Neighbourhood Search)