A heuristic manipulation technique for the sequential ordering problem

DOI10.1016/j.cor.2007.05.003zbMath1278.90168MaRDI QIDQ925838

Derek H. Smith, Roberto Montemanni, Luca Maria Gambardella

Publication date: 23 May 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.05.003

zbMATH Keywords

scheduling; ant colony optimization; asymmetric travelling salesman; problem manipulation techniques

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

A hybrid particle swarm optimization approach for the sequential ordering problem, A heuristic manipulation technique for the sequential ordering problem, Heuristic manipulation, tabu search and frequency assignment, Coupling ant colony systems with strong local searches, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Cites Work

• An efficient implementation of local search algorithms for constrained routing problems
• A heuristic manipulation technique for the sequential ordering problem
• An inexact algorithm for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• The precedence-constrained asymmetric traveling salesman polytope
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
• Unnamed Item
• Unnamed Item
• Unnamed Item