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_VRP_TW_NODE_H_
#define INCLUDE_VRP_TW_NODE_H_
#pragma once
 
#include <string>
 
#include "c_types/pickDeliver/pickDeliveryOrders_t.h"
#include "c_types/pickDeliver/vehicle_t.h"
#include "cpp_common/pgr_assert.h"
#include "cpp_common/identifier.h"
 
#include "vrp/pd_problem.h"
#include "vrp/dnode.h"
 
namespace pgrouting {
namespace vrp {
 
 
class Tw_node : public Dnode {
 public:
     typedef enum {
         kStart = 0,  
         kPickup,  
         kDelivery,  
         kDump,  
         kLoad,  
         kEnd        
     } NodeType;
 
 
 
     inline int64_t order() const {return m_order;}
 
     inline double opens() const {return m_opens;}
 
     inline double closes() const {return m_closes;}
 
     inline double demand() const {return m_demand;}
     inline void demand(double value) {m_demand = value;}
 
     inline double service_time() const {return m_service_time;}
 
     inline NodeType type() const {return m_type;}
 
     inline double window_length() const {return m_closes - m_opens;}
 
     double travel_time_to(const Tw_node &other, double speed) const;
 
 
 
 
     bool is_start() const;
 
 
     bool is_pickup() const;
 
 
     bool is_delivery() const;
 
 
     bool is_dump() const;
 
 
 
 
     bool is_end() const;
 
 
     std::string type_str() const;
 
     friend std::ostream& operator<< (std::ostream &log, const Tw_node &node);
 
     bool operator ==(const Tw_node &rhs) const;
 
 
 
     inline bool is_early_arrival(double arrival_time) const {
         return arrival_time < m_opens;
     }
 
     inline bool is_late_arrival(double arrival_time) const {
         return arrival_time > m_closes;
     }
 
 
 
     double arrival_j_opens_i(const Tw_node &I, double speed) const;
 
 
 
     /*
      * is possible to arrive to @b this after visiting @bother
      *   - departing as early as possible from @b other it can arrives to @b this
      */
     bool is_compatible_IJ(const Tw_node &I, double speed) const;
 
 
 
 
 
 
     Tw_node() = default;
     Tw_node(const Tw_node &) = default;
     Tw_node(
             size_t id,
             PickDeliveryOrders_t data,
             NodeType type);
     Tw_node(
             size_t id,
             Vehicle_t data,
             NodeType type);
 
 
 private:
     int64_t m_order;       
     double m_opens;        
     double m_closes;       
     double m_service_time;  // /< time it takes to be served
     double m_demand;       
     NodeType m_type;       
};
 
}  //  namespace vrp
}  //  namespace pgrouting
 
#endif  // INCLUDE_VRP_TW_NODE_H_