Planning and approximation models for delivery route based services with price-sensitive demands

DOI10.1016/J.EJOR.2006.07.010zbMATH Open1127.90037OpenAlexW2005766443MaRDI QIDQ2370367FDOQ2370367

Authors: Joseph Geunes, Zuo-Jun (Max) Shen, Akin Emir 

Publication date: 25 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.010

Recommendations

• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• Mathematical programming with stochastic equilibrium constraints applied to optimal last-mile delivery services
• Dynamic pricing of multiple home delivery options
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems

zbMATH Keywords

pricingvehicle routing problemrevenue management

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)

Cites Work

• Network flows. Theory, algorithms, and applications.
• The vehicle routing problem
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• Bounds and Heuristics for Capacitated Routing Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Operational estimators for the length of a traveling salesman tour
• Optimal ordering and pricing policies in a single-period environment with multivaiate demand and markdowns
• Effects of a demand-curve's shape on the optimal solutions of a multi-echelon inventory/pricing model
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Modeling quantity discounts under general price-sensitive demand functions: Optimal policies and relationships
• A continuous model for production-distribution system design
• Title not available (Why is that?)
• The profit-maximizing weber problem

Cited In (4)

• Route-based approximate dynamic programming for dynamic pricing in attended home delivery
• Challenges and opportunities in attended home delivery
• Worst-case demand distributions in vehicle routing
• Aggregate planning models for field service delivery

Uses Software

• VRP

This page was built for publication: Planning and approximation models for delivery route based services with price-sensitive demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370367)