compatibleVehicles_driver.cpp

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
File: compatibleVehicles_driver.cpp
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
Developer:
Copyright (c) 2015 Celia Virginia Vergara Castillo
 
------
 
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*/
#include "drivers/compatibleVehicles_driver.h"
 
#include <cstring>
#include <sstream>
#include <string>
#include <deque>
 
#include "problem/pickDeliver.h"
#include "problem/matrix.h"
#include "c_types/pickDeliveryOrders_t.h"
#include "c_types/compatibleVehicles_rt.h"
#include "c_types/vehicle_t.h"
 
#include "cpp_common/pgr_assert.h"
#include "c_common/pgr_alloc.hpp"
 
void
do_compatibleVehicles(
        PickDeliveryOrders_t customers_arr[],
        size_t total_customers,
 
        Vehicle_t *vehicles_arr,
        size_t total_vehicles,
 
        Matrix_cell_t *matrix_cells_arr,
        size_t total_cells,
 
        Time_multipliers_t *multipliers_arr,
        size_t total_multipliers,
 
        double factor,
 
        CompatibleVehicles_rt **return_tuples,
        size_t *return_count,
 
        char **log_msg,
        char **notice_msg,
        char **err_msg) {
    std::ostringstream log;
    std::ostringstream notice;
    std::ostringstream err;
    try {
        /*
         * verify preconditions
         */
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(total_customers);
        pgassert(total_vehicles);
        pgassert(total_vehicles);
        pgassert(*return_count == 0);
        pgassert(!(*return_tuples));
        log << "do_compatibleVehicles\n";
 
 
        Identifiers<Id> node_ids;
 
        for (size_t i = 0; i < total_customers; ++i) {
            node_ids += customers_arr[i].pick_node_id;
            node_ids += customers_arr[i].deliver_node_id;
        }
 
        for (size_t i = 0; i < total_vehicles; ++i) {
            node_ids += vehicles_arr[i].start_node_id;
            node_ids += vehicles_arr[i].end_node_id;
        }
 
        /*
         * Verify matrix cells preconditions
         */
        vrprouting::problem::Matrix cost_matrix(
            matrix_cells_arr, total_cells,
            multipliers_arr, total_multipliers,
            node_ids, static_cast<Multiplier>(factor));
#if 0
        /*
         * Verify matrix triangle inequality
         */
        if (!cost_matrix.obeys_triangle_inequality()) {
            log << "[Compatible Vehicles] Fixing Matrix that does not obey triangle inequality ";
            log << cost_matrix.fix_triangle_inequality() << " cycles used";
 
            if (!cost_matrix.obeys_triangle_inequality()) {
                log << "[Compatible Vehicles] Matrix Still does not obey triangle inequality";
            }
        }
#endif
        if (!cost_matrix.has_no_infinity()) {
            err << "An Infinity value was found on the Matrix";
            *err_msg = pgr_msg(err.str());
            return;
        }
 
        /*
         * Construct problem
         */
        log << "Initialize problem\n";
        vrprouting::problem::PickDeliver pd_problem(
                customers_arr, total_customers,
                vehicles_arr, total_vehicles,
                cost_matrix);
 
        err << pd_problem.msg.get_error();
        if (!err.str().empty()) {
            log << pd_problem.msg.get_log();
            *log_msg = pgr_msg(log.str());
            *err_msg = pgr_msg(err.str());
            return;
        }
        log << pd_problem.msg.get_log();
        log << "Finish Reading data\n";
        pd_problem.msg.clear();
 
        /*
         * Prepare results
         */
        auto solution = pd_problem.get_pg_compatibleVehicles();
        log << "solution size: " << solution.size() << "\n";
        log << "solution empty: " << solution.empty() << "\n";
 
        if (!solution.empty()) {
            log << "solution empty " << "\n";
            (*return_tuples) = pgr_alloc(solution.size(), (*return_tuples));
            int seq = 0;
            for (const auto &row : solution) {
                (*return_tuples)[seq] = row;
                ++seq;
            }
        }
        (*return_count) = solution.size();
 
 
        pgassert(*err_msg == nullptr);
        *log_msg = log.str().empty()?
            nullptr :
            pgr_msg(log.str());
        *notice_msg = notice.str().empty()?
            nullptr :
            pgr_msg(notice.str());
    } catch (AssertFailedException &except) {
        if (*return_tuples) free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str());
        *log_msg = pgr_msg(log.str());
    } catch (std::exception& except) {
        if (*return_tuples) free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str());
        *log_msg = pgr_msg(log.str());
    } catch(...) {
        if (*return_tuples) free(*return_tuples);
        (*return_count) = 0;
        err << "Caught unknown exception!";
        *err_msg = pgr_msg(err.str());
        *log_msg = pgr_msg(log.str());
    }
}