Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::NearpParser Class Reference

#include <nearp_parser.h>

Public Member Functions

 NearpParser ()
 
 NearpParser (const NearpParser &)=delete
 
const NearpParseroperator= (const NearpParser &)=delete
 
bool LoadFile (const std::string &file_name)
 Loads instance from a file into this parser object.
 
const std::string & name () const
 Returns the name of the instance being solved.
 
const std::string & comment () const
 Returns the comment of the instance being solved, typically an upper bound.
 
int64_t depot () const
 Returns the index of the depot.
 
int NumberOfVehicles () const
 Returns the maximum number of vehicles to use.
 
int64_t capacity () const
 Returns the capacity of the vehicles.
 
int NumberOfNodes () const
 Returns the number of nodes in the current routing problem.
 
int NumberOfArcs () const
 
int NumberOfEdges () const
 
int NumberOfArcsWithServicing () const
 
int NumberOfEdgesWithServicing () const
 
int NumberOfNodesWithServicing () const
 
int NumberOfArcsWithoutServicing () const
 
int NumberOfEdgesWithoutServicing () const
 
int64_t NumberOfNodesWithoutServicing () const
 
const gtl::linked_hash_map< Arc, int64_t > & arc_servicing_demands () const
 Returns the servicing demands of the arcs in the current routing problem.
 
const gtl::linked_hash_map< Edge, int64_t > & edge_servicing_demands () const
 Returns the servicing demands of the edges in the current routing problem.
 
const gtl::linked_hash_map< int64_t, int64_t > & node_servicing_demands () const
 Returns the servicing demands of the nodes in the current routing problem.
 
const gtl::linked_hash_map< Arc, int64_t > & arc_servicing_costs () const
 Returns the servicing costs of the arcs in the current routing problem.
 
const gtl::linked_hash_map< Edge, int64_t > & edge_servicing_costs () const
 Returns the servicing costs of the edges in the current routing problem.
 
const gtl::linked_hash_map< int64_t, int64_t > & node_servicing_costs () const
 Returns the servicing costs of the nodes in the current routing problem.
 
const gtl::linked_hash_map< Arc, int64_t > & arc_traversing_costs () const
 Returns the traversing costs of the arcs in the current routing problem.
 
const gtl::linked_hash_map< Edge, int64_t > & edge_traversing_costs () const
 Returns the traversing costs of the edges in the current routing problem.
 
std::string GetArcName (Arc arc) const
 
std::string GetArcName (int64_t tail, int64_t head) const
 
std::string GetEdgeName (Edge edge) const
 
std::string GetEdgeName (int64_t tail, int64_t head) const
 
std::string GetNodeName (int64_t node) const
 

Detailed Description

Definition at line 88 of file nearp_parser.h.

Constructor & Destructor Documentation

◆ NearpParser() [1/2]

operations_research::NearpParser::NearpParser ( )

Definition at line 30 of file nearp_parser.cc.

◆ NearpParser() [2/2]

operations_research::NearpParser::NearpParser ( const NearpParser & )
delete

Member Function Documentation

◆ arc_servicing_costs()

const gtl::linked_hash_map< Arc, int64_t > & operations_research::NearpParser::arc_servicing_costs ( ) const
inline

Returns the servicing costs of the arcs in the current routing problem.

Definition at line 161 of file nearp_parser.h.

◆ arc_servicing_demands()

const gtl::linked_hash_map< Arc, int64_t > & operations_research::NearpParser::arc_servicing_demands ( ) const
inline

Returns the servicing demands of the arcs in the current routing problem.

Definition at line 148 of file nearp_parser.h.

◆ arc_traversing_costs()

const gtl::linked_hash_map< Arc, int64_t > & operations_research::NearpParser::arc_traversing_costs ( ) const
inline

Returns the traversing costs of the arcs in the current routing problem.

Definition at line 174 of file nearp_parser.h.

◆ capacity()

int64_t operations_research::NearpParser::capacity ( ) const
inline

Returns the capacity of the vehicles.

Definition at line 110 of file nearp_parser.h.

◆ comment()

const std::string & operations_research::NearpParser::comment ( ) const
inline

Returns the comment of the instance being solved, typically an upper bound.

Definition at line 103 of file nearp_parser.h.

◆ depot()

int64_t operations_research::NearpParser::depot ( ) const
inline

Returns the index of the depot.

Definition at line 105 of file nearp_parser.h.

◆ edge_servicing_costs()

const gtl::linked_hash_map< Edge, int64_t > & operations_research::NearpParser::edge_servicing_costs ( ) const
inline

Returns the servicing costs of the edges in the current routing problem.

Definition at line 165 of file nearp_parser.h.

◆ edge_servicing_demands()

const gtl::linked_hash_map< Edge, int64_t > & operations_research::NearpParser::edge_servicing_demands ( ) const
inline

Returns the servicing demands of the edges in the current routing problem.

Definition at line 152 of file nearp_parser.h.

◆ edge_traversing_costs()

const gtl::linked_hash_map< Edge, int64_t > & operations_research::NearpParser::edge_traversing_costs ( ) const
inline

Returns the traversing costs of the edges in the current routing problem.

Definition at line 178 of file nearp_parser.h.

◆ GetArcName() [1/2]

std::string operations_research::NearpParser::GetArcName ( Arc arc) const

Returns the name of graph objects. The implementations should fit all instances of NEARP files,

Definition at line 423 of file nearp_parser.cc.

◆ GetArcName() [2/2]

std::string operations_research::NearpParser::GetArcName ( int64_t tail,
int64_t head ) const
inline

Definition at line 185 of file nearp_parser.h.

◆ GetEdgeName() [1/2]

std::string operations_research::NearpParser::GetEdgeName ( Edge edge) const

Definition at line 437 of file nearp_parser.cc.

◆ GetEdgeName() [2/2]

std::string operations_research::NearpParser::GetEdgeName ( int64_t tail,
int64_t head ) const
inline

Definition at line 189 of file nearp_parser.h.

◆ GetNodeName()

std::string operations_research::NearpParser::GetNodeName ( int64_t node) const
inline

Definition at line 192 of file nearp_parser.h.

◆ LoadFile()

bool operations_research::NearpParser::LoadFile ( const std::string & file_name)

Loads instance from a file into this parser object.

Definition at line 52 of file nearp_parser.cc.

◆ name()

const std::string & operations_research::NearpParser::name ( ) const
inline

Returns the name of the instance being solved.

Definition at line 101 of file nearp_parser.h.

◆ node_servicing_costs()

const gtl::linked_hash_map< int64_t, int64_t > & operations_research::NearpParser::node_servicing_costs ( ) const
inline

Returns the servicing costs of the nodes in the current routing problem.

Definition at line 169 of file nearp_parser.h.

◆ node_servicing_demands()

const gtl::linked_hash_map< int64_t, int64_t > & operations_research::NearpParser::node_servicing_demands ( ) const
inline

Returns the servicing demands of the nodes in the current routing problem.

Definition at line 156 of file nearp_parser.h.

◆ NumberOfArcs()

int operations_research::NearpParser::NumberOfArcs ( ) const
inline

Returns the number of arc in the current routing problem, with or without servicing required.

Definition at line 116 of file nearp_parser.h.

◆ NumberOfArcsWithoutServicing()

int operations_research::NearpParser::NumberOfArcsWithoutServicing ( ) const
inline

Returns the number of arcs in the current routing problem that do not require servicing.

Definition at line 133 of file nearp_parser.h.

◆ NumberOfArcsWithServicing()

int operations_research::NearpParser::NumberOfArcsWithServicing ( ) const
inline

Returns the number of arcs in the current routing problem that require servicing.

Definition at line 123 of file nearp_parser.h.

◆ NumberOfEdges()

int operations_research::NearpParser::NumberOfEdges ( ) const
inline

Returns the number of edges in the current routing problem, with or without servicing required.

Definition at line 119 of file nearp_parser.h.

◆ NumberOfEdgesWithoutServicing()

int operations_research::NearpParser::NumberOfEdgesWithoutServicing ( ) const
inline

Returns the number of edges in the current routing problem that do not require servicing.

Definition at line 138 of file nearp_parser.h.

◆ NumberOfEdgesWithServicing()

int operations_research::NearpParser::NumberOfEdgesWithServicing ( ) const
inline

Returns the number of edges in the current routing problem that require servicing.

Definition at line 126 of file nearp_parser.h.

◆ NumberOfNodes()

int operations_research::NearpParser::NumberOfNodes ( ) const
inline

Returns the number of nodes in the current routing problem.

Definition at line 113 of file nearp_parser.h.

◆ NumberOfNodesWithoutServicing()

int64_t operations_research::NearpParser::NumberOfNodesWithoutServicing ( ) const
inline

Returns the number of nodes in the current routing problem that do not require servicing.

Definition at line 143 of file nearp_parser.h.

◆ NumberOfNodesWithServicing()

int operations_research::NearpParser::NumberOfNodesWithServicing ( ) const
inline

Returns the number of nodes in the current routing problem that require servicing.

Definition at line 129 of file nearp_parser.h.

◆ NumberOfVehicles()

int operations_research::NearpParser::NumberOfVehicles ( ) const
inline

Returns the maximum number of vehicles to use.

Definition at line 108 of file nearp_parser.h.

◆ operator=()

const NearpParser & operations_research::NearpParser::operator= ( const NearpParser & )
delete

The documentation for this class was generated from the following files: