tw_node.h

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
 
FILE: tw_node.h
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
------
 
This 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.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR 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_TW_NODE_H_
#define INCLUDE_PROBLEM_TW_NODE_H_
#pragma once
 
#include <string>
#include "c_types/typedefs.h"
#include "cpp_common/identifier.h"
#include "problem/node_types.h"
 
 
namespace vrprouting {
namespace problem {
 
class Matrix;
 
class Tw_node : public Identifier {
 public:
     Tw_node() = delete;
 
     Tw_node(const Tw_node &) = default;
 
     Tw_node(
             size_t id,
             const PickDeliveryOrders_t &data,
             const NodeType &type);
 
     Tw_node(
             size_t id,
             const Vehicle_t &data,
             const NodeType &type);
 
     inline int64_t order() const {return m_order;}
 
     inline TTimestamp opens() const {return m_opens;}
 
     inline TTimestamp closes() const {return m_closes;}
 
     inline TInterval service_time() const {return m_service_time;}
 
     inline auto type() const {return m_type;}
 
     inline TInterval window_length() const {return m_closes - m_opens;}
 
     bool is_start() const;
 
     bool is_pickup() const;
 
     bool is_delivery() const;
 
     bool is_end() const;
 
     bool is_dump() const;
 
     bool is_load() const;
 
     std::string type_str() const;
 
     friend std::ostream& operator<<(std::ostream &, const Tw_node &);
 
     bool operator ==(const Tw_node &rhs) const;
 
 
     inline bool is_late_arrival(TTimestamp arrival_time) const {
         return arrival_time > m_closes;
     }
 
     inline bool is_early_arrival(TTimestamp arrival_time) const {
         return arrival_time < m_opens;
     }
 
     inline bool is_on_time(TTimestamp arrival_time) const {
         return !is_early_arrival(arrival_time)
             && !is_late_arrival(arrival_time);
     }
 
     TInterval travel_time_to(const Tw_node&, TTimestamp, Speed = 1.0) const;
 
     static const Matrix* m_time_matrix_ptr;
 
     bool is_compatible_IJ(const Tw_node &I, Speed = 1.0) const;
 
     TTimestamp arrival_j_opens_i(const Tw_node &I, Speed = 1.0) const;
 
     TTimestamp arrival_j_closes_i(const Tw_node &I, Speed = 1.0) const;
 
     bool is_partially_compatible_IJ(const Tw_node &I, Speed = 1.0) const;
 
     bool is_tight_compatible_IJ(const Tw_node &I, Speed = 1.0) const;
 
     bool is_partially_waitTime_compatible_IJ(const Tw_node &I, Speed = 1.0) const;
 
     bool is_waitTime_compatible_IJ(const Tw_node &I, Speed = 1.0) const;
 
     inline Amount demand() const {return m_demand;}
 
     bool is_valid() const;
 
 protected:
     inline void demand(Amount value) {m_demand = value;}
 
 private:
     int64_t m_order { };
 
     TTimestamp m_opens;
 
     TTimestamp m_closes;
 
     TInterval m_service_time;
 
     Amount m_demand;
 
     NodeType m_type;
};
 
}  //  namespace problem
}  //  namespace vrprouting
 
#endif  // INCLUDE_PROBLEM_TW_NODE_H_