Water Sports

Combinatorial optimization problems arise across logistics, scheduling, and engineering, and C++ remains a language of choice when performance matters. This lecture takes a practical look at solving such problems in C++, using the Electric Vehicle Routing Problem as a running example. We begin with an exact solver, formulating the problem as a mixed-integer program and trying to solve it through GLPK's C API directly from C++. Exact methods, however, quickly hit their limits on real-world instances. The second half of the talk turns to metaheuristics: how they are designed, why C++ is particularly well suited for implementing them, and what design choices matter most in practice. We'll walk through a concrete implementation, touching on data structures for fast neighborhood evaluation, generic algorithm design with templates, and the performance considerations that separate a prototype from a production-ready solver. The goal is not to advocate for one approach over another, but to show how C++ supports the full spectrum of optimization techniques.

Combinatorial optimization problems arise across logistics, scheduling, and engineering, and C++ remains a language of choice when performance matters. This lecture takes a practical look at solving such problems in C++, using the Electric Vehicle Routing Problem as a running example. We begin with an exact solver, formulating the problem as a mixed-integer program and trying to solve it through GLPK's C API directly from C++. Exact methods, however, quickly hit their limits on real-world instances. The second half of the talk turns to metaheuristics: how they are designed, why C++ is particularly well suited for implementing them, and what design choices matter most in practice. We'll walk through a concrete implementation, touching on data structures for fast neighborhood evaluation, generic algorithm design with templates, and the performance considerations that separate a prototype from a production-ready solver. The goal is not to advocate for one approach over another, but to show how C++ supports the full spectrum of optimization techniques.

**Weather permitting**, we’ll take a casual ride from Pickerington Ponds (Glacier Knoll) to Three Creeks and back. Distance is **18–25 miles**, depending on where we turn around and whether we add a side loop. Pace is around **12 mph**, but this is a fun, no‑drop ride — we can slow down as needed. Here’s the **map** showing Glacier Knoll (bike), Confluence Park (flag), and BrewDog: [https://www.google.com/maps/d/edit..](https://www.google.com/maps/d/edit..). Text or call Scott at **614‑975‑4458** if you’re coming. Columbus ski club membership not required for this event. CSC assumes no responsibility for the event or any injuries as this is organized by a third party.

**Weather permitting**, we’ll take a casual ride from Pickerington Ponds (Glacier Knoll) to Three Creeks and back. Distance is **18–25 miles**, depending on where we turn around and whether we add a side loop. Pace is around **12 mph**, but this is a fun, no‑drop ride — we can slow down as needed. Here’s the **map** showing Glacier Knoll (bike), Confluence Park (flag), and BrewDog: [https://www.google.com/maps/d/edit..](https://www.google.com/maps/d/edit..). Text or call Scott at **614‑975‑4458** if you’re coming. Columbus ski club membership not required for this event. CSC assumes no responsibility for the event or any injuries as this is organized by a third party.