A scalable anticipatory policy for the dynamic pickup and delivery problem

DOI10.1016/j.cor.2022.105943OpenAlexW4285604336WikidataQ114193044 ScholiaQ114193044MaRDI QIDQ2676347

Gianpaolo Ghiani, Andrea Manni, Emanuele Manni

Publication date: 27 September 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105943

zbMATH Keywords

supervised learningroutinganticipatory policiesdynamic pickup and deliveryparametric policy function approximation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Dynamic priority rules for combining on-demand passenger transportation and transportation of goods

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anticipatory optimization for dynamic decision making
• Dynamic pickup and delivery problems
• Topics in real-time fleet management
• A unified framework for stochastic optimization
• Pickup and delivery problem with time windows: a new compact two-index formulation
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Locally ideal formulations for piecewise linear functions with indicator variables
• Dynamic fleet management. Concepts, systems, algorithms \& case studies
• Vehicle routing and scheduling with dynamic travel times
• A review of vehicle routing with simultaneous pickup and delivery
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

This page was built for publication: A scalable anticipatory policy for the dynamic pickup and delivery problem