A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
type: Item
instance of: scholarly article
title: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
zbMATH Open document ID: 1159.90525
author: Arif Imran
author: Said Salhi
author: Niaz A. Wassan
published in: European Journal of Operational Research
publication date: 2009-04-30T00:00:00Z
full work available at URL: Ejor-Arifetal final 3 Web Version.pdf
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5549989
zbMATH Keywords: meta-heuristic
zbMATH Keywords: routing
zbMATH Keywords: heterogeneous fleet
zbMATH Keywords: variable neighborhood
MaRDI profile type: Publication
OpenAlex ID: W2077736738
cites work: A column generation approach to the heterogeneous fleet vehicle routing problem
cites work: A new heuristic for the fleet size and mix vehicle routing problem
cites work: A note on two problems in connexion with graphs
cites work: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: The fleet size and mix vehicle routing problem
cites work: Variable Neighborhood Search
cites work: A heuristic for vehicle fleet mix problem using tabu search and set partitioning
cites work: The open vehicle routing problem: algorithms, large-scale test problems, and computational results
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: The fleet size and mix vehicle routing problem with time windows
cites work: Variable neighborhood search
cites work: A sweep-based algorithm for the fleet size and mix vehicle routing problem
cites work: An Improved Petal Heuristic for the Vehicle Routeing Problem
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Extensions of the Petal Method for Vehicle Routeing
cites work: Incorporating vehicle into the vehicle routing fleet composition problem
cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
cites work: A heuristic column generation method for the heterogeneous fleet VRP
cites work: A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
cites work: A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
cites work: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
cites work: The fleet size and mix problem for capacitated arc routing
cites work: Tabu search variants for the mix fleet vehicle routing problem
cites work: Formulations and valid inequalities for the heterogeneous vehicle routing problem
DOI: 10.1016/J.EJOR.2008.07.022
description: scientific article; zbMATH DE number 5549989