Vehicle routing problem: Difference between revisions

Revision as of 12:22, 3 July 2025

Revision as of 10:33, 4 July 2025

Line 29:

Several variations and specializations of the vehicle routing problem exist:

*Vehicle Routing Problem with Profits (VRPP): A maximization problem where it is not mandatory to visit all customers. The aim is to visit once customers maximizing the sum of collected profits while respecting a vehicle time limit. Vehicles are required to start and end at the depot. Among the most known and studied VRPP, we citeare:

** The Team Orienteering Problem (TOP) which is the most studied variant of the VRPP,<ref>{{cite journal |last1=Chao |first1=I-Ming |last2=Golden |first2=Bruce L |last3=Wasil |first3=Edward A |title=The Team Orienteering Problem |journal=European Journal of Operational Research |date=1996 |volume=88 |issue=3 |pages=464–474 |doi=10.1016/0377-2217(94)00289-4}}</ref><ref>{{cite book|author=Archetti, C.|author2=Sperenza, G.|author3=Vigo, D. | editor1 = Toth, P. | editor2 = Vigo, D.|year=2014|chapter=Vehicle routing problems with profits|title=Vehicle Routing: Problems, Methods, and Applications | edition=Second |doi=10.1137/1.9781611973594.ch10|pages=273–297}}</ref><ref>{{cite journal |last1=Hammami|first1=Farouk |last2=Rekik |first2=Monia |last3=Coelho |first3=Leandro C. |title=A hybrid adaptive large neighborhood search heuristic for the team orienteering problem |journal=Computers & Operations Research |date=2020 |volume=123 |pages=105034 |doi=10.1016/j.cor.2020.105034|s2cid=221134904 }}</ref>

** The Capacitated Team Orienteering Problem (CTOP),