Content deleted Content added
No edit summary |
added variant of vrp |
||
Line 40:
* Inventory Routing Problem (IRP): Vehicles are responsible for satisfying the demands in each delivery point <ref>{{cite journal |last1=Ekici |first1=Ali |last2=Özener |first2=Okan Örsan |last3=Kuyzu |first3=Gültekin |title=Cyclic Delivery Schedules for an Inventory Routing Problem |journal=Transportation Science |date=November 2015 |volume=49 |issue=4 |pages=817–829 |doi=10.1287/trsc.2014.0538}}</ref>
* Multi-Depot Vehicle Routing Problem (MDVRP): Multiple depots exist from which vehicles can start and end.<ref>{{cite conference |last1=Mahmud |first1=Nafix |last2=Haque |first2=Md. Mokammel |title=Solving Multiple Depot Vehicle Routing Problem (MDVRP) using Genetic Algorithm |conference=2019 International Conference on Electrical, Computer and Communication Engineering (ECCE) |date=February 2019 |doi=10.1109/ECACE.2019.8679429}}</ref>
* Vehicle Routing Problem with Transfers (VRPWT): Goods can be transfered between vehicles at specially designated transfer hubs.
Several software vendors have built software products to solve various VRP problems. Numerous articles are available for more detail on their research and results.
| |||