A hybrid particle swarm optimization approach for the sequential ordering problem
From MaRDI portal
Publication:622165
DOI10.1016/j.cor.2010.10.014zbMath1208.90193OpenAlexW2014147547MaRDI QIDQ622165
Davide Anghinolfi, Massimo Paolucci, Roberto Montemanni, Luca Maria Gambardella
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.014
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
An improved ant colony system for the sequential ordering problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Coupling ant colony systems with strong local searches ⋮ An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
- 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
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Operations research at container terminals: a literature update
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- A sequential ordering problem in automotive paint shops
- Fast Algorithms for Geometric Traveling Salesman Problems
- 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)
This page was built for publication: A hybrid particle swarm optimization approach for the sequential ordering problem
