A two-phase algorithm for the partial accessibility constrained vehicle routing problem
type: Item
instance of: scholarly article
title: A two-phase algorithm for the partial accessibility constrained vehicle routing problem
zbMATH Open document ID: 0845.90045
DOI: 10.1007/BF02098281
author: F. Semet
published in: Annals of Operations Research
publication date: 1996-09-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 847655
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: partial accessibility constrained vehicle routing
zbMATH Keywords: two-phase heuristic
MaRDI profile type: Publication
cites work: A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q3993418
cites work: A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
cites work: Solving real-life vehicle routing problems efficiently using tabu search
description: scientific article; zbMATH DE number 847655