aritrasep / nlns_vnd.jl

NLNS+VND Metaheuristic Algorithm for solving Combinatorial Optimization Problems

NLNS+VND Metaheuristic Algorithm:

The following classes of problems can be solved:

1. Static Complete Rebalancing Problem in ( Station-based and Free-Floating ) Bike Sharing Systems.
2. (Symmetric) Traveling Salesman Problem (STSP)
3. Multiple Traveling Salesman Problem (mTSP)
4. 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP)
5. Traveling Salesman Problem with Time Windows (TSPTW)
6. Capacitated Vehicle Routing Problem (CVRP)
7. Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)

Please Cite the Following Paper:

@article{Pal201792,
title = "Free-floating bike sharing: Solving real-life large-scale static rebalancing problems ",
journal = "Transportation Research Part C: Emerging Technologies ",
volume = "80",
number = "",
pages = "92 - 116",
year = "2017",
note = "",
issn = "0968-090X",
doi = "https://doi.org/10.1016/j.trc.2017.03.016",
url = "http://www.sciencedirect.com/science/article/pii/S0968090X17300992",
author = "Aritra Pal and Yu Zhang"
}

nlns_vnd.jl's Issues

time windows constraints

Thanks for your contribution, and I am very interested in this study.

In the README file, it says this algorithm can be used to solve problems with time windows. I would like to know whether the time windows have been tackled in the local search procedures. Since I am not familiar with Julia, I really need your response. Many thanks. Look forward to your reply.