.. _program_listing_file_src_local_search_inter_intra.cpp:

Program Listing for File local_search_inter_intra.cpp
=====================================================

|exhale_lsh| :ref:`Return to documentation for file <file_src_local_search_inter_intra.cpp>` (``src/local_search_inter_intra.cpp``)

.. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS

.. code-block:: cpp

   
   #include "cvrp/local_search_inter_intra.hpp"
   
   #include <iostream>
   #include <limits>
   #include <numeric>
   
   constexpr double margin_of_error = 0.00001;
   
   LocalSearchInterIntraSolution::LocalSearchInterIntraSolution(
       const std::vector<Node> &nodes, const std::vector<Vehicle> &vehicles,
       const std::vector<std::vector<double>> &distanceMatrix)
       : Solution(nodes, vehicles, distanceMatrix) {
     CreateInitialSolution();
   }
   
   LocalSearchInterIntraSolution::LocalSearchInterIntraSolution(const Problem &p)
       : Solution(p.nodes_, p.vehicles_, p.distanceMatrix_) {
     CreateInitialSolution();
   }
   
   LocalSearchInterIntraSolution::LocalSearchInterIntraSolution(const Solution &s)
       : Solution(s) {
     if (!s.CheckSolutionValid()) {
       std::cout << "The input solution is invalid. Exiting." << '\n';
       exit(0);
     }
   }
   
   void LocalSearchInterIntraSolution::Solve() {
     while (true) {
       int best_c = -1;
       int best_r = -1;
       Vehicle *v_temp_2 = nullptr;
       Vehicle *v_temp = nullptr;
       double delta = std::numeric_limits<double>::max();
       for (auto &v : vehicles_) {
         for (size_t cur = 1; cur < v.nodes_.size() - 1; cur++) {
           const int v_cur = v.nodes_[cur];
           const int v_prev = v.nodes_[cur - 1];
           const int v_next_c = v.nodes_[cur + 1];
           const double cost_reduction = distanceMatrix_[v_prev][v_next_c] -
                                         distanceMatrix_[v_prev][v_cur] -
                                         distanceMatrix_[v_cur][v_next_c];
           for (auto &v2 : vehicles_) {
             for (size_t rep = 0; rep < v2.nodes_.size() - 1; rep++) {
               const int v_rep = v2.nodes_[rep];
               const int v_next_r = v2.nodes_[rep + 1];
               if (v_rep != v_cur && (v.id_ != v2.id_ || v_rep != v_prev)) {
                 const double cost_increase = distanceMatrix_[v_rep][v_cur] +
                                              distanceMatrix_[v_cur][v_next_r] -
                                              distanceMatrix_[v_rep][v_next_r];
                 if (cost_increase + cost_reduction < delta &&
                     (v2.load_ - nodes_[v_cur].demand_ >= 0 || v.id_ == v2.id_)) {
                   delta = cost_increase + cost_reduction;
                   best_c = cur;
                   best_r = rep;
                   v_temp_2 = &v2;
                   v_temp = &v;
                 }
               }
             }
           }
         }
       }
       if (delta > -margin_of_error || v_temp == nullptr || v_temp_2 == nullptr) {
         break;
       }
       int val_best_c = *(v_temp->nodes_.begin() + best_c);
       v_temp->nodes_.erase(v_temp->nodes_.begin() + best_c);
       v_temp->CalculateCost(distanceMatrix_);
       if (v_temp->id_ == v_temp_2->id_ && best_c < best_r) {
         v_temp_2->nodes_.insert(std::next(v_temp_2->nodes_.begin(), best_r),
                                 val_best_c);
       } else {
         v_temp_2->nodes_.insert(std::next(v_temp_2->nodes_.begin(), best_r + 1),
                                 val_best_c);
       }
       v_temp_2->CalculateCost(distanceMatrix_);
       v_temp->load_ += nodes_[val_best_c].demand_;
       v_temp_2->load_ -= nodes_[val_best_c].demand_;
     }
     double cost = std::accumulate(
         std::begin(vehicles_), std::end(vehicles_), 0.0,
         [](const double sum, const Vehicle &v) { return sum + v.cost_; });
     std::cout << "Cost: " << cost << '\n';
     for (const auto &i : nodes_) {
       if (!i.is_routed_) {
         std::cout << "Unreached node: " << '\n';
         std::cout << i << '\n';
       }
     }
     std::cout << "Solution valid: " << CheckSolutionValid() << '\n';
   }