23,003 research outputs found
Agent-based transportation planning compared with scheduling heuristics
Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. We use simulation to compare the on-time delivery percentage and the vehicle utilization of an agent-based planning system to a traditional system based on OR heuristics (look-ahead rules, serial scheduling). Numerical experiments show that a properly designed multi-agent system may perform as good as or even better than traditional methods
The effects of qos level degradation cost on provider selection and task allocation model in telecommunication networks
Firms acquire network capacity from multiple suppliers which offer different Quality of Service (QoS) levels. After acquisition, day-to-day operations such as video conferencing, voice over IP and data applications are allocated between these acquired capacities by considering QoS requirement of each operation. In optimal allocation scheme, it is generally assumed each operation has to be placed into resource that provides equal or higher QoS Level. Conversely, in this study it is showed that former allocation strategy may lead to suboptimal solutions depending upon penalty cost policy to charge degradation in QoS requirements. We model a cost minimization problem which includes three cost components namely capacity acquisition, opportunity and penalty due to loss in QoS
A stochastic user-operator assignment game for microtransit service evaluation: A case study of Kussbus in Luxembourg
This paper proposes a stochastic variant of the stable matching model from
Rasulkhani and Chow [1] which allows microtransit operators to evaluate their
operation policy and resource allocations. The proposed model takes into
account the stochastic nature of users' travel utility perception, resulting in
a probabilistic stable operation cost allocation outcome to design ticket price
and ridership forecasting. We applied the model for the operation policy
evaluation of a microtransit service in Luxembourg and its border area. The
methodology for the model parameters estimation and calibration is developed.
The results provide useful insights for the operator and the government to
improve the ridership of the service.Comment: arXiv admin note: substantial text overlap with arXiv:1912.0198
Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
We consider the real-time scheduling of full truckload transportation orders with time windows that arrive during schedule execution. Because a fast scheduling method is required, look-ahead heuristics are traditionally used to solve these kinds of problems. As an alternative, we introduce an agent-based approach where intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. This approach offers several advantages: it is fast, requires relatively little information and facilitates easy schedule adjustments in reaction to information updates. We compare the agent-based approach to more traditional hierarchical heuristics in an extensive simulation experiment. We find that a properly designed multiagent approach performs as good as or even better than traditional methods. Particularly, the multi-agent approach yields less empty miles and a more stable service level
Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty
Motivated by the massive deployment of power-hungry data centers for service
provisioning, we examine the problem of routing in optical networks with the
aim of minimizing traffic-driven power consumption. To tackle this issue,
routing must take into account energy efficiency as well as capacity
considerations; moreover, in rapidly-varying network environments, this must be
accomplished in a real-time, distributed manner that remains robust in the
presence of random disturbances and noise. In view of this, we derive a pricing
scheme whose Nash equilibria coincide with the network's socially optimum
states, and we propose a distributed learning method based on the Boltzmann
distribution of statistical mechanics. Using tools from stochastic calculus, we
show that the resulting Boltzmann routing scheme exhibits remarkable
convergence properties under uncertainty: specifically, the long-term average
of the network's power consumption converges within of its
minimum value in time which is at most ,
irrespective of the fluctuations' magnitude; additionally, if the network
admits a strict, non-mixing optimum state, the algorithm converges to it -
again, no matter the noise level. Our analysis is supplemented by extensive
numerical simulations which show that Boltzmann routing can lead to a
significant decrease in power consumption over basic, shortest-path routing
schemes in realistic network conditions.Comment: 24 pages, 4 figure
- …