Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands

Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about... This work focuses on the dynamic Pickup and Delivery Problem with Time Windows (PDPTW). The transport requests should be performed using the available fleet of vehicles. The vehicles move between the nodes of a road network. The aim of this work is to propose a model which allows, during a transport plan creation, to take into account predictable events. Particularly, we consider the frequency of requests at any node in the road network and the construction of vehicle routes that will allow new requests to be inserted without any significant route modification. Therefore, we construct routes that pass near the nodes where transport requests are most frequently generated. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Fundamenta Informaticae IOS Press

Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands

Loading next page...
 
/lp/ios-press/multi-agent-approach-to-dynamic-pick-up-and-delivery-problem-with-TULmxKubZp

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2006 by IOS Press, Inc
ISSN
0169-2968
eISSN
1875-8681
Publisher site
See Article on Publisher Site

Abstract

This work focuses on the dynamic Pickup and Delivery Problem with Time Windows (PDPTW). The transport requests should be performed using the available fleet of vehicles. The vehicles move between the nodes of a road network. The aim of this work is to propose a model which allows, during a transport plan creation, to take into account predictable events. Particularly, we consider the frequency of requests at any node in the road network and the construction of vehicle routes that will allow new requests to be inserted without any significant route modification. Therefore, we construct routes that pass near the nodes where transport requests are most frequently generated.

Journal

Fundamenta InformaticaeIOS Press

Published: Jan 1, 2006

There are no references for this article.