This page is for an old version of Hexaly Optimizer. We recommend that you update your version and read the documentation for the latest stable release.

Example tour¶

For all the optimization problems below you will find the corresponding Hexaly models in LSP, Python, C++, C# and Java. The number of stars represents the complexity of each example. You can use the filter buttons to see the examples related to each type of optimization problem. Feel free to contact us if you encounter any difficulty with these examples or with the modeling of your optimization problems.

All
Vehicle Routing
Production Scheduling
Workforce Scheduling
Supply Chain Network Design
Packing
Nonlinear Optimization
Simulation Optimization

../_images/toy.svg — Toy ¶

../_images/knapsack.svg — Knapsack ¶

../_images/curvefitting.svg — Curve Fitting ¶

../_images/facilitylocation.svg — Facility Location (FLP) ¶

../_images/smallest_circle.svg — Smallest Circle ¶

../_images/tsp.svg — Traveling Salesman (TSP) ¶

../_images/branin.svg — Branin Function ¶

../_images/maxcut.svg — Max Cut ¶

../_images/hosaki_blackbox.svg — Hosaki Function ¶

../_images/order-picking.svg — Order Picking ¶

../_images/car_seq.svg — Car Sequencing ¶

../_images/car_seq_color.svg — Car Sequencing Color ¶

../_images/golfer.svg — Social Golfer ¶

../_images/steel_mill.svg — Steel Mill Slab Design ¶

../_images/binpacking.svg — Bin Packing (BPP) ¶

../_images/capacitatedfacilitylocation.svg — Capacitated Facility Location (CFLP) ¶

../_images/bucket.svg — Optimal Bucket ¶

../_images/portfolio.svg — Portfolio Selection Optimization Problem ¶

../_images/vrp.svg — Capacitated Vehicle Routing (CVRP) ¶

../_images/capacitatedarcrouting.svg — Capacitated Arc Routing (CARP) ¶

../_images/kmeans.svg — K-Means Clustering (MSSC) ¶

../_images/qap.svg — Quadratic Assignment (QAP) ¶

../_images/assembly_line_balancing.svg — Assembly Line Balancing (SALBP) ¶

../_images/flowshop.svg — Flow Shop ¶

../_images/jobshop.svg — Job Shop (JSP) ¶

../_images/jobshop_intensity.svg — Job Shop with Intensity ¶

../_images/fjsp.svg — Flexible Job Shop (FJSP) ¶

../_images/fjsp_setup.svg — Flexible Job Shop with Setup Times ¶

../_images/fjsp_changeover.svg — Flexible Job Shop with Machine-Dependent Changeover Times ¶

../_images/openshop-scheduling-problem.svg — Open Shop ¶

../_images/stochastic_packing.svg — Stochastic Packing ¶

../_images/stochastic_jobshop.svg — Stochastic Job Shop Scheduling Problem ¶

../_images/rcpsp.svg — Resource Constrained Project Scheduling Problem ¶

../_images/prcpsp.svg — Preemptive Resource Constrained Project Scheduling Problem ¶

../_images/flexible_cumulative.svg — Flexible Resource Constrained Project Scheduling Problem ¶

../_images/reservoir_rcpsp.svg — Project Scheduling with Production and Consumption of Resources ¶

../_images/vrptw.svg — Vehicle Routing with Time Windows (CVRPTW) ¶

../_images/pdp.svg — Pickup and Delivery with Time Windows (PDPTW) ¶

../_images/clustered-vehicle-routing-problem-cluvrp.svg — Clustered Vehicle Routing (cluVRP) ¶

../_images/irp.svg — Inventory Routing (IRP) ¶

../_images/sdvrp.svg — Split Delivery Vehicle Routing (SDVRP) ¶

../_images/tdcvrptw.svg — Time Dependent Capacitated Vehicle Routing Problem with Time Windows (TDCVRPTW) ¶

../_images/multiple-trip-vehicle-routing-problem.svg — Multi Trip Capacitated Vehicle Routing Problem (MTCVRP) ¶

../_images/multi-depot-vehicle-routing-problem-mdvrp.svg — Multi Depot Vehicle Routing Problem (MDVRP) ¶

../_images/location-routing-problem-lrp.svg — Location Routing Problem (LRP) ¶

../_images/pccvrp.svg — Prize Collecting Vehicle Routing Problem (PCVRP) ¶

../_images/vrpb.svg — Vehicle Routing Backhauls (VRPB) ¶

../_images/aircraft_landing.svg — Aircraft Landing ¶

../_images/movie_shoot_scheduling.svg — Movie Shoot Scheduling ¶

../_images/revenue_management_bb.svg — Revenue Management ¶

../_images/pooling.svg — Pooling ¶

../_images/cantilevered_beam.svg — Cantilevered Beam ¶