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

DOI10.1016/j.ejor.2006.07.010zbMath1127.90037MaRDI QIDQ2370367

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

vehicle routing problem; pricing; revenue management

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90C27: Combinatorial optimization

Related Items

Challenges and Opportunities in Attended Home Delivery

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Modeling quantity discounts under general price-sensitive demand functions: Optimal policies and relationships
• A continuous model for production-distribution system design
• Effects of a demand-curve's shape on the optimal solutions of a multi-echelon inventory/pricing model
• The Vehicle Routing Problem
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Bounds and Heuristics for Capacitated Routing Problems
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• The profit-maximizing weber problem