Get in Touch

Course Outline

Introduction to Planner

  • Understanding OptaPlanner
  • Defining a planning problem
  • Use Cases and illustrative examples

Example: Bin Packaging Problem

  • Problem definition
  • Problem scale
  • Domain model diagram
  • Core method
  • Solver configuration
  • Domain model implementation
  • Score configuration

Travelling Salesman Problem (TSP)

  • Problem definition
  • Problem scale
  • Domain model
  • Core method
  • Chaining
  • Solver configuration
  • Domain model implementation
  • Score configuration

Planner configuration

  • Overview
  • Solver configuration
  • Modelling your planning problem
  • Utilizing the Solver

Score calculation

  • Score terminology
  • Selecting a Score definition
  • Computing the Score
  • Performance optimizations for score calculation
  • Reusing score calculation outside the Solver

Optimization algorithms

  • Real-world search space size
  • Does Planner guarantee an optimal solution?
  • Architecture overview
  • Overview of optimization algorithms
  • Choosing the appropriate optimization algorithm
  • SolverPhase
  • Scope overview
  • Termination strategies
  • SolverEventListener
  • Custom SolverPhase

Move and neighborhood selection

  • Introduction to Moves and neighborhoods
  • Generic Move Selectors
  • Combining multiple MoveSelectors
  • EntitySelector
  • ValueSelector
  • General Selector features
  • Custom moves

Construction heuristics

  • First Fit
  • Best Fit
  • Advanced Greedy Fit
  • The Cheapest insertion
  • Regret insertion

Local search

  • Local Search concepts
  • Hill Climbing (Simple Local Search)
  • Tabu Search
  • Simulated Annealing
  • Late Acceptance
  • Step counting hill climbing
  • Late Simulated Annealing (experimental)
  • Implementing custom Termination, MoveSelector, EntitySelector, ValueSelector, or Acceptor

Evolutionary algorithms

  • Evolutionary Strategies
  • Genetic Algorithms

Hyperheuristics

Exact methods

  • Brute Force
  • Depth-first Search

Benchmarking and tuning

  • Identifying the best Solver configuration
  • Conducting a benchmark
  • Benchmark report
  • Summary statistics
  • Statistics per dataset (graph and CSV)
  • Advanced benchmarking

Repeated planning

  • Introduction to repeated planning
  • Backup planning
  • Continuous planning (windowed planning)
  • Real-time planning (event-based planning)

Drools

  • Short introduction to Drools
  • Writing Score Function in Drools

Integration

  • Overview
  • Persistent storage
  • SOA and ESB
  • Other environments
 21 Hours

Number of participants


Price per participant

Testimonials (1)

Upcoming Courses

Related Categories