Skip to content

NLNS+VND Metaheuristic Algorithm for solving Combinatorial Optimization Problems

License

Notifications You must be signed in to change notification settings

aritrasep/NLNS_VND.jl

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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"
}

About

NLNS+VND Metaheuristic Algorithm for solving Combinatorial Optimization Problems

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages