A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars

DOI10.1016/j.ejor.2009.05.008zbMath1173.90506OpenAlexW2128856718MaRDI QIDQ1038386

Marie-Claude Bolduc, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.008

zbMATH Keywords

vehicle routinginventorysplit deliverycommon carriertabudistribution calendarinternal fleetproduction calendar

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (9)

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A heuristic approach to a single stage assembly problem with transportation allocation ⋮ An integrated model for production and distribution planning of perishable products with inventory and routing considerations ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems ⋮ Vehicle routing problems with split deliveries ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ Branch and price for the vehicle routing problem with discrete Split deliveries and time windows ⋮ A heuristic algorithm for the free newspaper delivery problem

Uses Software

• BoneRoute
• VRP

Cites Work

• Unnamed Item
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A reactive GRASP and path relinking for a combined production-distribution problem
• Model and algorithm for inventory/routing decision in a three-echelon logistics system
• BoneRoute: An adaptive memory-based method for effective fleet management
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A heuristic for the routing and carrier selection problem
• Synchronized Development of Production, Inventory, and Distribution Schedules
• Integer Programming Formulation of Traveling Salesman Problems
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
• Inventory routing problems: a logistical overview
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars