Ant Colony System Algorithm With Dynamic Pheromone Updating for 0/1 Knapsack Problem

International Journal of Intelligent Systems and Applications - China
doi 10.5815/ijisa.2019.02.02
Full Text
Abstract

Available in full text

Date
Authors
Publisher

MECS Publisher

Related search

An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem

EasyChair Preprints
2018English

Hybrid Chaos-Based Particle Swarm Optimization-Ant Colony Optimization Algorithm With Asynchronous Pheromone Updating Strategy for Path Planning of Landfill Inspection Robots

International Journal of Advanced Robotic Systems
2019English

An Exact Approach for the 0–1 Knapsack Problem With Setups

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2017English

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2014English

Ant Colony System Algorithm for Optimal Network Reconfiguration

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2014English

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems
2010English

Ant Colony Algorithm for Solving the Multicast Routing Problem With QoS Constraints

2015English

Routing for Taxi-Pooling Problem Based on Ant Colony Optimization Algorithm

Revista de la Facultad de Ingenieria
EarthEngineeringPlanetary Sciences
2016English

Cloud Computing Task Scheduling Based on Pheromone Dynamic Adaptive Ant Colony Optimization

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy