Crossover iterated local search for SDCARP

DOI10.1007/S40305-014-0056-9MaRDI QIDQ489138zbMATHOpenAlexFDO

Authors 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

iterated local searchmemetic algorithmcapacitated arc routing problemsplit-delivery

Mathematics Subject Classification ID

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

Recommendations

• A guided local search heuristic for the capacitated arc routing problem
• An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Competitive memetic algorithms for arc routing problems
• New upper bounds for the multi-depot capacitated arc routing problem

Cites work

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

Cited in

(2)

• An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489138)