scientific article; zbMATH DE number 956788

Patrick Jaillet, Amedeo R. Odoni, Warren B. Powell

Publication date: 15 September 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

transportation traveling salesman routing logistics dynamic models a priori optimization infinite networks covering shortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Minimizing fleet operating costs for a container transportation company, Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, A solution method for a two-dispatch delivery problem with stochastic customers, Graceful reassignment of excessively long communications paths in networks, Multicommodity flows over time: Efficient algorithms and complexity, Flows in dynamic networks with aggregate arc capacities, The dynamic team forming problem: throughput and delay for unbiased policies, The dynamic shortest path problem with anticipation, A decision support system for the single-depot vehicle rescheduling problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks, The dynamic vehicle allocation problem with application in trucking companies in Brazil, Dynamic fleet management as a logistics queueing network, Travel time reliability in vehicle routing and scheduling with time windows, Heuristic and lower bound for a stochastic location-routing problem, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, Minimum cost dynamic flows: The series-parallel case, Logistics for diagnostic testing: an adaptive decision-support framework, A note on the quickest minimum cost transshipment problem, Scalable timing-aware network design via Lagrangian decomposition, Temporal flows in temporal networks, The Maximum Energy-Constrained Dynamic Flow Problem, Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies., Continuous and discrete flows over time, A parallelizable dynamic fleet management model with random travel times, A fuzzy-based customer classification method for demand-responsive logistical distribution operations., An Introduction to Network Flows over Time, Algorithms for Finding Optimal Flows in Dynamic Networks, Opportunities for OR in intermodal freight transport research: A review., Nash equilibria and the price of anarchy for flows over time, Unnamed Item, A polynomial time algorithm for the minimum flow problem in time-varying networks, A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, Recent Developments in Dynamic Vehicle Routing Systems, Random equilibrium problems on networks, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, Real-time vehicle rerouting problems with time windows, Minimum flow problem on network flows with time-varying bounds, Dynamic transport scheduling under multiple resource constraints, Robust strategies for natural gas procurement, Maximum flow problem on dynamic generative network flows with time-varying bounds, A general system theory approach to rail freight car fleet sizing, Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse, On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands, Traffic Networks and Flows over Time, One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints, Planning models for freight transportation, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Vehicle routing and scheduling with dynamic travel times, Heterogeneous multi-commodity network flows over time, Efficient continuous-time dynamic network flow algorithms, Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem