PSO-based improved multi-flocks migrating birds optimization (IMFMBO) algorithm for solution of discrete problems
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
PSO-based improved multi-flocks migrating birds optimization (IMFMBO) algorithm for solution of discrete problems
Authors
Keywords
Migrating birds optimization, Traveling salesman problem, Particle swarm optimization, Multi-flocks
Journal
SOFT COMPUTING
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-04-18
DOI
10.1007/s00500-018-3199-5
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An improved fruit fly optimization algorithm for solving traveling salesman problem
- (2017) Lan Huang et al. Frontiers of Information Technology & Electronic Engineering
- An effective fruit fly optimization algorithm with hybrid information exchange and its applications
- (2017) Sheng-Xiang Lv et al. International Journal of Machine Learning and Cybernetics
- An Effective Hybrid Differential Evolution Algorithm Incorporating Simulated Annealing for Joint Replenishment and Delivery Problem with Trade Credit
- (2016) Yu-Rong Zeng et al. International Journal of Computational Intelligence Systems
- An effective and efficient fruit fly optimization algorithm with level probability policy and its applications
- (2016) Lin Wang et al. KNOWLEDGE-BASED SYSTEMS
- An Effective Hybrid Differential Evolution Algorithm Incorporating Simulated Annealing for Joint Replenishment and Delivery Problem with Trade Credit
- (2016) Yu-Rong Zeng et al. International Journal of Computational Intelligence Systems
- Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems
- (2015) Sadegh Niroomand et al. EXPERT SYSTEMS WITH APPLICATIONS
- Back propagation neural network with adaptive differential evolution algorithm for time series forecasting
- (2015) Lin Wang et al. EXPERT SYSTEMS WITH APPLICATIONS
- A discrete invasive weed optimization algorithm for solving traveling salesman problem
- (2015) Yongquan Zhou et al. NEUROCOMPUTING
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- (2014) Quan-Ke Pan et al. INFORMATION SCIENCES
- Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem
- (2014) Milan Tuba et al. International Journal of Computers Communications & Control
- A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
- (2013) Raúl Baños et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A hybrid meta-heuristic algorithm for optimization of crew scheduling
- (2012) A. Azadeh et al. APPLIED SOFT COMPUTING
- Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem
- (2012) Ekrem Duman et al. INFORMATION SCIENCES
- A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times
- (2012) F. Jolai et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem
- (2012) Mustafa Servet Kıran et al. NEURAL COMPUTING & APPLICATIONS
- Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
- (2011) Xiutang Geng et al. APPLIED SOFT COMPUTING
- Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem
- (2010) D. Karapetyan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem
- (2009) Zicheng Wang et al. Journal of Computational and Theoretical Nanoscience
- Three-dimension path planning for UCAV using hybrid meta-heuristic ACO-DE algorithm
- (2009) Haibin Duan et al. SIMULATION MODELLING PRACTICE AND THEORY
- Study of genetic algorithm with reinforcement learning to solve the TSP
- (2008) Fei Liu et al. EXPERT SYSTEMS WITH APPLICATIONS
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started