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

DOI10.1016/J.EJOR.2006.07.010MaRDI QIDQ2370367zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pricingvehicle routing problemrevenue management

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 5044373 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• A continuous model for production-distribution system design
• Bounds and Heuristics for Capacitated Routing Problems
• Effects of a demand-curve's shape on the optimal solutions of a multi-echelon inventory/pricing model
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• Modeling quantity discounts under general price-sensitive demand functions: Optimal policies and relationships
• Network flows. Theory, algorithms, and applications.
• 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
• The profit-maximizing weber problem
• The vehicle routing problem
• Uncapacitated Plant Location Under Alternative Spatial Price Policies

Cited in

(5)

• Aggregate planning models for field service delivery
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery
• Challenges and opportunities in attended home delivery
• Mathematical programming with stochastic equilibrium constraints applied to optimal last-mile delivery services
• Worst-case demand distributions in vehicle routing

Describes a project that uses

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)