Repository for the course Operations Research 2
-
Updated
Dec 30, 2021 - C
Repository for the course Operations Research 2
Research code for integrated railroad blocking: DG-CGM matheuristics, ARC/DW benchmarks, 190 instances, and reproducible experiments.
The Fix-and-Optimize applied to Home Health Care Routing and Scheduling Problem of Mankowska et al. (2014)
A list of Heuristics, Metaheuristics and Matheuristic algorithms for solve the TSP
Heuristic and matheuristic solvers for a linehaul next-hop optimization problem from an OR competition.
Data for the EVRPTW with Capacitated Public Stations and Multiple Recharging Technologies
MILP model (One-Commodity Flow) and heuristic algorithms for the Vehicle Routing Problem with Parcel Lockers, implemented in Python with Gurobi. Includes a matheuristic and a greedy Nearest Neighbor heuristic for last-mile delivery optimization.
A presentation on the paper Matheuristic Variants of DSATUR for the Vertex Coloring Problem by Dupin, 2024.
This collaborative repository contain the input files required by _irace_ for running automatic algorithm configuration of the cssartori/math-pdptw solver. For now, we are using the classical dataset from Li & Lim, available in SINTEF webpage.
Two-echelon inventory routing on real Olist e-commerce orders in Sao Paulo: MILP with Gurobi, ALNS and a matheuristic, compared with Wilcoxon tests
Exact and matheuristic methods for the Generalized Multiple Strip Packing Problem: combinatorial Benders decomposition (BendM), the LP-PC dual bound, and a certified ALNS matheuristic. Includes all instances and the per-instance results underlying the paper.
To associate your repository with the matheuristic topic, visit your repo's landing page and select "manage topics."