Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
From MaRDI portal
Publication:6099459
Recommendations
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
Cites work
- A combinatorial Benders' decomposition for the lock scheduling problem
- A Dynamic Programming Approach to Sequencing Problems
- A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for parallel machine scheduling with conflicts
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels
- An optimal constraint programming approach to the open-shop problem
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Computational complexity of some restricted instances of 3-SAT
- Direct shipping and the dynamic single-depot/multi-retailer inventory system
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Logic-based Benders decomposition
- Logic-based Benders decomposition for scheduling a batching machine
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Replenishment routing problems between a single supplier and multiple retailers with direct delivery
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Scheduling with batching: A review
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- The Benders decomposition algorithm: a literature review
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Vehicle Routing
Cited in
(4)- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- Milk run optimization with delivery windows and hedging against uncertainty
- A branch-price-and-cut algorithm for sustainable milk-run vehicle scheduling problem with cross-dimensional integration
This page was built for publication: Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099459)
