An improved ant colony system for the sequential ordering problem

DOI10.1016/j.cor.2017.04.012zbMath1391.90534arXiv1705.01076OpenAlexW2609986762MaRDI QIDQ1652370

Rafał Skinderowicz

Publication date: 11 July 2018

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

Full work available at URL: https://arxiv.org/abs/1705.01076

zbMATH Keywords

combinatorial optimizationsimulated annealingant colony systemsequential ordering problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ The new treatment mode research of hepatitis B based on ant colony algorithm ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Uses Software

• TSPLIB
• SPLIB
• GPUBasedACS
• SOPLIB2006

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Load-dependent and precedence-based models for pickup and delivery problems
• A hybrid particle swarm optimization approach for the sequential ordering problem
• A heuristic manipulation technique for the sequential ordering problem
• An inexact algorithm for the sequential ordering problem
• Rough large deviation estimates for simulated annealing: Application to exponential schedules
• Simulated annealing: Practice versus theory
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• Coupling ant colony systems with strong local searches
• Hybrid ant systems for the dynamic facility layout problem
• A Friedman-Type Rank Test for Main Effects in a Two-Factor ANOVA
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• An Enhanced Ant Colony System for the Sequential Ordering Problem
• On extended formulations for the precedence constrained asymmetric traveling salesman problem
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: An improved ant colony system for the sequential ordering problem