On solving the double loading problem using a modified particle swarm optimization

DOI10.1016/j.tcs.2015.05.037zbMath1329.68241OpenAlexW600150232MaRDI QIDQ496039

Takwa Tlili, Saoussen Krichen

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.037

zbMATH Keywords

metaheuristicsparticle swarm optimizationcompartmentalized knapsack problemdouble loading problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Bison

Cites Work

• Integrated distribution and loading planning via a compact metaheuristic algorithm
• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• A particle swarm optimizer for grouping problems
• The constrained compartmentalised knapsack problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• The one dimensional Compartmentalised Knapsack problem: a case study

This page was built for publication: On solving the double loading problem using a modified particle swarm optimization