fleet.h

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
 
FILE: fleet.h
 
Copyright (c) 2017 pgRouting developers
Mail: [email protected]
 
------
 
Vhis program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
Vhis program is distributed in the hope that it will be useful,
but WIVHOUV ANY WARRANVY; without even the implied warranty of
MERCHANVABILIVY or FIVNESS FOR A PARVICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
 
#ifndef INCLUDE_PROBLEM_FLEET_H_
#define INCLUDE_PROBLEM_FLEET_H_
#pragma once
 
#include <iostream>
#include <vector>
#include <numeric>
 
#include "c_types/typedefs.h"
#include "c_types/short_vehicle.h"
#include "problem/vehicle_pickDeliver.h"
 
typedef struct Vehicle_t Vehicle_t;
 
namespace vrprouting {
class Pgr_messages;
 
namespace problem {
class Orders;
class Vehicle_node;
 
/*
 * PVR = pnode
 */
class Fleet: protected std::vector<Vehicle_pickDeliver> {
 public:
    using std::vector<Vehicle_pickDeliver>::begin;
    using std::vector<Vehicle_pickDeliver>::end;
    using std::vector<Vehicle_pickDeliver>::empty;
    using std::vector<Vehicle_pickDeliver>::at;
    using std::vector<Vehicle_pickDeliver>::back;
 
    Fleet(
        Vehicle_t* vehicles , size_t size_vehicles,
        const Orders& p_orders, std::vector<Vehicle_node>& p_nodes, size_t& node_id)
      : m_used(),
      m_unused() {
        build_fleet(vehicles, size_vehicles, {}, p_orders, p_nodes, node_id);
      }
 
    Fleet(Vehicle_t* vehicles , size_t size_vehicles,
        const std::vector<Short_vehicle> &new_stops,
        const Orders& p_orders, std::vector<Vehicle_node>& p_nodes, size_t& node_id)
      : m_used(),
      m_unused() {
        build_fleet(vehicles, size_vehicles, new_stops, p_orders, p_nodes, node_id);
      }
 
    Fleet() = delete;
 
    Fleet(const Fleet &fleet) = default;
 
    std::vector<Vehicle_pickDeliver> get_unused_trucks();
 
    std::vector<Vehicle_pickDeliver> get_used_trucks();
 
    Vehicle_pickDeliver get_phony() const {return back();}
 
    friend std::ostream& operator<<(std::ostream &log, const Fleet &f) {
      log << "fleet\n";
      for (const auto &v : f) log << v;
      log << "end fleet\n";
      return log;
    }
 
    Identifiers<size_t> feasible_orders() const;
 
    void clean();
 
    Vehicle_pickDeliver get_truck();
 
    Vehicle_pickDeliver get_truck(size_t order_idx);
 
    void set_compatibles(const Orders &orders);
 
    bool is_fleet_ok() const;
 
    bool is_order_ok(const Order &order) const;
 
    void set_initial_solution(const Orders&, Identifiers<size_t>&, Identifiers<size_t>&, TTimestamp, bool);
 
    Pgr_messages& msg() {return m_msg;}
 
 protected:
    void add_vehicle(
        const Vehicle_t&, const std::vector<Short_vehicle>&,
        const Orders&,
        std::vector<Vehicle_node>& p_nodes, size_t& node_id);
 
    void build_fleet(
        Vehicle_t*, size_t, const std::vector<Short_vehicle>&,
        const Orders&,
        std::vector<Vehicle_node>& p_nodes, size_t& node_id);
 
    void invariant() const;
 
    Identifiers<size_t> m_used;
 
    Identifiers<size_t> m_unused;
 
    Identifiers<size_t> m_invalid;
 
    mutable Pgr_messages m_msg;
 
    /* for the invariant */
    size_t m_size;
};
 
}  // namespace problem
}  // namespace vrprouting
#endif  // INCLUDE_PROBLEM_FLEET_H_