A heuristic manipulation technique for the sequential ordering problem

DOI10.1016/J.COR.2007.05.003MaRDI QIDQ925838zbMATH OpenOpenAlexFDO

Authors Roberto Montemanni, Derek H. Smith, 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

ant colony optimizationasymmetric travelling salesmanproblem manipulation techniquesscheduling

Mathematics Subject Classification ID

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

Recommendations

• On the sequential ordering problems
• scientific article; zbMATH DE number 1538846
• An inexact algorithm for the sequential ordering problem
• A hybrid particle swarm optimization approach for the sequential ordering problem
• Local search procedures for improving feasible solutions to the sequential ordering problem

Cites work

• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
• A heuristic manipulation technique for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• An efficient implementation of local search algorithms for constrained routing problems
• An inexact algorithm for the sequential ordering problem
• scientific article; zbMATH DE number 2013522 (Why is no real title available?)
• scientific article; zbMATH DE number 2159167 (Why is no real title available?)
• scientific article; zbMATH DE number 870411 (Why is no real title available?)
• The precedence-constrained asymmetric traveling salesman polytope

Cited in

(17)

• Heuristic manipulation, tabu search and frequency assignment
• An improved ant colony system for the sequential ordering problem
• Subproblem ordering heuristics for AND/OR best-first search
• Coupling ant colony systems with strong local searches
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Constrained shortest path tour problem: branch-and-price algorithm
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
• On the sequential ordering problems
• Sequencing with ordered criteria, precedence and group technology constraints
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• Heuristic Methods for Selection and Ordering of Part-Orienting Devices
• scientific article; zbMATH DE number 1538846 (Why is no real title available?)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
• Precedence-constrained arborescences
• A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
• A hybrid particle swarm optimization approach for the sequential ordering problem
• A heuristic manipulation technique for the sequential ordering problem

This page was built for publication: A heuristic manipulation technique for the sequential ordering problem

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