An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
From MaRDI portal
Publication:1652283
DOI10.1016/j.cor.2017.02.001zbMath1458.90049OpenAlexW2585661039MaRDI QIDQ1652283
Aldair Alvarez, Pedro Augusto Munari
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.001
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ The vehicle allocation problem: alternative formulation and branch-and-price method ⋮ Robust Team Orienteering Problem with Decreasing Profits ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service ⋮ Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm ⋮ The paired mail carrier problem ⋮ An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands ⋮ A hybrid mathematical model for flying sidekick travelling salesman problem with time windows ⋮ An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Models and algorithms for the delivery and installation routing problem ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
Cites Work
- Unnamed Item
- A matheuristic approach for the pollution-routing problem
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- A hybrid algorithm for a class of vehicle routing problems
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- An iterated local search heuristic for the split delivery vehicle routing problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- An ILP improvement procedure for the open vehicle routing problem
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
- Hybridizing exact methods and metaheuristics: a taxonomy
- Variable neighborhood search
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Branching rules revisited
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- New developments in the primal-dual column generation technique
- A matheuristic for the truck and trailer routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Scatter search for the vehicle routing problem with time windows
- A new ILP-based refinement heuristic for vehicle routing problems
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- A note on the primal-dual column generation method for combinatorial optimization
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
