Abstract
In this article, we propose and evaluate simple rules for selecting transport requests that do not fit into a request portfolio because their temporal or spatial requirements are incompatible with the requirements of other requests so that the compilation of profitable routes is compromised. We integrate these rules into an adaptive online vehicle operations planning system and analyze in numerical simulation experiments how their application has impacts on the flexibility, the stability and the profitability of the controlled transportation system and the integration of consecutively arriving requests.
Recommended Citation
Schönberger, Jörn and Kopfer, Herbert, "RULES FOR THE IDENTIFICATION OF PORTFOLIO-INCOMPATIBLE REQUESTS IN DYNAMIC VEHICLE ROUTING" (2009). Wirtschaftsinformatik Proceedings 2009. 91.
https://aisel.aisnet.org/wi2009/91