Route-based approximate dynamic programming for dynamic pricing in attended home delivery
type: Item
instance of: scholarly article
title: Route-based approximate dynamic programming for dynamic pricing in attended home delivery
zbMATH Open document ID: 1487.90124
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7342757
zbMATH Keywords: e-commerce
zbMATH Keywords: attended home delivery
zbMATH Keywords: revenue management
zbMATH Keywords: dynamic pricing
zbMATH Keywords: approximate dynamic programming
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.04.002
OpenAlex ID: W3026160370
cites work: E-fulfillment and multi-channel distribution - A review
cites work: Dynamic pricing of multiple home delivery options
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: Introduction to Stochastic Programming
cites work: Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
cites work: Modeling Distribution Problems with Time Windows: Part I
cites work: A branch-and-cut algorithm for the time window assignment vehicle routing problem
cites work: Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
cites work: Heuristics for tactical time slot management: a periodic vehicle routing problem view
cites work: A review of revenue management: recent generalizations and advances in industry applications
cites work: Least squares approximate policy iteration for learning bid prices in choice-based revenue management
cites work: Product line selection and pricing under a share-of-surplus choice model.
cites work: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
cites work: Anticipatory optimization for dynamic decision making
cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management
cites work: Approximate Dynamic Programming
cites work: On the Optimal Product Line Selection Problem with Price Discrimination
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: The discrete time window assignment vehicle routing problem
cites work: A review of choice-based revenue management: theory and methods
cites work: The theory and practice of revenue management
cites work: Discrete Choice Methods with Simulation
cites work: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
cites work: An approximate dynamic programming approach to attended home delivery management
DOI: 10.1016/J.EJOR.2020.04.002
Recommended article: An approximate dynamic programming approach to attended home delivery management
Recommended article: Planning and approximation models for delivery route based services with price-sensitive demands
Recommended article: An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service
Recommended article: Dynamic pricing of flexible time slots for attended home delivery
Recommended article: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
Recommended article: A dynamic programming framework for optimal delivery time slot pricing
Recommended article: Anticipative dynamic slotting for attended home deliveries
Recommended article: Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming
Recommended article: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
description: scientific article; zbMATH DE number 7342757