A collection of problem abstractions and solver implementations for arc-routing problems

Metaheuristics for Logistics Problems # BPP (CONTAINER LOADING PROBLEM) & VRP (VEHICLE ROUTING PROBLEM) Problems resolved with HillClimbing, Tabu, Greedy, Grasp, and Simulated anneling metaheuristics

An implementation of the ALNS metaheuristic algorithm to solve an instance of the Clustered Team Orienteering Problem with Services Sequence, made with Java and Gurobi.

Java implementation for Benders Decomposition

Repository for the implementation of a solution to the Capacitated Arc Routing Problem with Turn constraints, multiple curbs and limited capacity vehicles.

This repository includes a logic-based Benders Decomposition implementation using CPLEX (java based)

Label setting algorithm and nearest neighbor search are used to implement the vehicle routing problem with simultaneous pickup and drop(VRPSPD)

Modified GRASP Heuristic written in Java aimed to optimize routing for rescue teams

Solving simplified Chinese postman problem by exact and heuristic algorithms and comparison these methods.

This repository contains a Java implementation of the Uncertain Capacitated Arc Routing Problem environment. Several solution methods are implemented, most revolving around the Genetic Programming …

Team Orienteering Problem using GRASP with Path Relinking and ILS for up to 4 routes

Using Pre-Flow Push algorithm and Cost Scaling algorithm to solve Chinese Postman problem