Content deleted Content added
HMSLavender (talk | contribs) m Reverted edits by 196.189.147.39 (talk) (AV) |
m spelling, format per MOS:SECTIONCAPS |
||
Line 41:
* 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
Several software vendors have built software products to solve various VRP problems. Numerous articles are available for more detail on their research and results.
Line 102:
|journal=European Journal of Operational Research|volume=234|issue=3|pages=658–673|doi=10.1016/j.ejor.2013.09.045|s2cid=21037953 }}</ref> These methods are also more robust in the sense that they can be more easily adapted to deal with a variety of side constraints. As such, the application of metaheuristic techniques is often preferred for large-scale applications with complicating constraints and decision sets.
== Classification of
Most solutions to the vehicle routing problems can be classified as one of the following approaches:<ref>{{Cite journal |last1=Bodin |first1=Lawrence |last2=Golden |first2=Bruce |date=1981 |title=Classification in vehicle routing and scheduling |url=https://onlinelibrary.wiley.com/doi/10.1002/net.3230110204 |journal=Networks |language=en |volume=11 |issue=2 |pages=97–108 |doi=10.1002/net.3230110204}}</ref>
| |||