Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2019

Recent Advances in Computational Optimization gathers extended papers from the Workshop on Computational Optimization (WCO 2019), held within the Federated Conference on Computer Science and Information Systems. Edited by Stefka Fidanova, the volume appears in Springer’s Studies in Computational Intelligence series (volume 920) and focuses on optimization methods that can be applied when real-world problems resist tidy, textbook solutions.

Optimization When the Problem Refuses to Behave

Many engineering, economic, medical, and environmental tasks can be framed as optimization problems: minimizing time or cost, maximizing profit or quality, or finding a workable balance between competing constraints. The contributions here deal with objective functions and constraints that may be non-convex, non-differentiable, discontinuous, noisy, or dynamic—situations where classical numerical methods alone may struggle. The volume therefore brings metaheuristic and computational-intelligence approaches into the conversation: evolutionary computation, ant colony optimization, particle swarm optimization, bee colony optimization, constraint programming, and related techniques.

What the Workshop Volume Covers

The chapters move between methodological advances and applied case studies. Represented topics include:

• dam-break flood risk mapping and validation using field test cases in Armenia;
• a fire-spread simulator designed for real-time analysis with limited weather data, illustrated through the 2017 Kresna fire;
• minimum set-cover structures for knowledge discovery in large literature databases;
• optimal charging-station location for electric vehicles, with an Italian case study;
• InterCriteria analysis of evaporation parameters in ant colony optimization for workforce planning;
• caterpillar alignment distance for rooted labeled caterpillars;
• InterCriteria analysis over ordered pairs applied to artificial bee colony optimization results;
• a game-theoretical approach to VLSI physical design; and
• online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing.

Together, these papers show how optimization research travels from abstract formulations into flood planning, fire response, electric mobility, workforce scheduling, biological and chemical process modeling, VLSI design, and algorithm design.

Why These Methods Matter

Real-world optimization rarely arrives with a smooth curve and an easy derivative. The work collected here reflects that reality, emphasizing algorithms that can search large or irregular solution spaces, adapt to uncertain data, and still return useful decisions. For readers interested in computational intelligence, the volume offers both specific applications and broader examples of how metaheuristics are tuned, compared, and combined with other methods.

Who Will Find It Useful

This is a research-oriented volume suited to graduate students, academics, and practitioners in computational optimization, operations research, applied mathematics, computer science, and engineering. It may be especially relevant to readers working on environmental risk modeling, logistics and planning, energy systems, metaheuristic algorithm design, or interdisciplinary applications where optimization is the common language.

An Edited Collection from WCO 2019

Because the book collects extended contributions from a focused workshop, it works well as a snapshot of active research directions rather than a single-author textbook. The mix of theory, algorithm design, and case studies makes it a useful reference for anyone following recent developments in computational optimization and computational intelligence.