VRPTW variation of JD Global Optimization Challange

Algorithm summary:

1. Generate an initial solution based on Time-oriented Nearest-Neighborhood Heuristic proposed by Solomon(1987).
2. Improve the initial solution using Large Neighbourhood Search algorithm and Simulated Annealing algorithm. We used 7 operators to search neighborhood solution. The following two papers are listed for reference:
   --A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
   --An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows
3. Other implementation skills.

Code is just for reference.