Development and implementation of algorithms for vehicle routing during a no-notice evacuation
From MaRDI portal
Publication:4966752
Recommendations
Cites work
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- scientific article; zbMATH DE number 1870046 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- A dynamic vehicle routing problem with time-dependent travel times
- A unified solution framework for multi-attribute vehicle routing problems
- An Appraisal of Some Shortest-Path Algorithms
- Assignment problems: a golden anniversary survey
- Complex scale-free networks
- Finding reliable shortest paths in road networks under uncertainty
- New exact method for large asymmetric distance-constrained vehicle routing problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Travel time reliability in vehicle routing and scheduling with time windows
- Vehicle dispatching with time-dependent travel times
- Vehicle routing and scheduling with time-varying data: a case study
- Vehicle routing with dynamic travel times: a queueing approach
- Vehicle routing with stochastic time-dependent travel times
Cited in
(2)
This page was built for publication: Development and implementation of algorithms for vehicle routing during a no-notice evacuation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4966752)