A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
type: Item
instance of: scholarly article
title: A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
zbMATH Open document ID: 1173.90506
author: Marie-Claude Bolduc
author: G. Laporte
author: Jacques Renaud
author: Fayez F. Boctor
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 5634745
zbMATH Keywords: vehicle routing
zbMATH Keywords: distribution calendar
zbMATH Keywords: production calendar
zbMATH Keywords: inventory
zbMATH Keywords: internal fleet
zbMATH Keywords: common carrier
zbMATH Keywords: split delivery
zbMATH Keywords: tabu
describes a project that uses: VRP
describes a project that uses: BoneRoute
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.05.008
OpenAlex ID: W2128856718
cites work: A heuristic for the routing and carrier selection problem
cites work: A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
cites work: A reactive GRASP and path relinking for a combined production-distribution problem
cites work: Q4532234
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Synchronized development of production, inventory, and distribution schedules
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Inventory routing problems: a logistical overview
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: Model and algorithm for inventory/routing decision in a three-echelon logistics system
DOI: 10.1016/J.EJOR.2009.05.008
Recommended article: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
Recommended article: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
Recommended article: A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
Recommended article: Q5194200
Recommended article: An iterated local search heuristic for the split delivery vehicle routing problem
Recommended article: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Recommended article: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
Recommended article: The Split Delivery Vehicle Routing Problem: A Survey
Recommended article: A novel approach to solve the split delivery vehicle routing problem
Recommended article: Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
description: scientific article; zbMATH DE number 5634745