rapid_solve 0.1.7

This library provides a metaheuristic framework for solving combinatorial optimization problems.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

//! This module contains the [`Objective`] for the TSP.
use crate::objective::{BaseValue, Indicator, Objective};

use super::tsp_tour::TspTour;

struct DistanceIndicator;

impl Indicator<TspTour> for DistanceIndicator {
    fn evaluate(&self, tsp_tour: &TspTour) -> BaseValue {
        BaseValue::Float(tsp_tour.get_total_distance())
    }

    fn name(&self) -> String {
        String::from("TotalDistance")
    }
}

/// Builds the [`Objective`] for the TSP, which consists of a single [`Indicator`] for the total
/// distance of the tour.
pub fn build_tsp_objective() -> Objective<TspTour> {
    Objective::new_single_indicator(Box::new(DistanceIndicator))
}