A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
type: Item
instance of: scholarly article
title: A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
zbMATH Open document ID: 1163.90360
author: Jean-François Côté
author: Jean-Yves Potvin
published in: European Journal of Operational Research
publication date: 2009-06-29T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5571308
zbMATH Keywords: vehicle routing
zbMATH Keywords: private fleet
zbMATH Keywords: common carrier
zbMATH Keywords: tabu search
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.09.009
OpenAlex ID: W2078141759
cites work: The prize collecting traveling salesman problem
cites work: A note on the prize collecting traveling salesman problem
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: Q3048611
cites work: A heuristic algorithm for the truckload and less-than-truckload problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: Q4354785
cites work: Q4955265
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
cites work: Parallel iterative search methods for vehicle routing problems
cites work: On Some Generalizations of the Travelling-Salesman Problem
DOI: 10.1016/J.EJOR.2008.09.009
description: scientific article; zbMATH DE number 5571308