Get in Touch

Course Outline

Planner Introduction

  • What is OptaPlanner?
  • Understanding planning problems
  • Use cases and examples

Bin Packaging Problem Example

  • Problem statement
  • Problem size
  • Domain model diagram
  • Main method
  • Solver configuration
  • Domain model implementation
  • Score configuration

Travelling Salesman Problem (TSP)

  • Problem statement
  • Problem size
  • Domain model
  • Main method
  • Chaining
  • Solver configuration
  • Domain model implementation
  • Score configuration

Planner Configuration

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

Score Calculation

  • Score terminology
  • Selecting a Score definition
  • Calculating the Score
  • Performance optimization techniques for Score calculation
  • Reusing Score calculation outside the Solver

Optimization Algorithms

  • Real-world search space size
  • Does Planner find the optimal solution?
  • Architecture overview
  • Optimization algorithms overview
  • Selecting the right optimization algorithms
  • SolverPhase
  • Scope overview
  • Termination
  • 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)
  • Using custom Termination, MoveSelector, EntitySelector, ValueSelector, or Acceptor

Evolutionary Algorithms

  • Evolutionary Strategies
  • Genetic Algorithms

Hyperheuristics

Exact Methods

  • Brute Force
  • Depth-first Search

Benchmarking and Tweaking

  • Finding 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