A hybrid algorithm for the heterogeneous fleet vehicle routing problem
type: Item
instance of: scholarly article
title: A hybrid algorithm for the heterogeneous fleet vehicle routing problem
zbMATH Open document ID: 1253.90054
author: A. Subramanian
author: Puca Huachi Vaz Penna
author: Eduardo Uchoa
author: Luiz S. Ochi
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6119446
zbMATH Keywords: routing
zbMATH Keywords: heterogeneous fleet
zbMATH Keywords: matheuristics
zbMATH Keywords: iterated local search
zbMATH Keywords: set partitioning
describes a project that uses: BoneRoute
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.03.016
OpenAlex ID: W2154035658
cites work: A unified exact method for solving different classes of vehicle routing problems
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
cites work: A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
cites work: A column generation approach to the heterogeneous fleet vehicle routing problem
cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem
cites work: The fleet size and mix vehicle routing problem
cites work: Industrial aspects and literature survey: fleet composition and routing
cites work: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
cites work: A heuristic for vehicle fleet mix problem using tabu search and set partitioning
cites work: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
cites work: Q4452900
cites work: Variable neighborhood search
cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case
cites work: A sweep-based algorithm for the fleet size and mix vehicle routing problem
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: A heuristic column generation method for the heterogeneous fleet VRP
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
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: Formulations and valid inequalities for the heterogeneous vehicle routing problem
DOI: 10.1016/J.EJOR.2012.03.016
description: scientific article; zbMATH DE number 6119446