Πλοήγηση ανά Θέμα "Large neighbourhood searches"
Αποτελέσματα 1-2 από 2
-
Dynamic Multiple Vehicle Routing under Energy Capacity Constraints
(2020)The multiple vehicle routing problem (mVRP) concerns the scheduling of multiple vehicles so as to visit some locations of interest. We study a dynamic version of mVRP where the travel costs are not a priori known and may ... -
Tournament selection algorithm for the multiple travelling salesman problem
(2020)The multiple Travelling Salesman Problem (mTSP) is a generalization of the classic TSP problem, where the cities in question are visited using a team of salesmen, each one following a different, complementary route. Several ...