Online spatio-temporal matching in stochastic and dynamic domains

DOI10.1016/j.artint.2018.04.005zbMath1448.90020OpenAlexW2799785707MaRDI QIDQ1648078

Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet

Publication date: 27 June 2018

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2018.04.005

zbMATH Keywords

stochastic optimizationonline matchingMDPsonline linear programming

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Markov and semi-Markov decision processes (90C40) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Mix and match: Markov chains and mixing times for matching in rideshare

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• A stochastic algorithm for online bipartite resource allocation problems
• An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
• Commitment under uncertainty: Two-stage stochastic matching problems
• Partitioning procedures for solving mixed-variables programming problems
• On complexity of multistage stochastic programs
• Bayesian Mechanism Design
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• Online Markov Decision Processes
• Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
• Online algorithms for market clearing
• Algorithms for Reinforcement Learning
• Lectures on Stochastic Programming
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Online Stochastic Matching: New Algorithms with Better Bounds
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Approximate Dynamic Programming
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• On-line single-server dial-a-ride problems
• Dynamic programming based metaheuristics for the dial-a-ride problem

This page was built for publication: Online spatio-temporal matching in stochastic and dynamic domains