Avoid cloning insertion cost in evaluation logic

Cargo.toml

@@ -38,6 +38,7 @@ rand = { version = "0.8.5", features = ["small_rng"] }
 rayon = "1.10.0"
 rustc-hash = "2.0.0"
 paste = "1.0.15"
+lazy_static = "1.5.0"
 
 # dev dependencies
 criterion = "0.5.1"

experiments/heuristic-research/Cargo.toml

@@ -21,10 +21,10 @@ vrp-scientific.workspace = true
 
 serde.workspace = true
 serde_json.workspace = true
+lazy_static.workspace = true
 
 plotters = "0.3.7"
 plotters-canvas = "0.3.0"
 itertools = "0.13.0"
 wasm-bindgen = "0.2.93"
 web-sys = { version = "0.3.70", features = ["HtmlCanvasElement", "console"] }
-lazy_static = "1.5.0"

vrp-core/Cargo.toml

@@ -18,6 +18,7 @@ rand.workspace = true
 rayon.workspace = true
 rustc-hash.workspace = true
 paste.workspace = true
+lazy_static.workspace = true
 
 nohash-hasher = "0.2.0"
 tinyvec = { version = "1.8.0", features = ["alloc"] }

vrp-core/src/construction/heuristics/evaluators.rs

@@ -307,14 +307,14 @@ fn analyze_insertion_in_route_leg(
             }
 
             let costs = eval_ctx.goal.estimate(&move_ctx) + &route_costs;
-            let other_costs = single_ctx.cost.clone().unwrap_or_else(InsertionCost::max_value);
+            let other_costs = single_ctx.cost.as_ref().unwrap_or(InsertionCost::max_value());
 
-            match eval_ctx.result_selector.select_cost(&costs, &other_costs) {
+            match eval_ctx.result_selector.select_cost(&costs, other_costs) {
                 // found better insertion
                 Either::Left(_) => {
                     single_ctx.violation = None;
                     single_ctx.index = index;
-                    single_ctx.cost = Some(costs.clone());
+                    single_ctx.cost = Some(costs);
                     single_ctx.place = Some(target.place.clone());
                 }
                 Either::Right(_) => continue,

vrp-core/src/construction/heuristics/insertions.rs

@@ -7,6 +7,7 @@ use crate::models::common::Cost;
 use crate::models::problem::{Actor, Job, JobIdDimension};
 use crate::models::solution::Activity;
 use crate::models::ViolationCode;
+use lazy_static::lazy_static;
 use rosomaxa::prelude::*;
 use std::borrow::Borrow;
 use std::cmp::Ordering;
@@ -82,6 +83,10 @@ const COST_DIMENSION: usize = 6;
 /// A size of a cost array used by `InsertionCost`.
 type CostArray = [Cost; COST_DIMENSION];
 
+lazy_static! {
+    static ref MAX_INSERTION_COST: InsertionCost = InsertionCost::new(&[Cost::MAX]);
+}
+
 /// A lexicographical cost of job's insertion.
 #[derive(Clone, Default)]
 pub struct InsertionCost {
@@ -99,9 +104,9 @@ impl InsertionCost {
         self.data.iter().cloned()
     }
 
-    /// Returns highest* possible insertion cost.
-    pub fn max_value() -> Self {
-        Self::new(&[Cost::MAX])
+    /// Returns a reference to the highest possible insertion cost.
+    pub fn max_value() -> &'static Self {
+        &MAX_INSERTION_COST
     }
 }