Pages that link to "Item:Q5322013"

The following pages link to Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (Q5322013):

Displaying 50 items.

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
• Effective truckload dispatch decision methods with incomplete advance load information (Q322842) (← links)
• Pro-active real-time routing in applications with multiple request patterns (Q323177) (← links)
• Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives (Q339640) (← links)
• Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
• An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization (Q545555) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• The flexible and real-time commute trip sharing problems (Q823767) (← links)
• Online stochastic reservation systems (Q846144) (← links)
• Dynamic VRP in pharmaceutical distribution -- a case study (Q926346) (← links)
• Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
• Dynamic pickup and delivery problems (Q1038370) (← links)
• Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming (Q1043350) (← links)
• Real-time control of freight forwarder transportation networks by integrating multimodal transport chains (Q1044090) (← links)
• Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
• Multi-period technician scheduling with experience-based service times and stochastic customers (Q1652258) (← links)
• A monarch butterfly optimization for the dynamic vehicle routing problem (Q1657092) (← links)
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search (Q1695780) (← links)
• Value function approximation for dynamic multi-period vehicle routing (Q1749495) (← links)
• Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review'' (Q1752348) (← links)
• A probabilistic approach to pickup and delivery problems with time window uncertainty (Q1755385) (← links)
• A dynamic vehicle routing problem with multiple delivery routes (Q1761751) (← links)
• An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
• Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
• Online stochastic optimization under time constraints (Q1958625) (← links)
• Same-day delivery with pickup stations and autonomous vehicles (Q2003409) (← links)
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery (Q2023939) (← links)
• The online vehicle routing problem with occasional drivers (Q2027017) (← links)
• A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← links)
• Deep Q-learning for same-day delivery with vehicles and drones (Q2076870) (← links)
• Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
• Learning surrogate functions for the short-horizon planning in same-day delivery problems (Q2117229) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← links)
• An online stochastic algorithm for a dynamic nurse scheduling problem (Q2183326) (← links)
• Decision making on post-disaster rescue routing problems from the rescue efficiency perspective (Q2184119) (← links)
• Column generation-based stochastic school bell time and bus scheduling optimization (Q2189900) (← links)
• Scenario tree construction driven by heuristic solutions of the optimization problem (Q2221468) (← links)
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing (Q2303337) (← links)
• Operations research at container terminals: a literature update (Q2480797) (← links)
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
• A dynamic and probabilistic orienteering problem (Q2669558) (← links)
• A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
• Dynamic service area sizing in urban delivery (Q2676271) (← links)