Titlebook: Computational Logistics; 4th International Co Dario Pacino,Stefan Vo?,Rune M?ller Jensen Conference proceedings 2013 Springer-Verlag Berlin

內(nèi)行

Dynamic Routing on OpenStreetMap Using Ant Coloniesa road network considering the current traffic situation. AntScout reacts immediately to any change in the query or in the current traffic situation. This is achieved by the continuous application of ant colonies which are specially designed for problems with unexpected dynamic input change. The nav

asthma

On the Complexity of Computing Optimal Private Park-and-Ride Plansces may be much bigger than the number of people) where the weight of an edge is the cost of traveling along the edge with a car. Every member of the group has a car at their disposal and the objective is to minimize the total cost for getting all the members to the common destination. The members h

GULF

Predicting Road Accidents Based on Current and Historical Spatio-temporal Traffic Flow Data induction loop sensors, could cause road accidents. If flow conditions that make an accident more likely can be reliably predicted in real time, it would be possible to use this information to take preventive measures, such as changing variable speed limits before an accident happens. The system us

beta-cells

An Integrated Simulation and Business Intelligence Framework for Designing and Planning Demand Respoices and policies before their implementation. Additionally, most of them, recently introduced new auxiliary Business Intelligence decision support tools in order to transform their available huge amount of real operating data into timely and accurate information for their decisions. However, althou

Malleable

A Model for the Coordination of 20-foot and 40-foot Container Movements in the Hinterland of a Contart. Loaded containers are handled as pickup-and-delivery requests, however, requests for empty containers are incomplete because either the pickup location of a container or the delivery location of a container is a priori unknown. The problem is modelled as a generalization of the pickup-and-delive

SUE

Dynamic Collaborative Transportation Planning: A Rolling Horizon Planning Approaching an exchange of customer requests for higher operational efficiencies. In order to realize the synergy embedded in CTP, appropriate request exchange mechanisms have to be developed. Compared to their static counterparts, little research has been conducted on dynamic CTP problems (DCTPP). In this

d-limonene

reception

TSP with Multiple Time-Windows and Selective Citiesd be visited once within one of the corresponding predefined multiple time windows. A subset of the selective cities, whose cardinality depends on the tour completion time, should be visited within one of the associated multiple time windows. The objective is to plan a tour, not exceeding a predefin