[NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution

This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with a specific objective function

Algorithms for the Orienteering Problem

[AAAI-25] HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs

In this project 8 approaches presented for solving OP.

Orienteering Problem solution checker

FOPS - framework for orienteering problem solving

Efficient Solutions for the Orienteering Problem: A Comparative Study of Dynamic Programming and Floyd-Warshall Algorithms

Orienteering Problem with Time Windows

This project implements a graph algorithm provinding a suboptimal solution to the knapsak problem in a geographical context. The decisions are driven by the maximization of a regional score. The node with the best regional score is selected as the next node to visit. The algorithms process recursively to find the K Best Nodes (KBN) to visit.

A Mixed-Integer Linear Programming (MILP) approach to solve the Multi-Modal Orienteering Problem with Time Windows (OPTW) for holiday itinerary planning.

The Categorized Orienteering Problem with Count-Dependent Profits (COPCDP)

Code reproducing the numerical simulations of the paper "Optimization Methods for a Shuttle Bus Routing Problem arising in Urban Mobility"

USI-MSc AI Course: Hands-on Lab Experiences

Este repositório contém uma implementação do Team Orieteering Problem (TOP) utilizando o CPLEX.

Repository per il progetto d'esame di AOCR (UNINA).

Plan trips around live events: track artist/comedy/sports tour dates via Bandsintown, map them, and organise no-payment group trips. Single-file Streamlit prototype - a preference-weighted optimiser and its eval are roadmap, not yet built.

In-browser optimizer for multi-day sightseeing itineraries — solves the Team Orienteering Problem with Time Windows (TOPTW) with greedy insertion + ILS and O(1) Wait–MaxShift feasibility. 浏览器内多日行程最优排程,求解带时间窗的团队定向问题(TOPTW)。

A re-implementation of all orienteering solvers studied in my thesis

Desenvolvi um algoritmo de Programação Linear Inteira (ILP) para otimizar rotas da Polícia Militar de Alagoas, reduzindo tempos de resposta e cobrindo áreas vulneráveis. Com análise de dados geográficos e históricos, usei teoria dos grafos e feedback de profissionais para criar patrulhas ágeis e estratégicas.