High-performance heuristics for optimization in stochastic traffic engineering problems
DOI10.1007/978-3-642-12535-5_41zbMATH Open1280.90020OpenAlexW1498519796MaRDI QIDQ3068902FDOQ3068902
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Cited In (8)
- Finding reliable shortest paths in road networks under uncertainty
- Benchmarking problems for robust discrete optimization
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Algorithms for non-linear and stochastic resource constrained shortest path
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Heuristics for the stochastic/dynamic user-optimal route choice problem
- Stochastic motion planning and applications to traffic
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)