Estimating the marginal cost to deliver to individual customers

DOI10.1007/S11081-022-09779-4OpenAlexW4313816465MaRDI QIDQ6088526

Akang Wang, Chrysanthos E. Gounaris, Zachary A. Wilson, Jeffrey E. Arbogast, Gildas Bonnier

Publication date: 16 November 2023

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-022-09779-4

zbMATH Keywords

routingbranch-price-and-cutHoeffding's inequalityscenario samplingmarginal cost estimationmulti-depot vehicle routing problem with inter-depot routes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A tutorial on column generation and branch-and-price for vehicle routing problems
• The multi-depot vehicle routing problem with inter-depot routes
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
• The periodic vehicle routing problem with intermediate facilities
• Separating capacity constraints in the CVRP using tabu search
• Limited memory rank-1 cuts for vehicle routing problems
• New benchmark instances for the capacitated vehicle routing problem
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• A generic exact solver for vehicle routing and related problems
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Improved branch-cut-and-price for capacitated vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Waste collection vehicle routing problem with time windows
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A survey of resource constrained shortest path problems: Exact solution approaches
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Vehicle Routing
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Asymptotic Statistics
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
• Allocating Cost of Service to Customers in Inventory Routing
• Selected Topics in Column Generation
• Vehicle routing problems with multiple trips

This page was built for publication: Estimating the marginal cost to deliver to individual customers