[go: up one dir, main page]

Sever et al., 2013 - Google Patents

Dynamic shortest path problems: Hybrid routing policies considering network disruptions

Sever et al., 2013

Document ID
16397380651091567298
Author
Sever D
Dellaert N
Van Woensel T
De Kok T
Publication year
Publication venue
Computers & Operations Research

External Links

Snippet

Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks

Similar Documents

Publication Publication Date Title
Sever et al. Dynamic shortest path problems: Hybrid routing policies considering network disruptions
Pan et al. Proactive vehicular traffic rerouting for lower travel time
Li et al. Towards alleviating traffic congestion: Optimal route planning for massive-scale trips
CN103309917B (en) Path searching method and path search device
Smith et al. A splitting rate model of traffic re-routeing and traffic control
Owais et al. Exact and heuristics algorithms for screen line problem in large size networks: Shortest path-based column generation approach
Opasanon et al. Multicriteria adaptive paths in stochastic, time-varying networks
US9253012B2 (en) Path selection device, program and method
Varga Solutions to the routing problem: towards trustworthy autonomous vehicles
Meng et al. A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem
Peeta et al. Robustness of the off-line a priori stochastic dynamic traffic assignment solution for on-line operations
Karim et al. Robust routing based on urban traffic congestion patterns
Nguyen et al. A randomized path routing algorithm for decentralized route allocation in transportation networks
Liu et al. Transport capacity limit of urban street networks
Wang et al. An improved evolutionary algorithm for dynamic vehicle routing problem with time windows
Strnad et al. Numerical optimal control method for shockwaves reduction at stationary bottlenecks
Luan et al. Does the priority of ambulance guarantee no delay? a MIPSSTW model of emergency vehicle routing optimization considering complex traffic conditions for highway incidents
Tembine et al. Dynamic routing games: An evolutionary game theoretic approach
Biswal et al. α-reliable shortest path problem in uncertain time-dependent networks
Chen et al. Risk-averse autonomous route guidance by a constrained A* search
Golasowski et al. Alternative paths reordering using probabilistic time-dependent routing
Finnson et al. A framework for modeling trustworthiness of users in mobile vehicular ad-hoc networks and its validation through simulated traffic flow
El-Sayed et al. A cost effective route guidance method for urban areas using histograms
Ukkusuri et al. Exploring user behavior in online network equilibrium problems
Zhang et al. A Cooperative Q‐Learning Path Planning Algorithm for Origin‐Destination Pairs in Urban Road Networks