Efficient heuristics for Median Cycle Problems

DOI10.1057/palgrave.jors.2601672zbMath1095.90019OpenAlexW2093935005MaRDI QIDQ4661131

Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

Publication date: 4 April 2005

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601672

zbMATH Keywords

evolutionary algorithmmedian cycle problemgreedy add heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (12)

MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ Metaheuristics and cooperative approaches for the bi-objective ring star problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Variable neighbourhood structures for cycle location problems ⋮ A survey of the standard location-routing problem ⋮ Modelling and solving central cycle problems with integer programming. ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Spatial coverage in routing and path planning problems ⋮ An efficient evolutionary algorithm for the ring star problem

Uses Software

• TSPLIB
• LKH

This page was built for publication: Efficient heuristics for Median Cycle Problems