Skip to content

GabrielCFormiga/minimum-latency-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Minimum Latency Problem (MLP)

This repository contains a heuristic solver for the Minimum Latency Problem (MLP) implemented in C++17 and built with the Meson Build System.

The solution approach combines the metaheuristics GRASP, ILS, and RVND.

Results

TODO

  • Instance parser
  • Feasibility check
  • Constructive procedure
  • Local search
  • Perturbation
  • Methaheuristic

Methaheuristics

  • GILS (GRASP Iterated Local Search)

Constructive procedure

  • Randomized Greedy Construction

Local search

  • RVND (Randomized Variable Neighborhood Search)

Neighborhood

  • SWAP
  • 2-OPT
  • OR-OPT

Perturbation

  • DOUBLE-BRIDGE:

Getting started

Prerequisites

How to build the project

  1. Setup release and debug builds:
meson setup build --buildtype=release
meson setup build_debug --buildtype=debug
  1. Compile build:
meson compile -C <build or build_debug>
  1. Run:

From the root directory:

./<build or build_debug>/src/asp <instance file path>

About

Heuristic solver for the Minimum Latency Problem (MLP) implemented in C++17 and built with the Meson Build System. The solution approach combines the metaheuristics GRASP, ILS, and RVND

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors