Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Ant-based load balancing in telecommunications networks
Adaptive Behavior
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Routing in telecommunications networks with ant-like agents
IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
The ant colony optimization meta-heuristic
New ideas in optimization
An ACO algorithm for the shortest common supersequence problem
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
An Ants heuristic for the frequency assignment problem
Future Generation Computer Systems
Computer-Aided Transit Scheduling: Proceedings, Lisbon, Portugal, July 1993
Computer-Aided Transit Scheduling: Proceedings, Lisbon, Portugal, July 1993
Tabu Search
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Study of Some Properties of Ant-Q
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows
MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Ants and reinforcement learning: a case study in routing in dynamic networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A memetic algorithm for routing in urban public transportation networks
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
| Hi-index | 0.00 |
MCACS-BRP, a new Ant Colony Optimization (ACO) based approach to solve the Bus Routing Problem is presented. MCACS is an extension of ACO, where two hierarchically connected casts of ants optimize two different objective functions. In MCACS-BRP, ants collaborate using information about the best results obtained in the particular cast. Experiments with real data from the Municipal Public Transport Union of the Upper Silesian Industrial District (KZK GOP) show that MCACS-BRP is worth further experiments and extensions.