Abstract
This work treats the topic of solving dynamic pickup
and delivery problems, also known as dial-a-ride problems. A
simulation model is introduced that describes how an agent is
able to satisfy the transportation requests. The agent behavior is
given in form of a complex dispatching rule, which is optimized
by metaheuristic approaches. For this purpose, a fitness function
is described which is used to evaluate the quality of a solution.
The rule to be optimized is a weighted sum of several primitive
dispatching rules where each describes a small part of the
information available in the system at a given time. Given a
good configuration of the weights, we will show that the agents
are able to serve the transportation requests. The optimization of
the weights was conducted with the generic, open, and extensible
optimization framework HeuristicLab.
Original language | English |
---|---|
Title of host publication | 2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009 |
Publisher | IEEE Computer Society Press |
Pages | 1-6 |
ISBN (Print) | 9781424439584 |
DOIs | |
Publication status | Published - 2009 |
Event | IEEE 2nd International Symposium on Logistics and Industrial Informatics (LINDI 2009) - Linz, Austria Duration: 10 Sept 2009 → 12 Sept 2009 http://www.fh-ooe.at/lindi2009/ |
Publication series
Name | 2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009 |
---|
Conference
Conference | IEEE 2nd International Symposium on Logistics and Industrial Informatics (LINDI 2009) |
---|---|
Country/Territory | Austria |
City | Linz |
Period | 10.09.2009 → 12.09.2009 |
Internet address |
Keywords
- Dispatching
- Optimization
- Pickup and delivery
- Simulation