WINGS ICT logo
WINGS ICT

ai / optimization engineer

Sep 8, 2026 · WINGS ICT

Αθήνα·Sep 8, 2026
ΑθήναOn SiteΠληροφορικήPermanentFull Time
JOBILY AI SUMMARY

What you'll do

  • Use Artificial Intelligence techniques and advanced optimization and heuristic algorithms
  • Design and develop new optimization models and heuristic algorithms for multiple industrial domains
  • Integrate optimization models into the production pipeline of solutions
  • Analyze datasets to identify patterns, constraints, and optimization opportunities
  • Extract and present actionable insights from optimization results
  • Work as part of a growing team and operate independently
  • Resolve complex problems and gain expertise in state-of-the-art optimization technologies

Key requirements

  • 3+ years' experience
  • Python and associated libraries NumPy, SciPy, OR-Tools
  • Optimization Techniques including linear and non-linear programming and combinatorial optimization
  • Heuristic Algorithms and Metaheuristic Methods such as Genetic Algorithms and Simulated Annealing
  • Data Preprocessing and Constraint Modeling
  • Model Tuning and Performance Evaluation
  • Electrical and Computer Engineering / Electronic Engineering / Computer Science / Any Field

Benefits

  • Highly competitive salary, reviewed upwards on a regular basis, based on remuneration according to experience and skills.
  • Participation in state-of-the-art and large-scale projects.
  • Personal and professional development, amongst industry experts.

About the job

WINGS is looking for an enthusiastic AI/ Optimization Engineer with experience in Heuristic Algorithms and Optimization Techniques to join its product expansion internationally and locally.

Τhe successful candidate will be:

  • Using Artificial Intelligence techniques and advanced optimization / heuristic algorithms

  • Design and develop new optimization models and heuristic algorithms for multiple industrial domains

  • Integrate optimization models into the production pipeline of our solutions

  • Analyze datasets to identify patterns, constraints, and optimization opportunities

  • Extract and present actionable insights from optimization results

  • Working as part of a growing team while being able to operate independently

  • Resolving interesting problems and gaining expertise in state-of-the-art optimization technologies

Educational Requirements

  • Candidates must have a Bachelor’s degree in Electrical & Computer Engineering / Electronic Engineering, Computer Science or other relevant field.
    Master’s degree in those areas will be considered as a plus.

Qualifications

  • 3+ years of proven working experience in a similar role as an AI / Optimization Engineer

  • Hands-on experience in optimization and heuristic-based projects
    Excellent knowledge of Python and relevant libraries (e.g., NumPy, SciPy, OR-Tools)

  • Strong understanding of optimization techniques (linear/non-linear programming, combinatorial optimization)

  • Experience with heuristic and metaheuristic methods (e.g., Genetic Algorithms, Simulated Annealing, Tabu Search)

  • Experience in data probing, preprocessing, and constraint modeling

  • Skills in model tuning, performance evaluation, and solution quality analysis

Other Qualifications

  • Excellent verbal and written communication skills in English

  • Native or Fluent in Greek, both spoken and written

  • Initiative, strong sense of accountability and ownership of actions

  • Effective time management & prioritization, able to work according to plans and methodologies

  • Agility, enthusiasm, and self-motivation

Benefits:

  • Highly competitive salary, reviewed upwards on a regular basis, based on

  • Remuneration based on your experience and skills

  • Participation in state-of-the-art and large-scale projects

  • Personal and professional development, amongst industry experts

  • Continuous learning

  • Modern workspace, at a very good location

Workplace
On Site
Sector
Πληροφορική
Employment Type
Permanent
Work Time
Full Time

About the company