Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation

  • van Hemert J
  • la Poutré J
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the problem is being solved, which makes it a real-time routing problem. The solver is a self-adaptive evolutionary algorithm that ensures feasible solutions at all times. We investigate under what conditions the exploration of fruitful regions improves the effectiveness of the evolutionary algorithm.

Author-supplied keywords

  • dynamic problems; evolutionary computation; vehicl

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • J I van Hemert

  • J A la Poutré

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free