A unified heuristic for a large class of vehicle routing problems with backhauls
type: Item
instance of: scholarly article
title: A unified heuristic for a large class of vehicle routing problems with backhauls
zbMATH Open document ID: 1116.90019
author: S. Ropke
author: David Pisinger
published in: European Journal of Operational Research
publication date: 2006-03-22T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5014252
zbMATH Keywords: metaheuristics
zbMATH Keywords: vehicle routing problems
zbMATH Keywords: large neighborhood search
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2166484956
Wikidata QID: Q58826442
cites work: A survey of very large-scale neighborhood search techniques
cites work: Q3151784
cites work: The vehicle-routing problem with delivery and back-haul options
cites work: The Reactive Tabu Search
cites work: Q4039765
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Q4532231
cites work: Q4656782
cites work: Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
cites work: A new branching strategy for time constrained routing problems with application to backhauling
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: The vehicle routing problem with backhauls
cites work: Q4495203
cites work: Q4365130
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: An exact method for the vehicle routing problem with backhauls
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
cites work: Record breaking optimization results using the ruin and recreate principle
cites work: The single‐vehicle routing problem with unrestricted backhauls
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Heuristic approaches to vehicle routing with backhauls and time windows
cites work: An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
cites work: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
cites work: An Exact Algorithm for the Vehicle Routing Problem with Backhauls
cites work: Q4532230
DBLP publication ID: journals/eor/RopkeP06
DOI: 10.1016/J.EJOR.2004.09.004
description: scientific article; zbMATH DE number 5014252