An interactive computerized algorithm for multicriteria vehicle routing problems
Computers and Industrial Engineering
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Software—Practice & Experience
Enhancements of NSGA II and its application to the vehicle routing problem with route balancing
EA'05 Proceedings of the 7th international conference on Artificial Evolution
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
| Hi-index | 0.00 |
The article presents a framework for the resolution of rich vehicle routing problems which are difficult to address with standard optimization techniques. We use local search on the basis on variable neighborhood search for the construction of the solutions, but embed the techniques in a flexible framework that allows the consideration of complex side constraints of the problem such as time windows, multiple depots, heterogeneous fleets, and, in particular, multiple optimization criteria. In order to identify a compromise alternative that meets the requirements of the decision maker, an interactive procedure is integrated in the resolution of the problem, allowing the modification of the preference information articulated by the decision maker. The framework is implemented in a computer system. Results of test runs on multiple depot multi-objective vehicle routing problems with time windows are reported.