Crossover iterated local search for SDCARP
type: Item
instance of: scholarly article
title: Crossover iterated local search for SDCARP
zbMATH Open document ID: 1306.90029
author: An-Yang Liang
author: Dan Lin
published in: Journal of the Operations Research Society of China
publication date: 2015-01-27T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6391362
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: split-delivery
zbMATH Keywords: memetic algorithm
zbMATH Keywords: iterated local search
MaRDI profile type: Publication
full work available at URL: s40305-014-0056-9
OpenAlex ID: W1977370146
cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: A scatter search for the periodic capacitated arc routing problem
cites work: Q4510100
cites work: Savings by Split Delivery Routing
cites work: Split delivery routing
cites work: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
cites work: Capacitated arc routing problems
cites work: Split-delivery routeing heuristics in livestock feed distribution
cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: Competitive memetic algorithms for arc routing problems
cites work: A genetic algorithm for a bi-objective capacitated arc routing problem
cites work: An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
cites work: Q4452900
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: An improved heuristic for the capacitated arc routing problem
cites work: The fleet size and mix problem for capacitated arc routing
DOI: 10.1007/S40305-014-0056-9
description: scientific article; zbMATH DE number 6391362