Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems

DOI10.1016/j.ejor.2015.10.008zbMath1346.90146OpenAlexW2173985512MaRDI QIDQ322485

Ben A. Chaouch, Anand J. Kulkarni, Mohammed Fazle Baki

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.008

zbMATH Keywords

combinatorial problemsassignment problemcohort intelligencecross-border shipper selection problemsea-cargo mix problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ Pareto dominance based multiobjective cohort intelligence algorithm ⋮ An Improved Cohort Intelligence with Panoptic Learning Behavior for Solving Constrained Problems

Cites Work

• Model and algorithms for multi-period sea cargo mix problem
• An efficient constraint handling method for genetic algorithms
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
• A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization
• Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Cyclic Scheduling via Integer Programs with Circular Ones

This page was built for publication: Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems