RouteCostCalculator.h

Go to the documentation of this file.

/****************************************************************************/
// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
// Copyright (C) 2002-2024 German Aerospace Center (DLR) and others.
// This program and the accompanying materials are made available under the
// terms of the Eclipse Public License 2.0 which is available at
// https://www.eclipse.org/legal/epl-2.0/
// This Source Code may also be made available under the following Secondary
// Licenses when the conditions for such availability set forth in the Eclipse
// Public License 2.0 are satisfied: GNU General Public License, version 2
// or later which is available at
// https://www.gnu.org/licenses/old-licenses/gpl-2.0-standalone.html
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
/****************************************************************************/
// Calculators for route costs and probabilities
/****************************************************************************/
#pragma once
#include <config.h>
 
#include <vector>
#include <map>
#include <cmath>
#include <utils/common/StdDefs.h>
#include <utils/common/SUMOTime.h>
#include <utils/common/RandHelper.h>
#include <utils/options/OptionsCont.h>
 
 
// ===========================================================================
// class definitions
// ===========================================================================
template<class R, class E, class V>
class RouteCostCalculator {
public:
    static RouteCostCalculator<R, E, V>& getCalculator();
 
    static void cleanup() {
        delete myInstance;
        myInstance = 0;
    }
 
    virtual void setCosts(R* route, const double costs, const bool isActive = false) const = 0;
 
    virtual void calculateProbabilities(std::vector<R*> alternatives, const V* const veh, const SUMOTime time) = 0;
 
    int getMaxRouteNumber() const {
        return myMaxRouteNumber;
    }
 
    bool keepAllRoutes() const {
        return myKeepRoutes;
    }
 
    bool skipRouteCalculation() const {
        return mySkipNewRoutes;
    }
 
    bool keepRoute() const {
        if (myKeepRouteProb == 1) {
            return true;
        } else if (myKeepRouteProb == 0) {
            return false;
        } else {
            return RandHelper::rand() < myKeepRouteProb;
        }
    }
 
protected:
    RouteCostCalculator() {
        OptionsCont& oc = OptionsCont::getOptions();
        myMaxRouteNumber = oc.getInt("max-alternatives");
        myKeepRoutes = oc.getBool("keep-all-routes");
        mySkipNewRoutes = oc.getBool("skip-new-routes");
        myKeepRouteProb = oc.exists("keep-route-probability") ? oc.getFloat("keep-route-probability") : 0;
    }
 
    virtual ~RouteCostCalculator() {}
 
private:
    static RouteCostCalculator* myInstance;
 
    int myMaxRouteNumber;
 
    bool myKeepRoutes;
 
    bool mySkipNewRoutes;
 
    double myKeepRouteProb;
 
};
 
 
// ===========================================================================
// static member definitions
// ===========================================================================
template<class R, class E, class V>
RouteCostCalculator<R, E, V>* RouteCostCalculator<R, E, V>::myInstance = 0;
 
 
#include "GawronCalculator.h"
#include "LogitCalculator.h"
 
template<class R, class E, class V>
RouteCostCalculator<R, E, V>& RouteCostCalculator<R, E, V>::getCalculator() {
    if (myInstance == 0) {
        OptionsCont& oc = OptionsCont::getOptions();
        if (oc.getString("route-choice-method") == "logit") {
            myInstance = new LogitCalculator<R, E, V>(oc.getFloat("logit.beta"), oc.getFloat("logit.gamma"), oc.getFloat("logit.theta"));
        } else if (oc.getString("route-choice-method") == "gawron") {
            myInstance = new GawronCalculator<R, E, V>(oc.getFloat("gawron.beta"), oc.getFloat("gawron.a"));
        }
    }
    return *myInstance;
}