High-performance heuristics for optimization in stochastic traffic engineering problems

DOI10.1007/978-3-642-12535-5_41MaRDI QIDQ3068902zbMATH OpenOpenAlexFDO

Authors E. Nikolova

Publication date 18 January 2011

Published in Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12535-5_41

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 4057261
• Optimal routing for minimizing the maximal link congestion
• Shortest path network problems with stochastic arc weights
• A heuristic algorithm for a stochastic transportation network
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making

Cited in

(8)

• Heuristics for the stochastic/dynamic user-optimal route choice problem
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
• Algorithms for non-linear and stochastic resource constrained shortest path
• Finding reliable shortest paths in road networks under uncertainty
• Stochastic motion planning and applications to traffic
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Benchmarking problems for robust discrete optimization

This page was built for publication: High-performance heuristics for optimization in stochastic traffic engineering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068902)