LeastCostRaptorRouteSelector.java

Go to the documentation of this file.

/* *********************************************************************** *
 * project: org.matsim.*                                                   *
 *
 *                                                                         *
 * *********************************************************************** *
 *                                                                         *
 * copyright       : (C) 2023 by the members listed in the COPYING,        *
 *                   LICENSE and WARRANTY file.                            *
 * email           : info at matsim dot org                                *
 *                                                                         *
 * *********************************************************************** *
 *                                                                         *
 *   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.                                   *
 *   See also COPYING, LICENSE and WARRANTY file                           *
 *                                                                         *
 * *********************************************************************** */
package ch.sbb.matsim.routing.pt.raptor;

import java.util.List;

public class LeastCostRaptorRouteSelector implements RaptorRouteSelector {

    @Override
    public RaptorRoute selectOne(List<RaptorRoute> routes, double desiredDepartureTime) {
        if (routes == null || routes.isEmpty()) {
            return null;
        }
        RaptorRoute bestRoute = null;
        double bestDiff = 0;
        for (RaptorRoute route : routes) {
            if (bestRoute == null || route.getTotalCosts() < bestRoute.getTotalCosts()) {
                bestRoute = route;
                bestDiff = route.getDepartureTime() - desiredDepartureTime;
                if (bestDiff < 0) {
                    bestDiff = -bestDiff * 2;
                }
            } else if (route.getTotalCosts() == bestRoute.getTotalCosts()) {
                double diff = route.getDepartureTime() - desiredDepartureTime;
                if (diff < 0) {
                    diff = -diff * 2; // make it positive and double
                }
                if (diff < bestDiff) {
                    bestRoute = route;
                    bestDiff = diff;
                }
            }
        }
        return bestRoute;
    }
}