Route-based approximate dynamic programming for dynamic pricing in attended home delivery
From MaRDI portal
Publication:2023939
DOI10.1016/j.ejor.2020.04.002zbMath1487.90124OpenAlexW3026160370MaRDI QIDQ2023939
Publication date: 3 May 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.04.002
Related Items (8)
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem ⋮ Making opportunity sales in attended home delivery ⋮ Demand management for attended home delivery -- a literature review ⋮ Recent advances in integrating demand management and vehicle routing: a methodological review ⋮ Dynamic demand management and online tour planning for same-day delivery ⋮ Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Strategies to improve customer service in delivery time slot management
Uses Software
Cites Work
- The discrete time window assignment vehicle routing problem
- Anticipatory optimization for dynamic decision making
- A review of choice-based revenue management: theory and methods
- Product line selection and pricing under a share-of-surplus choice model.
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- An approximate dynamic programming approach to attended home delivery management
- The theory and practice of revenue management
- A review of revenue management: recent generalizations and advances in industry applications
- Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
- Dynamic pricing of multiple home delivery options
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- E-fulfillment and multi-channel distribution - A review
- Introduction to Stochastic Programming
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Approximate Dynamic Programming
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
- On the Optimal Product Line Selection Problem with Price Discrimination
- Discrete Choice Methods with Simulation
- Modeling Distribution Problems with Time Windows: Part I
- Heuristics for tactical time slot management: a periodic vehicle routing problem view
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
This page was built for publication: Route-based approximate dynamic programming for dynamic pricing in attended home delivery
