22,456 research outputs found
On Socially Optimal Traffic Flow in the Presence of Random Users
Traffic assignment is an integral part of urban city planning. Roads and
freeways are constructed to cater to the expected demands of the commuters
between different origin-destination pairs with the overall objective of
minimising the travel cost. As compared to static traffic assignment problems
where the traffic network is fixed over time, a dynamic traffic network is more
realistic where the network's cost parameters change over time due to the
presence of random congestion. In this paper, we consider a stochastic version
of the traffic assignment problem where the central planner is interested in
finding an optimal social flow in the presence of random users. These users are
random and cannot be controlled by any central directives. We propose a
Frank-Wolfe algorithm based stochastic algorithm to determine the socially
optimal flow for the stochastic setting in an online manner. Further,
simulation results corroborate the efficacy of the proposed algorithm
Recommended from our members
Green cell planning and deployment for small cell networks in smart cities
In smart cities, cellular network plays a crucial role to support wireless access for numerous devices anywhere and anytime. The future 5G network aims to build the infrastructure from mobile internet to connected world. Small Cell is one of the most promising technologies of 5G to provide more connections and high data rate. In order to make the best use of small cell technology, smart cell planning should be implemented to guarantee connectivity and performance for all end nodes. It is particularly a challenging task to deploy dense small cells in the presence of dynamic traffic demands and severe co-channel interference. In this paper, we model various traffic patterns using stochastic geometry approach and propose an energy-efficient scheme to deploy and plan small cells according to the prevailing traffic pattern. The simulation results indicate that our scheme can meet dynamic traffic demands with optimized deployment of small cells and enhance the energy efficiency of the system without compromising on quality-of-service (QoS) requirements. In addition, our scheme can achieve very close performance compared with the leading optimization solver CPLEX and find solutions in much less computational times than CPLEX
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
Modelling network travel time reliability under stochastic demand
A technique is proposed for estimating the probability distribution of total network travel time, in the light of normal day-to-day variations in the travel demand matrix over a road traffic network. A solution method is proposed, based on a single run of a standard traffic assignment model, which operates in two stages. In stage one, moments of the total travel time distribution are computed by an analytic method, based on the multivariate moments of the link flow vector. In stage two, a flexible family of density functions is fitted to these moments. It is discussed how the resulting distribution may in practice be used to characterise unreliability. Illustrative numerical tests are reported on a simple network, where the method is seen to provide a means for identifying sensitive or vulnerable links, and for examining the impact on network reliability of changes to link capacities. Computational considerations for large networks, and directions for further research, are discussed
Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach
In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version
Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach
In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version
Stochastic user equilibrium assignment with elastic demand
It is well-known that, in deterministic user equilibrium assignment, it is straightforward to allow for elastic demand. The research described in this paper sets out to show that the same is true for stochastic user equilibrium assignment with elastic demand (SUEED). It presents a new objective function for SUEED, and a simple solution algorithm that can be implemented by only a minor modification to existing assignment software. A numerical example illustrates the working of the algorith
- …