Dynamic routing problems with fruitful regions: Models and evolutionary computation

34Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Van Hemert, J. I., & La Poutré, J. A. (2004). Dynamic routing problems with fruitful regions: Models and evolutionary computation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3242, 692–701. https://doi.org/10.1007/978-3-540-30217-9_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free