A modified ant colony system for solving the travelling salesman problem with time windows

DOI10.1016/J.MCM.2006.11.035MaRDI QIDQ2472698zbMATH OpenOpenAlexFDO

Authors Chun-Pin Mao, Chi-Bin Cheng

Publication date 22 February 2008

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2006.11.035

zbMATH Keywords

ant colony optimization (ACO)meta-heuristicnature-inspired algorithmtravelling salesman problem with time windows (TSPTW)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An ant colony system approach for variants of the traveling salesman problem with time windows
• A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
• Beam-ACO for the travelling salesman problem with time windows
• Study on the ant colony algorithm for solving the vehicle routing problem with time windows
• An ant colony algorithm for time-dependent vehicle routing problem with time windows

Cites work

• A generalized insertion heuristic for the travelling salesman problem with time windows
• A new rank based version of the ant system. -- A computational study
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An aggregated clustering approach using multi-ant colonies algorithms
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• An ant colony system for permutation flow-shop sequencing
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• An improved ant system algorithm for the vehicle routing problem
• Ant colonies for the quadratic assignment problem
• Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
• Ants can colour graphs
• Application of ant \(K\)-means on clustering analysis
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• scientific article; zbMATH DE number 1249654 (Why is no real title available?)
• scientific article; zbMATH DE number 710069 (Why is no real title available?)
• Parallel Ant Colonies for the quadratic assignment problem
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search

Cited in

(7)

• A new solution algorithm for improving performance of ant colony optimization
• A new ant colony optimization algorithm for the lower bound of sum coloring problem
• A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
• A pseudo parallel ant algorithm with an adaptive migration controller
• Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
• An ant colony system approach for variants of the traveling salesman problem with time windows
• A variable iterated greedy algorithm for the traveling salesman problem with time windows

Describes a project that uses

Uses Software

• Beam-ACO
• MACS-VRPTW
• HAS-QAP
• AntNet

This page was built for publication: A modified ant colony system for solving the travelling salesman problem with time windows

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