Interactive Utility Maximization in Multi-Objective Vehicle Routing Problems: A "Decision Maker in the Loop"-Approach

The article presents an interactive multi-criteria approach for the resolution of rich vehicle routing problems. A flexible framework was built to be able to deal with various components of general vehicle routing problems, e.g. the consideration of multiple objectives or different types of specific complex side constraints such as time windows, multiple depots or heterogeneous fleets. In the framework, a local search approach on the basis of variable neighborhood search (VNS) constructs and improves solutions in real time. The decision maker is actively involved into the resolution process as the system allows the interactive articulation of preference information, influencing the global utility function that guides the search. Results of test runs on multiple depot multi-objective vehicle routing problems with time windows are reported, simulating different types of decision maker behaviors

[1]  Yang Byung Park,et al.  A solution of vehicle routing problems in a multiple objective environment , 1986 .

[2]  Martin Josef Geiger,et al.  On the Interactive Resolution of Multi-objective Vehicle Routing Problems , 2006, EMO.

[3]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[4]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[5]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[6]  Murat Köksalan,et al.  An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization , 2003, Manag. Sci..

[7]  Martin Josef Geiger,et al.  Genetic Algorithms for multiple objective vehicle routing , 2008, ArXiv.

[8]  Yang-Byung Park,et al.  An interactive computerized algorithm for multicriteria vehicle routing problems , 1989 .

[9]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[10]  Malek Rahoual,et al.  Multicriteria Genetic Algorithms for the Vehicle Routing Problem with Time Windows , 2001 .

[11]  Nicolas Jozefowiez,et al.  Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem , 2002, PPSN.

[12]  P. J. Stacey.  Practical Vehicle Routeing Using Computer Programs , 1983 .

[13]  Tzong-Ru Lee,et al.  A study of vehicle routing problems with load‐balancing , 1999 .

[14]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[15]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[16]  Susan L. Denham,et al.  Visualizing Search and Solution Spaces in the Optimum Design of Biaxial Columns , 2006 .

[17]  C. D. J. Waters.  Interactive Vehicle Routeing , 1984 .

[18]  Richard J. Balling,et al.  Multiobjective Urban Planning Using Genetic Algorithm , 1999 .

[19]  Nicolas Jozefowiez,et al.  Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing , 2005, Artificial Evolution.

[20]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[21]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[22]  Tadahiko Murata,et al.  Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions , 2005 .