Advertisement

Weighted Multiplicative Decision Function for Distributed Routing in Transport Logistics

  • Bernd-Ludwig WenningEmail author
  • Henning Rekersbrink
  • Andreas Timm-Giel
  • Carmelita Görg
Conference paper

Abstract

In transport logistics, routing is usually done by a central instance that is solving the optimization problem of finding the best solution to cover the current set of orders with the current set of vehicles under constraints such as punctuality, vehicle utilization etc. Approaches have been suggested recently which change this paradigm towards a distributed approach with autonomous entities deciding on their own. Autonomous entities denote, in this case, the vehicles as well as the goods. When each of the entities makes its own route decisions, it has to consider multiple parameters, which are partially static (e.g. distances) and partially dynamic. An example for a dynamic parameter is the knowledge about vehicle availability that goods need for their decisions. The work presented here is based on the information exchange concept DLRP (Distributed Logistic Routing Protocol), which has been proposed before. Within that framework, the concept of weighted multiplicative combination of context values into a decision function is now introduced for the route decisions made by autonomous entities.

Keywords

Travelling Salesman Problem Decision Function Vehicle Route Problem Route Request Vehicle Utilization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

This research was supported by the German Research Foundation (DFG) as part of the Collaborative Research Centre 637 “Autonomous Cooperating Logistic Processes”.

References

  1. Rekersbrink H, Makuschewitz T, Scholz-Reiter B (2009) A distributed routing concept for vehicle routing problems. In: Logistics Research 1/1, Springer, pp. 45–52.Google Scholar
  2. Scholz-Reiter B, Windt K, Freitag M (2004) Autonomous Logistic Processes: New demands and first approaches. In: Monostori L (ed) Proceedings 37th CIRP international seminar on manufacturing systems, pp. 357–362.Google Scholar
  3. Scholz-Reiter B, Rekersbrink H, Freitag M (2006) Internet routing protocols as an autonomous control approach for transport networks. In: Proc. of the 5th CIRP international seminar on intelligent computation in manufacturing engineering, pp. 341–345.Google Scholar
  4. Scholz-Reiter B, Rekersbrink H, Wenning B-L, Makuschewitz T (2008) A survey of autonomous control algorithms by means of adapted vehicle routing problems. In: Proceedings of the 9th Biennial ASME Conference on Engineering Systems Design and Analysis ESDA 08, published on CD-ROM.Google Scholar
  5. Wenning B-L, Görg C, Peters K (2005) Ereignisdiskrete Modellierung von Selbststeuerung in Transportnetzen. In: Industrie Management 21/5, pp. 53–56.Google Scholar
  6. Wenning B-L, Rekersbrink H, Timm-Giel A, Görg C, Scholz-Reiter B (2007) Autonomous control by means of distributed routing. In: Hülsmann M, Windt K (eds) Understanding Autonomous Cooperation and Control in Logistics—the Impact on Management, Information and Communication and Material Flow, pp. 335–345.Google Scholar

Copyright information

© Springer -Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Bernd-Ludwig Wenning
    • 1
    Email author
  • Henning Rekersbrink
    • 2
  • Andreas Timm-Giel
    • 1
  • Carmelita Görg
    • 1
  1. 1.Communication NetworksUniversity of BremenBremenGermany
  2. 2.BIBA - Bremer Institut für Produktion und Logistik GmbHBremenGermany

Personalised recommendations