Jano's Homepage
Personal
Publications
Presentations
Projects
 · DGEMap
 · Disc-Cover
 · eArtWeb
 · Problem Evolving
 · RandomCsp
 · Vehicle Routing
Photos
Past



 
Projects » Vehicle Routing


DEAL: Distributed Engine for Advanced Logistics
info J.I. van Hemert @ 2002/04/01, Amsterdam, The Netherlands

DEAL is a research project depending on the collaboration between commercial and research parties. Within the present consortium, wide experience is present on both the technological aspects and the market in focus. The ambition of the consortium is to apply the attained knowledge on a broad scale in products destined for the national and international logistic services.



DynVRP-Generator 1.0
software J.I. van Hemert @ 2006/02/26, Edinburgh, UK

This problem generator for dynamic routing problems can be used to study different aspects of real-time routing by changing parameters of the problem. It is written in Perl and has extensive documentation



Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
inproceedings van Hemert, J.I. and la Poutré, J.A. @ 2004/09/18, Birmingham, UK
Parallel Problem Solving from Nature (PPSN VIII), pages 690-699.
[ pdf ]

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.



Exploiting Fruitful Regions in Dynamic Vehicle Routing: Models and Evolutionary Computation
invited_presentation Jano I. van Hemert @ 2004/11/24, University of Nottingham, UK
University of Nottingham, School of Computing and IT Seminar Series.
[ pdf ]

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 by employing anticipatory routing, improves the effectiveness of the evolutionary algorithm.



Exploiting Fruitful Regions in Dynamic Routing: Models and Evolutionary Computation
presentation Jano I. van Hemert @ 2004/11/04, Edinburgh, Scotland
Napier University, Centre for Emergent Computing Seminar Series.
[ pdf ]

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 by employing anticipatory routing, improves the effectiveness of the evolutionary algorithm.



Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
poster Jano I. van Hemert and J. A. La Poutre @ 2004/09/21, Birmingham, UK
Parallel Problem Solving from Nature (PPSN VIII).
[ pdf ]

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.