A heuristic manipulation technique for the sequential ordering problem

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

Luca Maria Gambardella, Roberto Montemanni, Derek H. Smith

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

schedulingant colony optimizationasymmetric travelling salesmanproblem manipulation techniques

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Constrained shortest path tour problem: branch-and-price algorithm ⋮ An improved ant colony system for the sequential ordering problem ⋮ Coupling ant colony systems with strong local searches ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ Precedence-constrained arborescences ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ A heuristic manipulation technique for the sequential ordering problem ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Heuristic manipulation, tabu search and frequency assignment ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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)