Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
type: Item
instance of: scholarly article
title: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
zbMATH Open document ID: 1173.90411
author: V. Schmid
author: K. F. Doerner
author: Richard F. Hartl
author: Juan-José Salazar-González
published in: Computers \& Operations Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5634683
zbMATH Keywords: hybrid
zbMATH Keywords: ready-mixed concrete
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: capacitated vehicle routing problem
zbMATH Keywords: very large neighborhood search
Wikidata QID: Q59389671
MaRDI profile type: Publication
full work available at URL: j.cor.2008.07.010
OpenAlex ID: W2076633572
cites work: Towards a decision support system for the ready concrete distribution system: a case of a Greek company.
cites work: Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete
cites work: Analysis, modeling and solution of the concrete delivery problem
cites work: OR PRACTICE—The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment
cites work: Handbook of metaheuristics
cites work: Variable neighborhood search
cites work: Variable neighborhood search: Principles and applications
cites work: A survey of very large-scale neighborhood search techniques
cites work: An Overview on the Split Delivery Vehicle Routing Problem
cites work: Q5472387
cites work: Q4365134
cites work: Q4365135
cites work: Local branching
cites work: Variable neighborhood search and local branching
cites work: A variable neighborhood search heuristic for periodic routing problems
DOI: 10.1016/J.COR.2008.07.010
description: scientific article; zbMATH DE number 5634683