java - 删除列表元素后的java.util.ConcurrentModificationException

在执行ITSPoI allowedPoi = j.next()之后，行allowedPoIs.remove(k)提供以下错误：


  java.util.ConcurrentModificationException在
  java.util.ArrayList $ Itr.checkForComodification（未知源）

private Map<String,Integer> findClosest(Route tempRoute, List<ITSPoI> allowedPoIs, List<ITSPoI> tabulist) {
    double cost,mincost = 999999999;
    Map<String,Integer> closest = new HashMap<String,Integer>();

    for (int i=0; i<tempRoute.getPOIs().size(); i++)        {
        int k = 0;
        for(Iterator<ITSPoI> j = allowedPoIs.iterator(); j.hasNext(); )  {

            ITSPoI allowedPoi = j.next();
            if (!intabu(allowedPoi,tabulist))
            {
                try
                {
                    cost = _cvrtw.getCostMatrix().getCost(tempRoute.getPOI(i).getNodeId(),allowedPoi.getNodeId());

                    if (cost<mincost){
                        mincost = cost;
                        closest.put("index",i);
                        closest.put("poi",k);
                        allowedPoIs.remove(k);

                    }
                }
                catch (Exception e)
                {
                    e.printStackTrace();
                }
            }
            k++;
            }
        }
    return closest;
    }

最佳答案

循环运行时，不能从allowedPoIs中删除​​元素。从iterator删除它，例如：

j.remove();

代替allowedPoIs.remove(k);

我将使用while编写此方法以使其更清晰：

private Map<String,Integer> findClosest(Route tempRoute, List<ITSPoI> allowedPoIs, List<ITSPoI> tabulist) {
    double cost,mincost = 999999999;
    Map<String,Integer> closest = new HashMap<String,Integer>();

           Iterator<ITSPoI> iter;

    for (int i=0; i<tempRoute.getPOIs().size(); i++)        {
        int k = 0;

        iter = allowedPoIs.iterator();

        while(iter.hasNext()){
            ITSPoI allowedPoi = iter.next();
            if (!intabu(allowedPoi,tabulist))
            {
                try
                {
                    cost = _cvrtw.getCostMatrix().getCost(tempRoute.getPOI(i).getNodeId(),allowedPoi.getNodeId());

                    if (cost<mincost){
                        mincost = cost;
                        closest.put("index",i);
                        closest.put("poi",k);
                        iter.remove(); // fix
                    }
                }
                catch (Exception e)
                {
                    e.printStackTrace();
                }
            }
            k++;
        }

    }
    return closest;
}