Hexaly's prize collecting vehicle routing problem (PCVRP) is a route optimization model that incorporates an aspect of prizes, tips, or payoffs. It is a multi-objective model that seeks to maximize prize payoff, minimize vehicles used, minimize the range of payoffs, and minimize the total distance driven.
See how to run this Hexaly model in Nextmv and leverage features for run reproducibility and troubleshooting, scenario testing, run observability and monitoring, and, finally, ensemble definitions for auto-selecting the best run from among many options based on specified criteria.
Learn more:
