项目作者: AntoinePassemiers

项目描述 :
Heuristic Solver for the Multidimensional Knapsack Problem
高级语言: C
项目地址: git://github.com/AntoinePassemiers/MKP.git
创建时间: 2018-06-18T15:09:23Z
项目社区:https://github.com/AntoinePassemiers/MKP

开源协议:GNU General Public License v3.0

下载


How to use MKP heuristic solver

Compile the program:

  1. $ make release
  2. $ make clean

Each call to the heuristic solver must be of the form:

  1. $ mkp <path_to_instance> <random|greedy|toyoda|ga|sa> \
  2. [--max-time value] [--fi|--bi|--vnd] [--seed value] [--terse]

If no seed is provided, current time is used as seed to the RNG.
—terse is an optional argument for helping the R script to
accelerate the parsing of standard output by displaying only necessary
information. Mind it only if you wish to hide the objective, constraints,
selected items and discarded items in the output messages.
Let’s explicit how to call each one of the twelve algorithms:

  1. $ # Genetic algorithm
  2. $ mkp <path_to_instance> ga
  3. $ # Simulated annealing
  4. $ mkp <path_to_instance> sa
  5. $ # Set time limit to 60 seconds
  6. $ mkp <path_to_instance> <random|greedy|toyoda|ga|sa> --max-time 60