Crossover iterated local search for SDCARP

DOI10.1007/S40305-014-0056-9zbMath1306.90029OpenAlexW1977370146MaRDI QIDQ489138

An-Yang Liang, Dan Lin

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0056-9

zbMATH Keywords

memetic algorithmiterated local searchcapacitated arc routing problemsplit-delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• An improved heuristic for the capacitated arc routing problem
• The fleet size and mix problem for capacitated arc routing
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• A scatter search for the periodic capacitated arc routing problem
• Split delivery routing
• An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
• Savings by Split Delivery Routing
• Capacitated arc routing problems
• Split-delivery routeing heuristics in livestock feed distribution
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots

This page was built for publication: Crossover iterated local search for SDCARP