A heuristic manipulation technique for the sequential ordering problem

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Computers & Operations Research

• Publication date

  2008-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2007.05.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ant Colony Systems for Large Sequential Ordering Problems

  2007cited by this paper
• Automatically generated lower bounds for search

  2004cited by this paper
• Solving the Sequential Ordering Problem with Automatically Generated Lower Bounds

  2004cited by this paper
• A cooperative parallel rollout algorithm for the sequential ordering problem

  2003cited by this paper
• A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem

  2003cited by this paper
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

  2000influential reference
• Ant Algorithms for Discrete Optimization

  1999cited by this paper
• Ant colony system: a cooperative learning approach to the traveling salesman problem

  1997influential reference
• Hamiltonian path problems in the on-line optimization of flexible manufacturing systems

  1996cited by this paper
• Commonality and Genetic Algorithms

  1996cited by this paper
• The precedence-constrained asymmetric traveling salesman polytope

  1995cited by this paper
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

  1994cited by this paper
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)

  1993cited by this paper
• Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design

  1992cited by this paper
• An efficient implementation of local search algorithms for constrained routing problems

  1990cited by this paper
• An inexact algorithm for the sequential ordering problem

  1988cited by this paper

• Towards Efficient Constraint Handling in Neural Solvers for Routing Problems

  2026influential citation
• Automated reinforcement learning for sequential ordering problem using hyperparameter optimization and metalearning

  2025cites this paper
• Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem

  2023cites this paper
• A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem

  2023cites this paper
• Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times

  2023cites this paper
• Precedence-Constrained arborescences

  2022influential citation
• Graph transformations for register-pressure-aware instruction scheduling

  2022cites this paper
• A parallel branch-and-bound algorithm with history-based domination

  2022cites this paper
• A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem

  2022cites this paper
• Constrained shortest path tour problem: Branch-and-Price algorithm

  2022cites this paper
• Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach

  2021cites this paper
• Task Sequence Planning Algorithm for Cooperative Assembly of Dual-arm Robot

  2021cites this paper
• A Mixed Integer Linear Program for a Precedence-Constrained Minimum-Cost Arborescence Problem

  2021cites this paper
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

  2020cites this paper
• Robot scheduling for pod retrieval in a robotic mobile fulfillment system

  2020cites this paper
• Tuning of reinforcement learning parameters applied to SOP using the Scott–Knott method

  2019cites this paper
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization

  2019cites this paper
• A Critical Review of Multi-hole Drilling Path Optimization

  2019cites this paper
• A Critical Review of Multi-hole Drilling Path Optimization

  2018cites this paper
• An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report

  2017cites this paper
• Solving the sequential ordering problem using branch and bound

  2017cites this paper
• An improved Ant Colony System for the Sequential Ordering Problem

  2017influential citation
• Memory Access Optimization for Computations on Unstructured Meshes

  2016cites this paper
• Naïve Bayes ant colony optimization for designing high dimensional experiments

  2016cites this paper
• Robot trajectory optimization for relaxed effective tasks

  2015cites this paper
• Coupling Ant Colony System with Local Search

  2015cites this paper
• Robotic Task Sequencing Problem: A Survey

  2015influential citation
• A comparison of two exact algorithms for the sequential ordering problem

  2015influential citation
• ALGORYTM HYBRYDOWY WIELOKROTNEGO STARTU DLA ROZWIĄZYWANIA PROBLEMU SEKWENCYJNEGO UPORZĄDKOWANIA

  2014cites this paper
• An extended EigenAnt colony system applied to the sequential ordering problem

  2014cites this paper
• A bee colony optimization with automated parameter tuning for sequential ordering problem

  2014influential citation
• A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem

  2014cites this paper
• A multistart hybrid algorithm to solving the sequential ordering problem

  2014cites this paper
• A decomposition-based exact approach for the sequential ordering problem

  2013cites this paper
• Ant Colony Optimization approaches for theSequential Ordering Problem

  2013cites this paper
• Ant Colony Optimization approaches for the Sequential Ordering Problem

  2013cites this paper
• A less exploitative variation of the Enhanced Ant Colony System applied to SOP

  2013cites this paper
• Ant Colony System with Selective Pheromone Memory for SOP

  2013cites this paper
• Coupling ant colony systems with strong local searches

  2012cites this paper
• Memory access optimization for computations on unstructured meshes

  2012cites this paper
• An Enhanced Ant Colony System for the Sequential Ordering Problem

  2011cites this paper
• Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

  2011cites this paper
• A hybrid particle swarm optimization approach for the sequential ordering problem

  2011cites this paper
• Heuristic manipulation, tabu search and frequency assignment

  2010cites this paper
• Sequential ordering problems for crane scheduling in port terminals

  2010influential citation
• Algorithmique rapide pour les problèmes de tournées et d'ordonnancement. (Time-salving algorithms for vehicule routing and scheduling problems)

  2010cites this paper
• Tree based heuristics for the preemptive asymmetric stacker crane problem

  2010cites this paper
• Natural Computation for the Traveling Salesman Problem

  2009cites this paper