/*
 * Licensed to GraphHopper GmbH under one or more contributor
 * license agreements. See the NOTICE file distributed with this work for
 * additional information regarding copyright ownership.
 *
 * GraphHopper GmbH licenses this file to you under the Apache License,
 * Version 2.0 (the "License"); you may not use this file except in
 * compliance with the License. You may obtain a copy of the License at
 *
 *       http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */


package com.graphhopper.jsprit.core.algorithm;

import com.graphhopper.jsprit.core.algorithm.recreate.InsertionStrategy;
import com.graphhopper.jsprit.core.problem.VehicleRoutingProblem;
import com.graphhopper.jsprit.core.problem.job.Job;
import com.graphhopper.jsprit.core.problem.solution.InitialSolutionFactory;
import com.graphhopper.jsprit.core.problem.solution.SolutionCostCalculator;
import com.graphhopper.jsprit.core.problem.solution.VehicleRoutingProblemSolution;
import com.graphhopper.jsprit.core.problem.solution.route.VehicleRoute;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.ArrayList;
import java.util.Collection;
import java.util.List;


public final class InsertionInitialSolutionFactory implements InitialSolutionFactory {

    private static final Logger logger = LoggerFactory.getLogger(InsertionInitialSolutionFactory.class);

    private final InsertionStrategy insertion;

    private SolutionCostCalculator solutionCostsCalculator;

    public InsertionInitialSolutionFactory(InsertionStrategy insertionStrategy, SolutionCostCalculator solutionCostCalculator) {
        super();
        this.insertion = insertionStrategy;
        this.solutionCostsCalculator = solutionCostCalculator;
    }

    @Override
    public VehicleRoutingProblemSolution createSolution(final VehicleRoutingProblem vrp) {
        logger.info("create initial solution");
        List<VehicleRoute> vehicleRoutes = new ArrayList<VehicleRoute>();
        vehicleRoutes.addAll(vrp.getInitialVehicleRoutes());
        Collection<Job> badJobs = insertion.insertJobs(vehicleRoutes, getUnassignedJobs(vrp));
        VehicleRoutingProblemSolution solution = new VehicleRoutingProblemSolution(vehicleRoutes, badJobs, Double.MAX_VALUE);
        double costs = solutionCostsCalculator.getCosts(solution);
        solution.setCost(costs);
        return solution;
    }

    private List<Job> getUnassignedJobs(VehicleRoutingProblem vrp) {
        ArrayList<Job> jobs = new ArrayList<Job>(vrp.getJobs().values());
//        for (Vehicle v : vrp.getVehicles()) {
//            if (v.getBreak() != null) jobs.add(v.getBreak());
//        }
        return jobs;
    }

}

@@ -2248,28 +2248,16 @@
 rayList%3C
-VehicleRoute
 %3E();%0A   
@@ -2748,29 +2748,14 @@
     
-ArrayList%3CJob%3E jobs =
+return
  new
@@ -2765,19 +2765,16 @@
 rayList%3C
-Job
 %3E(vrp.ge
@@ -2796,153 +2796,8 @@
 ));%0A
-//        for (Vehicle v : vrp.getVehicles()) %7B%0A//            if (v.getBreak() != null) jobs.add(v.getBreak());%0A//        %7D%0A        return jobs;%0A
     

clean up