-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathDepartureTimeReScheduler.java
55 lines (49 loc) · 2.6 KB
/
DepartureTimeReScheduler.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*******************************************************************************
* Copyright (C) 2013 Stefan Schroeder
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3.0 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
******************************************************************************/
package sschroeder;
import java.util.Collection;
import jsprit.core.algorithm.listener.AlgorithmEndsListener;
import jsprit.core.algorithm.state.UpdateActivityTimes;
import jsprit.core.problem.VehicleRoutingProblem;
import jsprit.core.problem.cost.TransportTime;
import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
import jsprit.core.problem.solution.route.RouteActivityVisitor;
import jsprit.core.problem.solution.route.VehicleRoute;
import jsprit.core.problem.solution.route.activity.TourActivity;
import jsprit.core.util.Solutions;
public class DepartureTimeReScheduler implements AlgorithmEndsListener {
@Override
public void informAlgorithmEnds(VehicleRoutingProblem problem,Collection<VehicleRoutingProblemSolution> solutions) {
VehicleRoutingProblemSolution solution = Solutions.bestOf(solutions);
for(VehicleRoute route : solution.getRoutes()){
if(!route.isEmpty()){
double earliestDepartureTime = route.getDepartureTime();
TourActivity firstActivity = route.getActivities().get(0);
double tpTime_startToFirst = problem.getTransportCosts().getTransportTime(route.getStart().getLocationId(), firstActivity.getLocationId(),
earliestDepartureTime, null, route.getVehicle());
double newDepartureTime = Math.max(earliestDepartureTime, firstActivity.getTheoreticalEarliestOperationStartTime()-tpTime_startToFirst);
route.setVehicleAndDepartureTime(route.getVehicle(), newDepartureTime);
updateActivityTimes(route, problem.getTransportCosts());
}
}
}
public void updateActivityTimes(VehicleRoute route, TransportTime transportTimes){
RouteActivityVisitor routeVisitor = new RouteActivityVisitor();
routeVisitor.addActivityVisitor(new UpdateActivityTimes(transportTimes));
routeVisitor.visit(route);
}
}