Capacity Facility Location Problem算法设计项目

本项目代码，项目说明以及测试数据的github地址如下(github为最新版本，由于后续有改进，因此github的代码与结果与下述的不同，但也就相差一点)
https://github.com/ddghost/Capacity_Facility_Location_Problem

项目要求的详细描述与测试数据请参看github上的文件。

项目概要

题目的简单概要就是：给定若干顾客和设施，每个顾客需要存放一定容量的东西到设施中，每个设施都有不同的容量和打开的花费，同时每个顾客存放东西到不同的设施中花费也是不同的，同一个顾客的东西只能存在同一个设施中。我们主要就是要最小化打开设施的花费以及顾客存放东西的花费。
我们需要解决的两个问题主要是：
1.从全局来开，我们要开哪些设施？
2.给定一些开了的设施，对于每个顾客而言，往哪个设施存放东西能使得存放东西的花费最小？

事实上，这两个问题在多项式时间内，应该都是找不到精确解的。(我想不出来) 因此我只能用一些算法去逼近解。主要想到了两种相对简单而且有效的方法，贪心算法和模拟退火算法。

结果展示

为便于结果复现，我的代码里都没有设置随机数的种子，废话不多说，先放出结果。（一般我看博客，结果不好，后面就不看）

感觉给出71个样例的结果很难直观判断结果的好坏，先给出71个样例花费总和：
贪心算法：
961450（优化后的贪心算法）
约130万（使用所有设施开启的贪心算法，后面的结果展示为上一个数值）

模拟退火：
949453(使用所有设施开启的贪心算法作为初始解，后来修改了初始温度，从0.001改到0.02，总花费减少到了945410)
约94万（使用优化后的贪心算法作为初始解，为体现模拟退火确实有效果，后面的结果展示为上一个数值）

贪心算法结果

名字	结果	时间
p1	9142	0.002
p2	8104	0.001
p3	9824	0.001
p4	11261	0.001
p5	9348	0.001
p6	8061	0.001
p7	9905	0.001
p8	11705	0.001
p9	8598	0.009
p10	7617	0.001
p11	9064	0.001
p12	10301	0.001
p13	8505	0.003
p14	7169	0.003
p15	8892	0.003
p16	10492	0.019
p17	8515	0.006
p18	7152	0.004
p19	8952	0.003
p20	10707	0.003
p21	8114	0.006
p22	7120	0.003
p23	8774	0.005
p24	10374	0.002
p25	12167	0.012
p26	11314	0.011
p27	13114	0.012
p28	14752	4.233
p29	13672	0.012
p30	12217	0.013
p31	14617	0.011
p32	16953	0.012
p33	12143	0.014
p34	11131	0.011
p35	12931	0.012
p36	14731	0.014
p37	11521	0.014
p38	10800	0.014
p39	12073	0.012
p40	13273	0.012
p41	6810	0.009
p42	5781	0.006
p43	5527	0.012
p44	7585	0.004
p45	6458	0.007
p46	6065	0.015
p47	6634	0.004
p48	5613	0.008
p49	5322	0.009
p50	9454	0.005
p51	7633	0.008
p52	9588	0.004
p53	8607	0.005
p54	9702	0.003
p55	8090	0.006
p56	21429	0.012
p57	27059	1.132
p58	38975	0.013
p59	28730	0.016
p60	20605	0.017
p61	24961	0.015
p62	33690	0.045
p63	25399	0.031
p64	20530	0.037
p65	24445	0.045
p66	31669	0.035
p67	25032	3.697
p68	20735	0.015
p69	24803	0.017
p70	33203	0.016
p71	26211	0.016

模拟退火算法结果

名字	结果	时间
p1	8848	1.947
p2	7913	2.168
p3	9487	1.524
p4	10714	1.736
p5	8838	2.441
p6	7777	1.724
p7	9488	2.548
p8	11088	2.572
p9	8462	1.393
p10	7617	1.44
p11	8932	2.179
p12	10132	1.875
p13	8333	1.677
p14	7137	2.145
p15	8835	1.669
p16	10408	1.627
p17	8340	1.595
p18	7188	2.089
p19	8925	1.705
p20	10487	1.74
p21	8236	2.156
p22	7152	1.512
p23	8774	1.599
p24	10301	1.882
p25	12006	3.585
p26	10773	3.864
p27	12380	3.093
p28	13837	3.615
p29	12893	2.687
p30	11669	3.388
p31	13608	2.711
p32	16088	3.302
p33	12283	2.671
p34	10632	3.084
p35	12684	2.766
p36	14160	3.239
p37	11258	2.596
p38	10551	3.629
p39	11859	2.72
p40	13059	3.652
p41	6616	1.881
p42	5936	2.397
p43	5582	1.814
p44	7028	1.845
p45	6310	1.815
p46	5988	1.72
p47	6228	1.87
p48	5643	2.062
p49	5347	1.718
p50	8744	1.924
p51	7498	2.056
p52	9180	2.013
p53	8531	1.989
p54	8777	2.035
p55	7685	3.335
p56	21451	3.485
p57	27111	3.919
p58	38342	3.331
p59	27776	3.646
p60	20662	3.555
p61	25244	2.978
p62	33694	3.593
p63	25453	3.002
p64	20530	3.468
p65	24610	3.159
p66	31879	3.479
p67	26649	2.861
p68	20840	3.403
p69	25622	2.852
p70	34882	3.439
p71	26463	2.957

详细的结果太多，见最后。接下来介绍一下代码。

Solution类（基类）

本类是两种算法的基类，主要存储解决问题要用的数据和共有的函数接口，函数接口说明如下。

• run: 读取数据
• printResult: 输出结果到文件
• evaluate: 评价结果的总花费，O(n+m)复杂度，n为顾客数，m为设施数。

class Solution{
protected:
    int faciltyNum , customerNum;
    vector<double>  demandVec ,                 //所有顾客的存放容量需求
                    facilityCapacity ,          //所有设施的最大容量
                    openFacilityCost;           //所有设施的打开花费
    vector<vector<double> > allocateCostVec;    //顾客分配到不同设施的花费，[i][j],i为设施号，j为顾客号
    clock_t start_time;
public:
    void run(string path ){
        ifstream is(path);
        is >> faciltyNum >> customerNum;
        demandVec.resize(customerNum);
        allocateCostVec.resize(faciltyNum , vector<double>(customerNum));
        facilityCapacity.resize(faciltyNum);
        openFacilityCost.resize(faciltyNum);
        for(int i = 0 ; i < faciltyNum; i++){
            double openCost , capacity;
            is >> facilityCapacity[i] >> openFacilityCost[i];
        }
        for(int i = 0 ; i < customerNum; i++){
            is >> demandVec[i];
        }
        for(int i = 0 ; i < faciltyNum; i++){
            for(int j = 0 ; j < customerNum; j++){
                is >> allocateCostVec[i][j] ;
            }
        }
        start_time = clock();
        cout << "solving " << path << endl;
    }
    //输出结果
    void printResult(vector<int> result , ofstream& os , string path){

        vector<bool> openFac(faciltyNum , false);
        os << path << " result: " << endl;
        os << "customer arrange: ";
        for(int i = 0 ; i < customerNum ; i ++){
            os << result[i] << " ";
            openFac[result[i] ] = true;
        }
        os << endl;
        os << "facility : ";
        for(int i = 0 ; i < faciltyNum ; i ++){
            os << openFac[i]  << " ";
        }
        os << endl;
        os << "cost is " << evalutate(result) << endl;
        os << "this case waste time is " << (clock() - start_time) * 1.0 / CLOCKS_PER_SEC << " s" << endl;
        os << "===================================================================" << endl;
    }
    //给定所有顾客的分配序列，算出结果，O(n+m)复杂度，n为顾客数，m为设施数。
    double evalutate(vector<int > result){
        double value = 0;
        vector<double> facilityRestCapacity = facilityCapacity;
        vector<bool> open(faciltyNum , false);

        for(int i = 0 ; i < customerNum ; i++){
            if(result[i] == -1){
                return INT_MAX;
            }
            value += allocateCostVec[result[i] ][i];
            facilityRestCapacity[ result[i] ] -= demandVec[i];
            if(facilityRestCapacity[result[i] ] < 0 ){
                return INT_MAX;
            }
            open[result[i]] = true;
        }

        for(int i = 0 ; i < faciltyNum ; i++){
            if(open[i] ){
                value += openFacilityCost[i];
            }
        }
        return value;
    }
};

greedySolution(贪心算法)

本类是贪心算法类，接下来介绍一下个函数接口。

• simpleGreedyArrange:简单的贪心分配，给定要开的设施，顾客下标从小到大贪心，每个顾客都选花费最小的设施，这里可能分配失败，分配完后需要评价花费，如果花费为INT_MAX就是分配失败。

值得注意的是，即使是设施全开，在样例有解的情况下使用该贪心算法理论上有可能无解。
以下给出反例
设施容量： 10 ， 10
顾客需求： 2 ， 2 ， 9
若从左到右遍历，顾客0花费最小设施为设施0，顾客1花费最小设施为设施1，这样顾客3就没有设施可以分配了，而该例子显然是有解的。
幸运的是，经验证，这71个测例通过该方法在全开设施的情况下都是有解的。

• greedyArrange：贪心分配，开始先让设施全开，进行简单贪心分配，然后遍历所有设施，计算关了这个设施后的花费，然后选这一轮遍历中花费最小的结果minCost，再进行第二个删除设施的选取，如此往复，有一个bestValue变量记录最好的结果。
  同时设定了一个阈值stopThresold，如果minCost < bestValue * stopThresold，那就不再选取新的删除设施，有点退火的思想,允许接受一个比最好解稍微差一点的解，这样说不定下几轮能找到更好的解。71个样例的运行时间是20s左右，加起来的花费为96w，效果不错。

class greedySolution:public Solution{

protected:
    double stopThresold = 1.05;
public:
    int run(string filePath ,ofstream& os ){
        Solution::run(filePath );
        vector<int> result = greedyArrange();
        double cost = evalutate( result );
        cout << "greedy arrange cost "<<  cost << endl;
        printResult(result , os, filePath);
        return cost;
    }


    vector<int> greedyArrange(){
        vector<bool> openFac(faciltyNum , true);
        vector<bool> bestOpenFac = openFac;
        vector<int> initResult = simpleGreedyArrange(openFac );
        double nowValue = evalutate(initResult);
        double bestValue = nowValue;

        while(true){
            int bestReduceFacility = -1;
            double minCost = INT_MAX;
            for(int i = 0 ; i < faciltyNum ; i++){
                if(openFac[i]){
                    openFac[i] = false;
                    vector<int> tmpResult = simpleGreedyArrange(openFac );
                    double tmpCost = evalutate(tmpResult);
                    if(tmpCost < minCost){
                        minCost = tmpCost;
                        bestReduceFacility = i;
                    }
                    openFac[i] = true;
                }
            }
            if(minCost < bestValue * stopThresold ){
                openFac[bestReduceFacility] = false;
                if(minCost < bestValue){
                    bestOpenFac = openFac;
                    bestValue = minCost;
                }
            }else{
                break;
            }
        }
        return simpleGreedyArrange(bestOpenFac);
    }

    vector<int> simpleGreedyArrange(vector<bool> openFac ){
        vector<double> facilityRestCapacity = facilityCapacity;
        vector<int > result(customerNum , -1);
        double nowGreedyCost = 0;
        for(int i = 0 ; i < customerNum ; i++){
            int bestFacility = -1 , minAllocCost = INT_MAX;
            for(int j = 0 ; j < faciltyNum ; j++){
                if(openFac[j] && facilityRestCapacity[j] >= demandVec[i]
                        && minAllocCost > allocateCostVec[j][i] ){
                    bestFacility = j ;
                    minAllocCost = allocateCostVec[j][i];
                }
            }
            if(bestFacility != -1){
                facilityRestCapacity[bestFacility] -= demandVec[i] ;
                result[i] = bestFacility;
            }else{
                //cout << "greedyArrange Error" << endl;
                return result ;
            }
        }
        return result;
     }

};

SaSolution类（模拟退火算法）

本类是模拟退火算法类，本类继承贪心算法类，主要是考虑到可以使用贪心算法的部分接口构建初始解，接下来介绍一下个函数接口。

• startSa: 根据给定的初始顾客的设施分配结果，进行局部搜索，同时对新旧解用模拟退火的公式判断是否接受旧解。（初始结果可以采用全开设施的简单贪心得出的解，也可以采用贪心算法的最终解。采用后者的话结果更好一点。前者贪心71个样例花费总和为130万，退火后结果为94万。后者贪心71个样例结果花费总和为96万，退火后结果为93万，使用前者可以看到退火算法对初始解确实有不错的优化效果，而后者可以得到更好一点的结果）

外层循环1000次，内层循环2000次，若内层循环结束，当前结果的花费相对于进入内层循环前没有改变的话（不是最佳花费），会进行升温操作，经过验证（通过去掉升温与加上升温得出的结果进行对比）证明升温有一定效果（71个样例花费总值少了几千）。

至于一些参数，例如内外循环次数的选择，还有升温的操作，我都没有太仔细的调整，也没有设置一个动态的值，效果不错就可以了，毕竟运行一次要几分钟，调参太累。

接下来是一些邻域操作，邻域操作是模拟退火算法的核心，没有好的邻域操作，优化初解的效果微乎其微。

• twoSwap：获得新解的邻域操作，选取两个顾客，将他们分配的设施简单交换。
• threeSwap：获得新解的邻域操作，选取三个顾客，将他们分配的设施简单交换，经过验证，这个操作效果很差，因此实际上没有采用。
• simleAllocChange：选随机顾客，随机选一个设施处理该顾客请求。
• greedyArrangeRandCustomer：选一个顾客，贪心分配它的设施（与原设施不同）
• closeRandFac: 随机关掉一个设施，将里面的顾客贪心分配，如果无法分配，结果返回为INT_MAX.
• openRandFac:随机开一个设施，遍历所有顾客，如果顾客分配到该设施比之前的更好，就分配过去。

由于开关设施这两个邻域操作复杂度挺高的，而且实际上也不应该如此频繁的开关设施，因此这两个操作放在外循环中。

在这里，我内循环外循环次数给定，因此若内层循环选择几种不算太差的操作综合起来随机操作，效果会不错，而综合一些效果很差的邻域操作，结果反而会变差。例如三交换，因此要谨慎选择，否则费时又低效。

• canAccept：模拟退火通过新旧两个花费判断是否接受新解，考虑到每个样例的结果都不一样，大的有几万，少的仅几千，这里进行了归一化操作，能量=新值-旧值/旧值，这样得出的能量一般很小，因此初始温度也要调小。如若不进行归一化操作，也即简单的使得 能量=新值-旧值，那么效果会比较差，因为初始温度一定，而相同的新旧值差在每个样例中接受程度应该是不同的，例如新值比旧值多1000，在结果大概为30000的样例中，倒退仅 1/30，而在结果大概为5000的样例中，误差则为 1/5，不进行归一化的话它们的可接受概率相等，这显然不科学。

class SaSolution:public greedySolution{
private:
    double temperature = 0.001;
    const double alpha = 0.99;
    int outLimit = 1000 , inLimit = 2000;
public:
    int run(string filePath , ofstream& os ){
        Solution::run(filePath );
        //vector<int> saResult = startSa(startGreedy() );//注释掉下一句，取消本句的注释结果会更好。
        vector<int> saResult = startSa(simpleGreedyArrange(vector<bool>(faciltyNum , true) ) );
        double cost = evalutate( saResult );
        cout << "sa arrange cost "<<  cost << endl;
        printResult(saResult , os , filePath);
        return cost;
    }

    vector<int> startSa(vector<int> result ){
        vector<int> bestResult = result;
        double cost = evalutate( result );
        double bestCost = cost;
        for(int i = 0 ; i < outLimit ; i++){
            int lastOutLimitCost = cost;
            for(int j = 0 ; j < inLimit ; j++){
                double randPick = (double)rand() / RAND_MAX;
                if(randPick < 0.4){
                    cost = twoSwap(result , cost);
                }else if(randPick < 0.8) {
                    cost = simleAllocChange(result , cost);
                }else{
                    cost = greedyArrangeRandCustomer(result , cost);
                }

                if(cost < bestCost){
                    bestCost = cost;
                    bestResult = result;
                }
            }

            if( (double)rand() / RAND_MAX < 0.5){
                cost = closeRandFac(result , cost);
            }else{
                cost = openRandFac(result , cost);
            }

            if(cost < bestCost){
                bestCost = cost;
                bestResult = result;
            }

            if(lastOutLimitCost == cost){
                temperature /= pow(alpha , 5);
            }else{
                temperature *= alpha;
            }
        }

        return bestResult;
    }
    //双交换
    double twoSwap(vector<int>& result , double lastCost){
        int randCutomer1 = rand() % customerNum;
        int randCutomer2 = rand() % customerNum;

        swapTwoAlloc(result , randCutomer1 , randCutomer2);
        double nowCost = evalutate(result);
        if( canAccept(lastCost , nowCost) ){
            return nowCost;
        }else{
            swapTwoAlloc(result , randCutomer1 , randCutomer2);
            return lastCost;
        }

    }
    //三交换
    double threeSwap(vector<int>& result , double lastCost){
        int randCutomer1 = rand() % customerNum;
        int randCutomer2 = rand() % customerNum;
        int randCutomer3 = rand() % customerNum;

        swapTwoAlloc(result , randCutomer1 , randCutomer2);
        swapTwoAlloc(result , randCutomer1 , randCutomer3);
        double nowCost = evalutate(result);
        if( canAccept(lastCost , nowCost) ){
            return nowCost;
        }else{
            swapTwoAlloc(result , randCutomer1 , randCutomer3);
            swapTwoAlloc(result , randCutomer1 , randCutomer2);
            return lastCost;
        }
    }
    //选随机顾客，随机选一个设施处理该顾客请求
    double simleAllocChange(vector<int>& result , double lastCost){
        int randCutomer = rand() % customerNum;
        int newFacility = rand() % faciltyNum;
        while(newFacility == result[randCutomer] ){
            newFacility = rand() % faciltyNum;
        }
        int oldFacility = result[randCutomer];
        result[randCutomer] = newFacility;

        double nowCost = evalutate(result);
        if( canAccept(lastCost , nowCost) ){
            return nowCost;
        }else{
            result[randCutomer] = oldFacility;
            return lastCost;
        }
    }
    //随机关掉一个设施
    double closeRandFac(vector<int>& result , double lastCost){
        vector<bool> openFac(faciltyNum , false);
        vector<double> facilityRestCapacity = facilityCapacity;
        for(int i = 0 ; i < customerNum ; i++){
            openFac[result[i] ] = true;
            facilityRestCapacity[result[i] ] -= demandVec[i];
        }
        int randFacility = rand() % faciltyNum;
        while(!openFac[randFacility]  ){
            randFacility = rand() % faciltyNum;
        }
        openFac[randFacility] = false;
        vector<int> oldResult = result;
        for(int i = 0 ; i < customerNum ; i++){
            if(result[i] == randFacility ){
                int bestFacility = -1 , minAllocCost = INT_MAX;
                for(int j = 0 ; j < faciltyNum ; j++){
                    if(openFac[j] && facilityRestCapacity[j] >= demandVec[i]
                            && minAllocCost > allocateCostVec[j][i] ){
                        bestFacility = j ;
                        minAllocCost = allocateCostVec[j][i];
                    }
                }
                if(bestFacility != -1){
                    facilityRestCapacity[bestFacility] -= demandVec[i] ;
                    result[i] = bestFacility;
                }else{
                    result = oldResult;
                    return lastCost;
                }
            }
        }
        //result = simpleGreedyArrange(openFac);
        double nowCost = evalutate(result);

        if( canAccept(lastCost , nowCost) ){
            return nowCost;
        }else{
            result = oldResult;
            return lastCost;
        }
    }
    //随机开一个设施
    double openRandFac(vector<int>& result , double lastCost){
        vector<bool> openFac(faciltyNum , false);
        bool haveCloseFac = false;
        for(int i = 0 ; i < customerNum ; i++){
            openFac[result[i] ] = true;
        }

        for(int i = 0 ; i < faciltyNum ; i++){
            if(!openFac[i] ) {
                haveCloseFac = true;
            }
        }

        if(!haveCloseFac){
            return lastCost;
        }

        int randFacility = rand() % faciltyNum;
        while(openFac[randFacility]  ){
            randFacility = rand() % faciltyNum;
        }
        openFac[randFacility] = true;
        vector<int> oldResult = result;

        double restCapacity = facilityCapacity[randFacility];
        for(int i = 0 ; i < customerNum ; i++){
            int bestFacility = -1 ;
            if( restCapacity >= demandVec[i]
                    && allocateCostVec[result[i]][i] > allocateCostVec[randFacility][i] ){
                restCapacity -= demandVec[i];
                result[i] = randFacility;
            }
        }
        double nowCost = evalutate(result);
        if( canAccept(lastCost , nowCost) ){
            return nowCost;
        }else{
            result = oldResult;
            return lastCost;
        }
    }
    //选一个顾客，贪心分配它的设施（与原设施不同）
    double greedyArrangeRandCustomer(vector<int>& result , double lastCost){

        int randCutomer = rand() % customerNum , bestFacility = -1;
        int oldFacility = result[randCutomer];
        int oldFacilityCustomer = 0;
        vector<double> facilityRestCapacity = facilityCapacity;
        vector<bool> openFac(faciltyNum , false);
        for(int i = 0 ; i < customerNum ; i++){
            if(i != randCutomer){
                facilityRestCapacity[result[i] ] -= demandVec[i];
            }
            if(result[i] == oldFacility){
                oldFacilityCustomer ++ ;
            }
            openFac[result[i] ] = true;
        }

        double nowArrangeCost = lastCost - allocateCostVec[oldFacility][randCutomer] ;

        if(oldFacilityCustomer == 1){
            nowArrangeCost -= openFacilityCost[oldFacility];
        }

        double bestCost = INT_MAX;

        for(int j = 0 ; j < faciltyNum ; j++){
            if(j == oldFacility){
                continue;
            }
            if( openFac[j] && facilityRestCapacity[j] >= demandVec[randCutomer]
                    && nowArrangeCost + allocateCostVec[j][randCutomer] <= bestCost ){
                bestCost = nowArrangeCost + allocateCostVec[j][randCutomer] ;
                bestFacility = j;
            }
        }

        if(bestFacility != -1 ){
            if(canAccept(lastCost , bestCost) ){
                result[randCutomer] = bestFacility;
                return bestCost;
            }else{
                return lastCost;
            }
        }else{
            return lastCost;
        }
    }


    void swapTwoAlloc(vector<int>& result , int customer1 , int customer2 ){
        int tmpAlocFac = result[customer1];
        result[customer1] = result[customer2];
        result[customer2] = tmpAlocFac;
    }

    //根据新旧两个值，判断是否退火接受
    bool canAccept(double oldValue , double newValue){
        if(oldValue > newValue){
            return true;
        }else{
            double energy = (newValue - oldValue) / oldValue;
            double pickPossibility =  exp(- energy / temperature) ;
            if( (double)rand() / RAND_MAX < pickPossibility ){
                return true;
            }else{
                return false;
            }
        }
    }
};

结果详情

贪心算法结果详情

../Instances/p1 result:
customer arrange: 8 8 1 5 3 8 2 4 4 1 9 0 3 2 0 3 4 0 9 4 3 4 9 4 2 5 1 5 0 5 2 5 0 3 9 4 4 3 0 4 1 8 1 5 4 0 2 0 4 3
facility : 1 1 1 1 1 1 0 0 1 1
cost is 9142
this case waste time is 0.003 s
===================================================================
../Instances/p2 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 0 3 2 0 3 4 0 9 4 3 4 6 4 2 5 1 5 0 5 2 6 0 3 9 4 4 3 0 4 1 8 1 5 4 0 2 0 4 3
facility : 1 1 1 1 1 1 1 0 1 1
cost is 8104
this case waste time is 0.142 s
===================================================================
../Instances/p3 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 0 3 2 0 3 4 0 6 4 3 4 6 4 2 5 1 5 0 5 2 6 0 3 4 4 4 3 0 2 1 8 1 5 4 0 2 0 2 3
facility : 1 1 1 1 1 1 1 0 1 0
cost is 9824
this case waste time is 0.012 s
===================================================================
../Instances/p4 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 0 3 2 0 3 4 0 6 4 3 4 6 4 2 6 1 1 0 1 2 6 0 3 4 4 4 3 0 2 3 8 3 6 4 0 2 0 2 2
facility : 1 1 1 1 1 0 1 0 1 0
cost is 11261
this case waste time is 0.004 s
===================================================================
../Instances/p5 result:
customer arrange: 8 8 1 5 3 8 2 4 4 1 9 8 3 2 8 3 4 0 9 7 3 8 9 4 2 5 1 5 0 5 2 5 0 3 9 4 4 3 0 4 1 8 1 5 7 0 2 0 7 1
facility : 1 1 1 1 1 1 0 1 1 1
cost is 9348
this case waste time is 0.008 s
===================================================================
../Instances/p6 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 4 0 9 7 3 8 6 4 2 5 1 5 0 5 2 6 0 3 9 4 4 3 0 4 1 8 1 5 7 0 2 0 7 1
facility : 1 1 1 1 1 1 1 1 1 1
cost is 8061
this case waste time is 0.001 s
===================================================================
../Instances/p7 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 7 3 8 6 4 2 5 1 5 0 5 2 6 0 3 4 4 7 3 0 4 1 8 1 5 7 0 2 0 7 1
facility : 1 1 1 1 1 1 1 1 1 0
cost is 9905
this case waste time is 0.002 s
===================================================================
../Instances/p8 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 7 3 8 6 4 2 5 1 5 0 5 2 6 0 3 4 4 7 3 0 4 1 8 1 5 7 0 2 0 7 1
facility : 1 1 1 1 1 1 1 1 1 0
cost is 11705
this case waste time is 0.001 s
===================================================================
../Instances/p9 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 4 3 8 6 4 2 6 1 1 0 1 2 6 0 3 4 4 4 3 0 4 1 8 1 6 4 0 2 0 2 0
facility : 1 1 1 1 1 0 1 0 1 0
cost is 8598
this case waste time is 0.002 s
===================================================================
../Instances/p10 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 7 3 8 6 4 2 6 1 1 0 1 2 6 0 3 4 4 4 3 0 4 1 8 1 6 7 0 4 0 4 0
facility : 1 1 1 1 1 0 1 1 1 0
cost is 7617
this case waste time is 0.001 s
===================================================================
../Instances/p11 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 4 3 8 6 4 2 6 1 1 0 1 2 6 0 3 4 4 4 3 0 4 1 8 1 6 4 0 2 0 2 0
facility : 1 1 1 1 1 0 1 0 1 0
cost is 9064
this case waste time is 0.007 s
===================================================================
../Instances/p12 result:
customer arrange: 8 8 1 6 1 8 2 4 4 1 4 8 0 2 8 0 4 0 6 4 1 8 6 4 2 6 1 1 0 1 2 6 0 0 4 4 4 0 0 4 1 8 1 6 4 0 2 0 2 8
facility : 1 1 1 0 1 0 1 0 1 0
cost is 10301
this case waste time is 0.002 s
===================================================================
../Instances/p13 result:
customer arrange: 0 12 10 10 1 12 17 13 12 17 15 19 1 6 13 12 15 10 17 6 12 15 15 19 6 17 0 17 1 17 13 15 13 0 1 10 8 19 19 13 6 0 15 0 8 13 12 10 19 8
facility : 1 1 0 0 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1
cost is 8505
this case waste time is 0.002 s
===================================================================
../Instances/p14 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 6 13 3 15 10 17 6 14 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 16 16 3 13 14 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 1 1 0 1
cost is 7169
this case waste time is 0.003 s
===================================================================
../Instances/p15 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 6 13 3 15 10 17 6 15 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 16 16 3 13 10 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 8892
this case waste time is 0.003 s
===================================================================
../Instances/p16 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 6 13 3 15 10 17 6 15 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 16 16 3 13 10 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 10492
this case waste time is 0.006 s
===================================================================
../Instances/p17 result:
customer arrange: 0 1 10 10 1 15 17 13 14 17 15 19 1 6 13 14 15 10 17 6 14 15 15 19 6 17 0 17 1 17 13 15 13 0 1 10 8 19 19 13 6 0 0 15 8 13 14 10 19 8
facility : 1 1 0 0 0 0 1 0 1 0 1 0 0 1 1 1 0 1 0 1
cost is 8515
this case waste time is 0.004 s
===================================================================
../Instances/p18 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 6 13 3 15 10 17 6 14 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 15 16 3 13 14 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 1 1 0 1
cost is 7152
this case waste time is 0.002 s
===================================================================
../Instances/p19 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 6 13 3 15 10 17 6 14 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 15 16 3 13 14 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 1 1 0 1
cost is 8952
this case waste time is 0.003 s
===================================================================
../Instances/p20 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 6 13 3 15 10 17 6 15 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 16 10 3 13 10 6 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 10707
this case waste time is 0.003 s
===================================================================
../Instances/p21 result:
customer arrange: 0 1 10 10 1 15 17 13 14 17 15 1 1 10 13 14 15 10 17 9 14 15 15 13 9 17 0 17 1 17 13 15 13 0 1 10 17 1 1 13 10 0 0 0 9 13 14 10 1 9
facility : 1 1 0 0 0 0 0 0 0 1 1 0 0 1 1 1 0 1 0 0
cost is 8114
this case waste time is 0.002 s
===================================================================
../Instances/p22 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 10 13 3 15 10 17 9 14 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 10 16 15 16 3 13 14 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 1
cost is 7120
this case waste time is 0.002 s
===================================================================
../Instances/p23 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 10 13 3 15 10 17 9 15 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 10 16 15 16 3 13 15 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 1
cost is 8774
this case waste time is 0.003 s
===================================================================
../Instances/p24 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 10 13 3 15 10 17 9 15 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 10 16 15 16 3 13 15 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 1
cost is 10374
this case waste time is 0.004 s
===================================================================
../Instances/p25 result:
customer arrange: 20 11 20 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 11 2 0 5 17 5 8 2 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 8 24 14 0 20 11 8 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 0 11 0 5 2 2 11 20 8 0 14 11 2 5 0 11 14 8 14 14 2 11 11 11 24 24 24 24 5 8 11 20 8 0 5 24 0 5 0 11 24 5 8 14 0 5 20 0 0 8 20 14 8 11 11 5 0 24
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 12167
this case waste time is 0.011 s
===================================================================
../Instances/p26 result:
customer arrange: 20 11 20 2 20 5 2 24 14 17 24 16 20 20 17 14 14 17 5 11 2 0 5 17 5 20 2 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 16 24 14 0 20 11 14 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 0 11 0 5 2 2 11 16 16 0 14 11 2 5 0 11 14 14 14 14 2 11 11 11 24 24 24 24 5 16 11 20 16 0 5 24 0 5 0 11 24 5 20 14 0 5 20 0 0 20 20 14 20 11 11 5 0 24
facility : 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 11314
this case waste time is 0.013 s
===================================================================
../Instances/p27 result:
customer arrange: 20 11 20 2 20 5 2 24 14 17 24 16 20 20 17 14 14 17 5 11 2 0 5 17 5 20 2 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 16 24 14 0 20 11 14 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 0 11 0 5 2 2 11 16 16 0 14 11 2 5 0 11 14 14 14 14 2 11 11 11 24 24 24 24 5 16 11 20 16 0 5 24 0 5 0 11 24 5 20 14 0 5 20 0 0 20 20 14 20 11 11 5 0 24
facility : 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 13114
this case waste time is 0.016 s
===================================================================
../Instances/p28 result:
customer arrange: 20 11 20 2 20 5 2 24 14 17 24 20 20 20 17 14 14 17 5 11 2 0 5 17 5 20 2 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 14 24 14 0 20 11 14 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 0 11 0 5 2 2 11 20 20 0 14 11 2 5 0 11 14 14 14 14 2 11 11 11 24 24 24 24 5 20 11 20 20 0 5 24 0 5 0 11 24 5 20 14 0 5 20 0 0 14 14 14 0 11 11 5 0 24
facility : 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 14752
this case waste time is 0.035 s
===================================================================
../Instances/p29 result:
customer arrange: 20 11 13 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 11 2 0 5 17 5 8 2 24 5 24 5 25 13 25 20 20 24 15 0 14 0 14 15 8 24 14 0 13 11 8 5 14 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 8 24 20 14 24 20 0 13 17 17 17 17 0 20 5 2 24 17 11 17 5 2 2 25 13 8 17 17 25 2 25 17 11 14 8 14 14 2 11 11 25 24 24 5 5 5 8 25 13 8 0 25 15 0 25 0 11 24 25 8 14 0 25 20 0 0 8 20 2 8 25 25 11 2 11
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 13672
this case waste time is 0.087 s
===================================================================
../Instances/p30 result:
customer arrange: 20 11 13 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 11 2 0 5 17 5 8 2 24 5 24 5 25 13 25 20 20 24 15 0 14 0 14 15 8 24 14 0 13 11 8 5 14 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 8 24 20 14 24 20 0 13 17 17 17 17 0 20 5 2 24 17 11 17 5 2 2 25 13 8 17 17 25 2 25 17 11 14 8 14 14 2 11 11 25 24 24 5 5 5 8 25 13 8 0 25 15 0 25 0 11 24 25 8 14 0 25 20 0 0 8 20 2 8 25 25 11 2 11
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 12217
this case waste time is 0.031 s
===================================================================
../Instances/p31 result:
customer arrange: 20 11 13 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 11 2 0 5 17 5 8 2 24 5 24 5 25 13 25 20 20 24 15 0 14 0 14 15 8 24 14 0 13 11 8 5 14 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 8 24 20 14 24 20 0 13 17 17 17 17 0 20 5 2 24 17 11 17 5 2 2 25 13 8 17 17 25 2 25 17 11 14 8 14 14 2 11 11 25 24 24 5 5 5 8 25 13 8 0 25 15 0 25 0 11 24 25 8 14 0 25 20 0 0 8 20 2 8 25 25 11 2 11
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 14617
this case waste time is 0.028 s
===================================================================
../Instances/p32 result:
customer arrange: 20 11 13 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 11 2 0 5 17 5 8 2 24 5 24 5 25 13 25 20 20 24 24 0 14 0 14 24 8 24 14 0 13 11 8 5 14 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 8 24 20 14 24 20 0 13 17 17 17 17 0 20 5 2 24 17 11 17 5 2 2 25 13 8 17 17 25 2 25 17 11 14 8 14 14 2 11 11 25 5 5 5 11 5 8 25 13 8 0 25 25 0 25 0 11 11 25 8 14 0 25 20 0 0 8 20 2 8 25 25 11 2 0
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 16953
this case waste time is 0.029 s
===================================================================
../Instances/p33 result:
customer arrange: 20 11 20 14 20 5 17 24 14 17 24 8 8 20 17 14 14 17 5 11 14 0 5 17 5 8 17 24 5 24 5 11 6 11 20 20 24 24 0 14 0 14 24 8 24 14 0 20 11 8 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 6 11 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 11 17 5 14 14 11 20 8 17 17 11 17 5 17 11 14 8 14 14 0 11 11 11 24 24 24 24 5 8 11 20 8 0 5 5 0 5 0 11 24 5 8 14 17 5 20 0 0 8 20 14 8 11 11 5 0 11
facility : 1 0 0 0 0 1 1 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 12143
this case waste time is 0.027 s
===================================================================
../Instances/p34 result:
customer arrange: 20 25 20 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 0 2 0 5 17 5 8 2 24 5 24 5 25 20 25 20 20 24 24 0 14 0 14 24 8 24 14 0 20 25 8 5 14 14 5 20 20 17 25 0 14 0 5 20 0 0 25 24 0 5 24 20 20 5 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 17 0 17 5 2 2 25 20 8 17 17 25 2 25 17 0 14 8 14 14 2 0 25 25 24 24 24 24 5 8 25 20 8 0 5 5 0 25 0 0 24 5 8 14 17 5 8 17 0 8 8 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 11131
this case waste time is 0.036 s
===================================================================
../Instances/p35 result:
customer arrange: 20 25 20 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 0 2 0 5 17 5 8 2 24 5 24 5 25 20 25 20 20 24 24 0 14 0 14 24 8 24 14 0 20 25 8 5 14 14 5 20 20 17 25 0 14 0 5 20 0 0 25 24 0 5 24 20 20 5 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 17 0 17 5 2 2 25 20 8 17 17 25 2 25 17 0 14 8 14 14 2 0 25 25 24 24 24 24 5 8 25 20 8 0 5 5 0 25 0 0 24 5 8 14 17 5 8 17 0 8 8 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 12931
this case waste time is 0.028 s
===================================================================
../Instances/p36 result:
customer arrange: 20 25 20 2 20 5 2 24 14 17 24 8 8 20 17 14 14 17 5 0 2 0 5 17 5 8 2 24 5 24 5 25 20 25 20 20 24 24 0 14 0 14 24 8 24 14 0 20 25 8 5 14 14 5 20 20 17 25 0 14 0 5 20 0 0 25 24 0 5 24 20 20 5 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 17 0 17 5 2 2 25 20 8 17 17 25 2 25 17 0 14 8 14 14 2 0 25 25 24 24 24 24 5 8 25 20 8 0 5 5 0 25 0 0 24 5 8 14 17 5 8 17 0 8 8 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 14731
this case waste time is 0.025 s
===================================================================
../Instances/p37 result:
customer arrange: 20 0 20 14 20 5 17 24 14 17 24 20 20 20 17 14 14 17 5 0 14 0 5 17 5 20 17 24 5 24 5 5 20 5 20 20 24 24 0 14 0 14 24 14 24 14 0 20 0 14 5 14 14 5 20 20 17 0 0 14 0 5 20 0 0 0 24 0 5 24 20 20 5 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 0 17 5 14 14 5 20 20 17 17 0 17 5 17 0 14 14 14 14 17 0 0 0 24 24 24 24 5 20 5 20 20 0 5 24 0 5 0 0 24 5 20 14 17 5 20 17 0 20 14 14 14 0 0 5 17 5
facility : 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 11521
this case waste time is 0.025 s
===================================================================
../Instances/p38 result:
customer arrange: 20 11 20 14 20 5 17 24 14 17 24 20 20 20 17 14 14 17 5 11 14 0 5 17 5 20 17 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 14 24 14 0 20 11 14 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 5 24 20 20 11 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 11 17 5 14 14 11 20 20 17 17 11 17 5 17 11 14 14 14 14 17 11 11 11 24 24 24 24 5 20 11 20 20 0 5 24 0 5 0 11 24 5 20 14 17 5 20 17 0 20 14 14 14 11 11 5 17 5
facility : 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 10800
this case waste time is 0.06 s
===================================================================
../Instances/p39 result:
customer arrange: 20 0 20 14 20 5 17 24 14 17 24 20 20 20 17 14 14 17 5 0 14 0 5 17 5 20 17 24 5 24 5 5 20 5 20 20 24 24 0 14 0 14 24 14 24 14 0 20 0 14 5 14 14 5 20 20 17 0 0 14 0 5 20 0 0 0 24 0 5 24 20 20 5 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 0 17 5 14 14 5 20 20 17 17 0 17 5 17 0 14 14 14 14 17 0 0 0 24 24 24 24 5 20 5 20 20 0 5 24 0 5 0 0 24 5 20 14 17 5 20 17 0 20 14 14 14 0 0 5 17 5
facility : 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 12073
this case waste time is 0.019 s
===================================================================
../Instances/p40 result:
customer arrange: 20 0 20 14 20 5 17 24 14 17 24 20 20 20 17 14 14 17 5 0 14 0 5 17 5 20 17 24 5 24 5 5 20 5 20 20 24 24 0 14 0 14 24 14 24 14 0 20 0 14 5 14 14 5 20 20 17 0 0 14 0 5 20 0 0 0 24 0 5 24 20 20 5 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 0 17 5 14 14 5 20 20 17 17 0 17 5 17 0 14 14 14 14 17 0 0 0 24 24 24 24 5 20 5 20 20 0 5 24 0 5 0 0 24 5 20 14 17 5 20 17 0 20 14 14 14 0 0 5 17 5
facility : 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 13273
this case waste time is 0.011 s
===================================================================
../Instances/p41 result:
customer arrange: 5 6 4 6 2 5 3 3 5 3 4 6 2 6 2 2 5 3 0 6 6 6 4 4 6 5 5 4 5 5 0 0 0 0 3 2 2 6 6 2 2 3 3 3 3 5 0 5 6 4 4 6 6 6 2 2 2 3 3 3 0 0 6 5 0 6 6 6 4 4 0 4 4 0 3 2 2 2 6 5 5 2 2 2 2 2 2 2 2 2
facility : 1 0 1 1 1 1 1 0 0 0
cost is 6810
this case waste time is 0.002 s
===================================================================
../Instances/p42 result:
customer arrange: 11 14 11 14 19 19 0 11 17 17 11 19 19 14 19 0 0 17 14 14 14 11 14 11 11 11 11 17 17 11 0 19 19 14 14 19 19 0 0 0 0 11 17 0 11 14 19 19 0 19 17 17 17 17 17 11 17 11 14 11 11 11 11 11 11 11 0 0 19 19 19 19 19 19 19 19 19 19 19 19
facility : 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 1
cost is 5781
this case waste time is 0.003 s
===================================================================
../Instances/p43 result:
customer arrange: 6 21 6 29 13 17 13 21 29 29 29 13 13 17 6 6 21 21 21 21 13 17 21 17 17 13 29 6 29 29 29 13 13 13 21 17 13 21 21 6 6 6 29 29 29 13 13 17 17 6 17 21 17 6 6 6 17 17 13 29 29 29 29 29 29 29 29 29 29 29
facility : 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1
cost is 5527
this case waste time is 0.006 s
===================================================================
../Instances/p44 result:
customer arrange: 4 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 1 1 1 1 1 7 6 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 6 8 8 8 8 7 5 9 9 7 6 5 5 8 8 7 7 9 5 5 5 9 3 0 6 6 8 1 5 4 9 9 7 7 9 6 6 5 2 7 9 7 9 9 7 6 5 7 5
facility : 1 1 1 1 1 1 1 1 1 1
cost is 7585
this case waste time is 0.001 s
===================================================================
../Instances/p45 result:
customer arrange: 0 0 0 0 0 0 0 15 15 15 15 15 15 15 15 2 2 2 2 2 2 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 0 0 2 2 4 2 15 14 13 13 15 5 13 13 14 13 13 0 14 15 9 9 2 9 15 13 13 13 13 4 9 9 15 2 13 13 14 14 14 14 9 13
facility : 1 0 1 0 1 1 0 0 0 1 0 0 0 1 1 1 0 0 0 0
cost is 6458
this case waste time is 0.003 s
===================================================================
../Instances/p46 result:
customer arrange: 10 10 10 10 10 10 10 15 22 22 15 22 22 22 22 2 2 2 2 2 2 5 5 5 5 5 5 9 9 9 9 9 9 13 10 2 2 5 14 22 22 15 15 22 14 14 14 14 13 22 10 13 13 22 2 14 13 22 14 14 15 15 22 14 13 13 14 13 15 15
facility : 0 0 1 0 0 1 0 0 0 1 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0
cost is 6065
this case waste time is 0.008 s
===================================================================
../Instances/p47 result:
customer arrange: 0 0 0 0 0 0 0 0 0 0 1 1 1 1 2 2 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 7 7 6 7 6 0 7 7 7 7 7 8 8 8 8 8 9 8 0 9 9 9 9 2 2 2 9 2
facility : 1 1 1 1 1 1 1 1 1 1
cost is 6634
this case waste time is 0.001 s
===================================================================
../Instances/p48 result:
customer arrange: 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 8 8 8 8 8 8 8 8 8 6 5 10 10 10 10 10 10 13 13 13 13 13 13 13 14 14 13 14 13 0 14 14 14 14 17 17 17 17 17 17 17 17 19 19 19 19 19 19 19
facility : 1 0 0 1 0 1 1 0 1 0 1 0 0 1 1 0 0 1 0 1
cost is 5613
this case waste time is 0.003 s
===================================================================
../Instances/p49 result:
customer arrange: 0 0 0 0 0 0 0 0 5 5 5 5 5 6 6 6 6 6 6 6 6 6 9 9 9 9 9 14 14 14 14 14 14 14 14 14 17 17 17 17 17 17 20 20 20 20 20 20 21 20 21 20 0 21 21 21 21 26 26 26 26 26 26 26 28 28 28 28 28 0
facility : 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0
cost is 5322
this case waste time is 0.006 s
===================================================================
../Instances/p50 result:
customer arrange: 3 6 3 0 9 9 5 5 3 7 7 0 9 9 9 9 9 2 5 3 0 0 0 0 0 0 7 3 3 7 7 7 3 3 3 5 9 2 0 6 0 9 9 2 5 5 5 5 5 3 3 5 6 0 0 0 6 6 2 2 2 7 7 7 3 3 6 3 7 7 3 6 6 6 6 3 3 3 3 3 3 5 2 2 2 2 6 7 2 7 2 2 2 2 2 2 2 2 2 2
facility : 1 0 1 1 0 1 1 1 0 1
cost is 9454
this case waste time is 0.001 s
===================================================================
../Instances/p51 result:
customer arrange: 15 6 19 10 12 13 5 5 15 5 5 19 6 13 6 13 12 5 5 15 10 10 10 19 10 10 15 19 19 15 5 15 19 19 15 5 13 13 10 10 10 13 13 13 12 5 5 5 5 15 15 5 10 10 10 10 6 6 13 12 13 5 5 5 15 15 10 19 15 15 15 10 10 10 10 19 19 19 19 19 19 12 12 12 13 13 6 5 12 15 13 13 13 6 6 13 6 6 6 6
facility : 0 0 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 0 0 1
cost is 7633
this case waste time is 0.003 s
===================================================================
../Instances/p52 result:
customer arrange: 7 7 7 7 7 7 7 7 3 4 4 4 3 4 4 4 4 8 8 8 8 3 8 3 3 9 9 9 9 9 9 9 9 5 6 6 6 6 6 6 6 6 6 6 7 7 4 5 5 5 5 3 4 6 7 5 3 3 3 4 6 5 5 5 3 5 5 6 4 7 6 6 4 3 3 5 3 4 7 1 6 3 3 5 5 3 3 7 5 3 1 1 1 1 5 1 3 4 3 7
facility : 0 1 0 1 1 1 1 1 1 1
cost is 9588
this case waste time is 0.001 s
===================================================================
../Instances/p53 result:
customer arrange: 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 12 12 12 12 3 3 12 3 9 9 9 9 9 9 9 9 15 18 18 18 18 18 18 18 18 18 18 5 5 7 12 3 15 15 3 7 18 5 15 3 3 3 7 18 15 15 15 3 3 15 5 7 5 18 18 7 3 3 15 3 7 7 15 18 7 3 15 15 3 3 7 15 3 15 15 18 18 15 18 3 7 3 5
facility : 0 0 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 0 1 0
cost is 8607
this case waste time is 0.003 s
===================================================================
../Instances/p54 result:
customer arrange: 9 9 9 9 9 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 6 6 8 8 6 8 8 8 8 8 8 3 6 6 6 6 6 6 6 6 6 6 5 5 6 5 5 5 6 6 0 0 0 0 0 9 0 0 0 0 0 4 4 4 4 4 4 4 4 4 4 4 9 4 9 4 4 2 4 2 2
facility : 1 0 1 1 1 1 1 0 1 1
cost is 9702
this case waste time is 0.002 s
===================================================================
../Instances/p55 result:
customer arrange: 18 18 18 18 18 18 18 2 2 2 2 2 2 2 2 2 2 2 2 12 12 12 12 6 12 2 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 6 7 7 6 7 7 7 7 7 7 7 7 7 7 13 7 13 7 7 7 7 13 13 7 13 13 18 13 13 13 13 13 15 15 15 15 15 15 15 15 15 15 15 18 18 18 18 18 18 18 18 18
facility : 0 0 1 0 0 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0
cost is 8090
this case waste time is 0.004 s
===================================================================
../Instances/p56 result:
customer arrange: 7 19 21 27 2 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 16 23 24 10 27 27 19 4 2 19 19 4 16 27 6 8 8 24 16 7 9 6 4 8 19 3 21 19 14 24 16 24 16 8 6 25 9 22 7 4 0 7 8 3 25 23 14 28 25 7 12 19 9 23 23 10 23 8 16 10 0 9 25 4 10 6 2 27 7 28 6 25 25 2 3 28 6 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 14 8 9 25 28 19 9 16 2 12 19 0 28 24 25 10 23 9 3 3 28 10 12 22 12 25 25 2 24 21 27 25 24 0 23 0 8 28 2 16 3 3 3 27 10 24 23 27 23 4 3 21 23 8 19 14 4 2 0 10 4 10 2 21 2 19 12 8 28 23 0 21 2 21 6 4 7 12 7 21 14 19
facility : 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 1 1 1 1 1 0 1 1 0
cost is 21429
this case waste time is 0.011 s
===================================================================
../Instances/p57 result:
customer arrange: 7 19 21 27 2 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 21 23 24 10 27 27 19 4 2 19 19 4 21 27 6 8 8 24 21 7 8 6 4 8 19 3 21 19 14 24 24 24 21 8 6 25 8 22 7 4 0 7 8 3 25 23 14 28 25 7 12 19 8 23 23 10 23 8 24 10 0 8 25 4 10 6 2 27 7 28 6 25 25 2 3 28 6 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 14 8 14 25 28 19 4 21 2 12 19 0 28 24 25 10 23 8 3 3 28 10 12 22 12 25 25 2 24 21 27 25 24 0 23 0 8 28 2 21 3 3 3 27 10 24 23 27 23 4 3 21 23 10 19 14 4 2 0 10 4 10 2 21 2 19 12 3 28 23 0 21 2 2 6 6 7 12 7 2 14 19
facility : 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 0 1 1 0
cost is 27059
this case waste time is 0.012 s
===================================================================
../Instances/p58 result:
customer arrange: 7 19 21 27 2 12 21 27 27 28 4 28 10 3 28 7 3 10 27 0 27 21 23 24 10 27 27 19 4 2 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 14 24 24 24 21 8 12 25 8 27 7 4 0 7 8 3 25 23 14 28 25 7 12 19 8 23 23 10 23 8 24 10 0 8 25 4 10 19 2 27 7 28 19 25 25 2 3 28 12 0 28 28 21 25 7 4 0 4 24 27 3 19 4 27 12 12 8 28 7 14 8 14 25 28 19 4 21 2 12 19 0 28 24 25 10 23 8 3 3 28 10 12 27 12 25 25 2 24 21 24 25 24 0 23 0 8 28 2 21 3 3 3 0 10 2 23 24 23 4 3 21 23 10 19 14 4 2 0 10 4 10 2 21 2 28 25 3 0 23 0 21 2 23 12 14 7 7 7 23 14 14
facility : 1 0 1 1 1 0 0 1 1 0 1 0 1 0 1 0 0 0 0 1 0 1 0 1 1 1 0 1 1 0
cost is 38975
this case waste time is 0.014 s
===================================================================
../Instances/p59 result:
customer arrange: 18 19 2 27 2 12 2 27 18 28 4 28 13 13 28 18 13 20 27 0 18 16 23 24 10 18 27 19 4 2 19 19 4 16 27 6 20 8 24 16 18 8 6 4 8 19 13 2 19 20 24 16 24 16 8 6 25 8 18 25 4 0 18 8 13 25 23 19 28 25 18 12 19 8 23 23 20 23 8 16 10 0 8 25 4 13 6 2 27 25 28 6 25 25 2 13 28 6 0 28 28 16 25 18 4 0 4 24 27 13 19 4 27 12 12 8 28 25 0 8 20 25 28 19 4 16 2 12 19 0 28 24 25 20 23 8 13 13 28 10 12 27 12 25 25 2 24 16 27 12 24 0 23 0 8 28 2 16 13 13 13 27 10 24 23 27 23 4 13 2 23 20 19 10 4 2 0 10 4 10 2 16 24 6 12 8 28 23 0 16 2 16 6 6 18 12 18 16 10 6
facility : 1 0 1 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 0 0 1 1 1 0 1 1 0
cost is 28730
this case waste time is 0.014 s
===================================================================
../Instances/p60 result:
customer arrange: 7 19 21 27 21 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 16 5 24 10 27 27 19 4 21 19 19 4 16 27 12 8 8 24 16 7 8 12 4 8 19 3 21 19 10 24 16 24 16 8 12 25 8 22 7 4 0 7 8 3 25 5 19 28 25 7 12 19 8 5 10 10 5 8 16 10 0 8 25 4 10 19 5 27 7 28 19 25 25 0 3 28 12 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 0 8 8 25 28 19 4 16 21 12 19 0 28 24 25 10 5 8 3 3 28 10 12 22 12 25 25 5 24 21 27 25 24 0 10 0 8 28 5 16 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 21 0 10 4 10 5 21 21 19 12 8 28 10 0 21 21 21 19 4 7 12 7 21 10 19
facility : 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0
cost is 20605
this case waste time is 0.016 s
===================================================================
../Instances/p61 result:
customer arrange: 7 19 21 27 21 12 21 27 27 28 4 28 10 3 28 7 3 10 27 0 27 16 5 0 10 27 27 19 4 21 19 19 4 16 27 12 8 8 16 16 7 8 12 4 8 19 3 21 19 10 0 16 21 16 8 12 7 8 27 7 4 0 7 8 3 12 5 19 28 12 7 12 19 8 5 10 10 5 8 16 10 0 8 7 4 10 19 5 27 7 28 19 7 7 0 3 28 12 0 28 28 21 12 7 4 0 4 27 27 3 19 4 27 12 12 8 28 7 0 8 8 12 28 19 4 16 21 12 19 0 28 21 12 10 5 8 3 3 28 10 12 27 12 12 7 5 16 21 27 7 27 0 10 0 8 28 5 16 3 3 3 27 10 0 5 27 5 4 3 21 5 8 19 10 4 21 0 10 4 10 5 21 21 19 12 8 28 10 0 21 21 21 19 4 7 19 7 21 10 19
facility : 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 1 0 0 0 0 0 1 1 0
cost is 24961
this case waste time is 0.02 s
===================================================================
../Instances/p62 result:
customer arrange: 7 19 16 27 5 12 16 27 27 28 4 28 10 3 28 7 3 10 27 0 27 16 5 0 10 27 27 19 4 5 19 19 4 16 27 12 8 8 16 16 7 8 12 4 8 19 3 16 19 10 0 16 0 16 8 12 7 8 27 7 4 0 7 8 3 12 5 19 28 12 7 12 19 8 5 10 10 5 8 16 10 0 8 7 4 10 19 5 27 7 28 19 7 7 0 3 28 12 0 28 28 16 12 7 4 0 4 27 27 3 19 4 27 12 12 8 28 7 0 8 8 12 28 19 4 16 5 12 19 0 28 16 12 10 5 8 3 3 28 10 12 27 12 12 7 5 16 16 27 7 27 0 10 0 8 28 5 16 3 3 3 27 10 0 5 27 5 4 3 16 5 8 19 10 4 0 0 10 4 10 5 16 0 19 12 8 28 10 28 16 5 16 19 4 7 19 7 5 10 19
facility : 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 1 0
cost is 33690
this case waste time is 0.014 s
===================================================================
../Instances/p63 result:
customer arrange: 18 6 2 24 2 6 2 28 18 28 4 28 13 13 28 18 13 13 24 24 18 16 23 24 23 18 24 28 4 2 6 4 4 16 28 6 8 8 24 16 18 8 6 4 8 4 13 2 6 17 24 16 24 16 8 6 25 8 18 25 4 2 18 8 13 25 23 17 28 25 18 6 6 8 23 23 8 23 8 16 23 17 8 25 4 13 6 2 24 25 28 6 25 25 2 13 28 6 17 28 28 16 25 18 4 24 4 24 16 13 6 4 18 6 6 8 28 25 17 8 8 25 17 6 4 16 2 28 4 17 28 24 25 8 23 8 13 13 28 17 6 18 28 25 25 2 24 16 18 25 24 17 23 17 8 28 2 16 13 13 13 24 23 24 23 24 23 4 13 2 23 8 28 17 4 2 17 23 4 23 2 16 2 6 6 8 28 23 17 2 2 2 6 4 25 25 25 2 23 28
facility : 0 0 1 0 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 0 0 0 0 1 1 1 0 0 1 0
cost is 25399
this case waste time is 0.021 s
===================================================================
../Instances/p64 result:
customer arrange: 7 19 21 27 21 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 21 5 24 10 27 27 19 4 21 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 25 8 22 7 4 0 7 8 3 25 5 19 28 25 7 12 19 8 5 10 10 5 8 24 10 0 8 25 4 10 19 5 27 7 28 19 25 25 0 3 28 12 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 0 8 8 25 28 19 4 21 21 12 19 0 28 24 25 10 5 8 3 3 28 10 12 22 12 25 25 5 24 21 27 25 24 0 10 0 8 28 5 21 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 21 0 10 4 10 5 21 21 19 12 8 28 10 0 21 21 21 19 4 7 12 7 21 10 19
facility : 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 1 0 1 1 0 1 1 0
cost is 20530
this case waste time is 0.024 s
===================================================================
../Instances/p65 result:
customer arrange: 7 19 21 27 21 12 21 27 27 28 4 28 10 3 28 7 3 10 27 27 27 21 5 24 10 27 27 19 4 21 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 7 8 27 7 4 24 7 8 3 12 5 19 28 12 7 12 19 8 5 10 10 5 8 24 10 5 8 7 4 10 19 5 27 7 28 19 7 7 5 3 28 12 10 28 28 21 12 7 4 24 4 24 27 3 19 4 27 12 12 8 28 7 28 8 8 12 28 19 4 21 21 12 19 28 28 24 12 10 5 8 3 3 28 10 12 27 12 12 7 5 24 21 27 7 24 28 10 28 8 28 5 21 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 21 24 10 4 10 5 21 21 19 12 8 28 10 27 21 21 21 19 4 7 12 7 21 10 19
facility : 0 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 0 0 1 0 0 1 1 0
cost is 24445
this case waste time is 0.017 s
===================================================================
../Instances/p66 result:
customer arrange: 7 28 21 27 21 12 21 27 27 28 4 28 10 5 28 7 10 10 27 27 27 21 5 27 10 27 27 28 4 21 4 4 4 21 27 12 8 8 27 21 7 8 12 4 8 4 8 21 28 10 27 21 21 21 8 12 7 8 27 7 4 5 7 8 8 12 5 28 28 12 7 12 4 8 5 10 10 5 8 21 10 5 8 7 4 10 4 5 27 7 28 4 7 7 5 8 28 12 10 28 28 21 12 7 4 27 4 27 27 8 4 4 27 12 12 8 28 7 28 8 8 12 28 4 4 21 21 12 4 28 28 21 12 10 5 8 8 8 28 10 12 27 12 12 7 5 27 21 27 7 27 28 10 28 8 28 5 21 8 8 10 27 10 21 5 27 5 4 8 21 5 8 28 10 4 21 28 10 4 10 5 21 21 28 12 8 28 10 27 21 21 21 12 4 7 12 7 21 10 28
facility : 0 0 0 0 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0
cost is 31669
this case waste time is 0.021 s
===================================================================
../Instances/p67 result:
customer arrange: 18 6 2 24 2 6 2 28 24 28 4 28 13 13 28 18 13 13 16 24 18 16 23 24 23 18 24 17 4 2 6 6 4 16 28 6 8 8 24 16 18 8 6 4 8 4 13 16 28 17 24 16 24 16 8 6 18 8 18 25 4 2 18 8 13 25 23 17 28 25 18 6 6 8 23 23 13 23 8 16 23 17 8 25 4 13 6 2 24 25 28 6 25 25 2 13 28 6 17 28 28 16 25 18 4 24 4 24 16 13 17 4 18 6 6 8 28 25 17 8 8 25 17 6 4 16 2 25 4 17 28 24 25 8 23 8 13 13 28 23 6 18 28 25 25 2 24 16 18 25 24 17 23 17 8 28 2 16 13 13 13 24 23 24 23 18 23 4 13 16 23 8 28 17 4 2 24 23 4 23 2 16 2 6 6 8 28 23 17 2 2 16 6 4 25 25 25 2 13 28
facility : 0 0 1 0 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 0 0 0 0 1 1 1 0 0 1 0
cost is 25032
this case waste time is 0.015 s
===================================================================
../Instances/p68 result:
customer arrange: 7 19 21 27 2 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 21 23 24 10 27 27 19 4 2 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 25 8 22 7 4 0 7 8 3 25 23 19 28 25 7 12 19 8 23 23 10 23 8 24 10 0 8 25 4 10 19 2 27 7 28 19 25 25 2 3 28 12 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 0 8 8 25 28 19 4 21 2 12 19 0 28 24 25 10 23 8 3 3 28 10 12 22 12 25 25 2 24 21 27 25 24 0 23 0 8 28 2 21 3 3 3 27 10 24 23 27 23 4 3 21 23 8 19 10 4 2 0 10 4 10 2 21 2 19 12 8 28 23 0 21 2 21 19 4 7 12 7 21 10 19
facility : 1 0 1 1 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 1 1 1 1 0 1 1 0
cost is 20735
this case waste time is 0.015 s
===================================================================
../Instances/p69 result:
customer arrange: 7 19 21 27 21 12 21 27 27 28 4 28 10 3 28 7 3 10 27 0 27 21 23 0 10 27 27 19 4 21 19 19 4 21 27 12 8 8 27 21 7 8 12 4 8 19 3 21 19 10 0 21 21 21 8 12 7 8 27 7 4 0 7 8 3 12 23 19 28 12 7 12 19 8 23 23 10 23 8 21 10 0 8 7 4 10 19 0 27 7 28 19 7 7 0 3 28 12 0 28 28 21 12 7 4 0 4 27 27 3 19 4 27 12 12 8 28 7 0 8 8 12 28 19 4 21 21 12 19 0 28 21 12 10 23 8 3 3 28 10 12 27 12 12 7 23 27 21 27 7 27 0 23 0 8 28 21 21 3 3 3 27 10 0 23 27 23 4 3 21 23 8 19 10 4 21 0 10 4 10 23 21 21 19 12 8 28 23 0 21 21 21 19 4 7 12 7 21 10 19
facility : 1 0 0 1 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 1 1 0
cost is 24803
this case waste time is 0.015 s
===================================================================
../Instances/p70 result:
customer arrange: 7 19 21 27 21 12 21 27 27 28 4 28 10 3 28 7 3 10 27 0 27 21 23 0 10 27 27 19 4 21 19 19 4 21 27 12 8 8 27 21 7 8 12 4 8 19 3 21 19 10 0 21 21 21 8 12 7 8 27 7 4 0 7 8 3 12 23 19 28 12 7 12 19 8 23 23 10 23 8 21 10 0 8 7 4 10 19 0 27 7 28 19 7 7 0 3 28 12 0 28 28 21 12 7 4 0 4 27 27 3 19 4 27 12 12 8 28 7 0 8 8 12 28 19 4 21 21 12 19 0 28 21 12 10 23 8 3 3 28 10 12 27 12 12 7 23 27 21 27 7 27 0 23 0 8 28 21 21 3 3 3 27 10 0 23 27 23 4 3 21 23 8 19 10 4 21 0 10 4 10 23 21 21 19 12 8 28 23 0 21 21 21 19 4 7 12 7 21 10 19
facility : 1 0 0 1 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 1 1 0
cost is 33203
this case waste time is 0.021 s
===================================================================
../Instances/p71 result:
customer arrange: 18 19 2 24 2 12 2 28 18 28 4 28 13 13 28 18 13 13 24 24 18 16 23 24 23 18 24 19 4 2 19 19 4 16 28 12 8 8 24 16 18 8 12 4 8 19 13 2 19 17 24 16 24 16 8 12 25 8 18 25 4 2 18 8 13 25 23 17 28 25 18 12 19 8 23 23 8 23 8 16 23 17 8 25 4 13 19 2 24 25 28 19 25 25 2 13 28 12 17 28 28 16 25 18 4 24 4 24 16 13 19 4 18 12 12 8 28 25 17 8 8 25 17 19 4 16 2 12 19 17 28 24 25 8 23 8 13 13 28 17 12 18 12 25 25 2 24 16 18 25 24 17 23 17 8 28 2 16 13 13 13 24 23 2 23 18 23 4 13 2 13 8 19 17 4 2 17 13 4 8 2 16 2 19 12 8 12 23 17 16 2 2 19 4 25 12 25 16 8 19
facility : 0 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 1 0 0 0 1 1 1 0 0 1 0
cost is 26211
this case waste time is 0.013 s
===================================================================
71 cases cost sum is 961450

模拟退火算法结果详情

../Instances/p1 result:
customer arrange: 8 2 1 6 3 8 2 4 4 1 4 0 3 2 8 3 2 0 6 4 3 4 6 4 2 6 1 6 0 1 2 6 0 3 4 4 4 3 0 4 3 8 1 6 4 0 2 0 4 0
facility : 1 1 1 1 1 0 1 0 1 0
cost is 8848
this case waste time is 1.673 s
===================================================================
../Instances/p2 result:
customer arrange: 8 2 1 6 3 8 2 4 4 1 9 0 3 2 8 3 4 0 9 4 3 4 6 4 2 6 1 6 0 1 2 6 0 3 9 4 4 3 0 4 3 8 1 6 4 0 2 0 4 0
facility : 1 1 1 1 1 0 1 0 1 1
cost is 7913
this case waste time is 1.405 s
===================================================================
../Instances/p3 result:
customer arrange: 8 2 5 6 3 8 2 4 4 5 4 0 3 2 8 3 4 0 6 4 3 4 6 4 2 5 3 5 0 5 2 6 0 3 2 4 4 3 0 4 5 8 3 5 4 0 2 0 4 0
facility : 1 0 1 1 1 1 1 0 1 0
cost is 9487
this case waste time is 2.113 s
===================================================================
../Instances/p4 result:
customer arrange: 8 2 1 6 3 8 2 4 4 1 4 0 3 2 8 3 2 0 6 4 3 4 6 4 2 6 1 6 0 1 2 6 0 3 4 4 4 3 0 4 3 8 1 6 4 0 2 0 4 0
facility : 1 1 1 1 1 0 1 0 1 0
cost is 10714
this case waste time is 1.504 s
===================================================================
../Instances/p5 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 2 0 9 9 3 8 6 4 2 6 1 1 0 1 2 6 0 3 9 4 4 3 0 4 1 8 1 6 4 0 9 3 4 0
facility : 1 1 1 1 1 0 1 0 1 1
cost is 8838
this case waste time is 1.448 s
===================================================================
../Instances/p6 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 4 0 9 7 3 8 6 4 2 6 1 1 0 1 2 6 0 3 9 4 4 3 0 4 1 8 1 6 7 0 2 3 7 0
facility : 1 1 1 1 1 0 1 1 1 1
cost is 7777
this case waste time is 1.5 s
===================================================================
../Instances/p7 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 2 0 9 9 3 8 6 4 2 6 1 1 0 1 2 6 0 3 9 4 4 3 0 4 1 8 1 6 4 0 9 3 4 0
facility : 1 1 1 1 1 0 1 0 1 1
cost is 9488
this case waste time is 2.043 s
===================================================================
../Instances/p8 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 2 0 9 9 3 8 6 4 2 6 1 1 0 1 2 6 0 3 9 4 4 3 0 4 1 8 1 6 4 0 9 3 4 0
facility : 1 1 1 1 1 0 1 0 1 1
cost is 11088
this case waste time is 1.477 s
===================================================================
../Instances/p9 result:
customer arrange: 8 8 1 6 1 8 2 4 4 1 4 8 0 2 8 0 2 0 6 4 1 8 6 4 2 6 1 1 8 1 2 6 0 0 4 4 4 1 0 4 1 8 1 6 4 0 2 0 4 0
facility : 1 1 1 0 1 0 1 0 1 0
cost is 8462
this case waste time is 1.39 s
===================================================================
../Instances/p10 result:
customer arrange: 8 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 7 3 8 6 4 2 6 1 1 0 1 2 6 0 3 4 4 4 3 0 4 1 8 1 6 7 0 4 0 4 0
facility : 1 1 1 1 1 0 1 1 1 0
cost is 7617
this case waste time is 1.585 s
===================================================================
../Instances/p11 result:
customer arrange: 8 8 1 6 1 8 2 4 4 1 4 8 0 2 8 0 2 0 6 4 1 8 6 4 2 6 1 1 8 1 2 6 0 0 4 4 4 1 0 4 1 8 1 6 4 0 2 0 4 0
facility : 1 1 1 0 1 0 1 0 1 0
cost is 8932
this case waste time is 1.656 s
===================================================================
../Instances/p12 result:
customer arrange: 8 8 1 6 1 8 2 4 4 1 4 8 0 2 8 0 2 0 6 4 1 8 6 4 2 6 1 1 8 1 2 6 0 0 4 4 4 1 0 4 1 8 1 6 4 0 2 0 4 0
facility : 1 1 1 0 1 0 1 0 1 0
cost is 10132
this case waste time is 1.459 s
===================================================================
../Instances/p13 result:
customer arrange: 0 12 10 10 19 12 17 13 12 17 15 19 19 10 13 3 15 10 17 9 12 15 15 19 9 17 0 17 3 17 13 15 13 0 3 10 3 19 19 13 9 0 15 0 3 13 12 10 19 9
facility : 1 0 0 1 0 0 0 0 0 1 1 0 1 1 0 1 0 1 0 1
cost is 8333
this case waste time is 1.498 s
===================================================================
../Instances/p14 result:
customer arrange: 16 3 10 10 19 13 17 13 14 17 15 19 19 10 13 3 15 10 17 9 14 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 9 16 15 16 3 13 14 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 1
cost is 7137
this case waste time is 2.387 s
===================================================================
../Instances/p15 result:
customer arrange: 16 3 10 10 19 13 17 13 3 17 15 19 19 6 13 3 15 10 17 6 15 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 16 16 3 13 15 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 8835
this case waste time is 1.489 s
===================================================================
../Instances/p16 result:
customer arrange: 16 3 10 10 19 13 17 13 3 17 15 19 19 10 13 3 15 10 17 9 15 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 9 16 16 16 3 13 15 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 1
cost is 10408
this case waste time is 1.473 s
===================================================================
../Instances/p17 result:
customer arrange: 16 12 10 10 12 12 17 13 12 17 15 19 19 10 13 12 15 10 17 9 12 15 15 19 9 19 16 17 12 17 13 15 13 16 12 10 17 19 19 13 9 16 15 16 9 13 12 10 19 9
facility : 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 1 0 1
cost is 8340
this case waste time is 1.456 s
===================================================================
../Instances/p18 result:
customer arrange: 16 12 10 10 19 12 17 13 12 17 15 19 19 10 13 3 15 10 17 9 12 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 9 16 15 16 3 13 12 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 1 1 0 1 1 1 0 1
cost is 7188
this case waste time is 1.924 s
===================================================================
../Instances/p19 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 10 13 3 15 10 17 9 14 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 9 16 15 16 3 13 14 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 1
cost is 8925
this case waste time is 1.504 s
===================================================================
../Instances/p20 result:
customer arrange: 16 3 10 10 19 13 17 13 3 17 15 19 19 6 13 3 15 10 17 6 15 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 15 16 3 13 10 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 10487
this case waste time is 1.636 s
===================================================================
../Instances/p21 result:
customer arrange: 16 12 10 10 19 12 17 13 12 17 15 19 19 10 13 12 15 10 17 9 12 15 15 19 9 17 16 17 12 17 13 15 13 16 12 10 17 19 19 13 10 16 15 16 9 13 12 10 19 9
facility : 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 1 0 1
cost is 8236
this case waste time is 2.046 s
===================================================================
../Instances/p22 result:
customer arrange: 16 3 10 10 19 15 17 13 14 17 15 19 19 6 13 3 15 10 17 6 14 15 15 19 6 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 6 16 15 16 3 13 14 10 19 6
facility : 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 1 1 0 1
cost is 7152
this case waste time is 1.418 s
===================================================================
../Instances/p23 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 10 13 3 15 10 17 9 15 15 15 19 9 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 10 16 15 16 3 13 15 10 19 9
facility : 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 1
cost is 8774
this case waste time is 1.429 s
===================================================================
../Instances/p24 result:
customer arrange: 16 3 10 10 19 15 17 13 3 17 15 19 19 10 13 3 15 10 17 3 15 15 15 19 10 17 16 17 3 17 13 15 13 16 3 10 3 19 19 13 10 16 15 16 3 13 15 10 19 3
facility : 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0 1
cost is 10301
this case waste time is 1.46 s
===================================================================
../Instances/p25 result:
customer arrange: 20 25 20 14 20 5 2 24 14 17 24 8 8 20 2 14 14 17 5 0 14 0 5 17 5 8 2 24 5 24 5 25 20 25 20 20 24 24 0 14 0 14 24 8 24 14 0 20 25 8 5 14 14 5 20 20 17 25 0 14 0 5 20 0 0 25 24 0 24 24 20 20 5 17 24 8 24 20 14 24 20 0 20 17 2 17 17 0 20 5 2 24 17 0 0 24 2 14 25 20 8 17 14 25 2 25 0 0 14 8 14 14 2 0 25 25 24 24 24 24 5 8 25 20 8 0 5 24 0 25 0 0 24 5 8 14 0 5 20 17 0 8 20 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 12006
this case waste time is 3.133 s
===================================================================
../Instances/p26 result:
customer arrange: 20 11 20 14 20 5 14 24 14 17 24 8 8 20 0 14 14 17 5 11 14 0 5 0 5 8 0 24 5 24 5 11 20 11 20 20 24 24 11 14 0 14 24 8 24 14 0 20 11 8 5 14 14 5 20 20 17 11 11 14 0 5 20 11 11 11 24 0 5 24 20 20 11 0 24 8 24 20 14 24 20 0 20 17 0 17 17 0 20 5 0 24 0 11 0 24 14 0 11 20 8 0 17 11 14 5 0 11 14 8 14 14 17 11 11 11 24 24 24 24 5 8 11 20 8 0 5 24 0 11 0 11 24 5 8 14 0 5 20 17 0 8 20 14 8 11 11 5 17 5
facility : 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 10773
this case waste time is 2.56 s
===================================================================
../Instances/p27 result:
customer arrange: 20 11 20 14 20 5 14 24 14 17 24 8 8 20 0 14 14 17 5 11 14 0 5 0 5 8 0 24 5 24 5 11 20 11 20 20 24 24 0 14 0 8 24 8 24 14 0 20 11 8 5 14 14 5 20 20 17 11 11 14 0 5 20 11 11 11 24 0 24 24 20 20 11 0 24 8 24 20 14 24 20 0 20 17 0 17 17 0 20 5 14 24 0 11 0 24 14 0 11 20 8 0 17 11 14 5 0 11 14 8 14 14 17 11 11 11 24 24 24 24 5 8 11 20 8 0 5 24 0 11 0 11 24 5 8 14 0 5 20 17 0 8 20 14 8 11 11 5 17 5
facility : 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 12380
this case waste time is 3.257 s
===================================================================
../Instances/p28 result:
customer arrange: 20 11 20 2 20 5 0 24 14 0 24 20 14 20 0 14 14 0 5 11 2 0 5 0 5 20 2 24 5 24 5 11 20 11 20 20 24 24 11 14 0 14 24 11 24 14 11 20 11 14 5 14 14 5 20 20 2 11 11 14 0 5 20 11 11 11 24 0 24 24 20 20 11 0 24 20 24 20 14 24 20 0 20 0 0 0 2 0 20 5 2 24 0 11 0 24 2 11 11 20 20 0 14 11 2 5 0 11 14 14 14 14 2 11 11 11 24 24 24 24 5 14 11 20 20 11 5 24 11 11 0 11 24 5 14 14 0 5 20 0 0 20 20 14 20 11 11 5 2 5
facility : 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0
cost is 13837
this case waste time is 2.744 s
===================================================================
../Instances/p29 result:
customer arrange: 20 11 13 2 20 5 2 24 8 17 21 8 8 20 17 14 14 17 5 11 2 0 21 17 21 8 2 24 5 5 21 11 13 11 20 20 24 24 0 14 0 14 24 8 24 14 0 13 11 8 21 14 14 5 13 20 17 21 0 14 0 5 20 0 11 11 24 0 21 21 20 20 11 17 24 8 21 20 14 24 20 0 13 17 2 17 17 0 20 5 2 24 17 11 17 5 2 2 21 13 8 17 17 11 2 5 17 11 14 8 14 14 2 11 11 21 24 24 5 24 5 8 11 13 8 0 5 21 0 21 0 11 24 21 8 14 0 5 20 17 0 8 20 14 8 11 11 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 0
cost is 12893
this case waste time is 3.321 s
===================================================================
../Instances/p30 result:
customer arrange: 20 11 13 14 20 5 7 24 8 17 22 20 8 20 7 14 14 17 5 11 17 0 22 7 22 8 17 24 5 22 5 11 13 11 20 20 24 24 0 14 0 8 24 8 24 14 7 13 11 8 5 8 14 5 13 20 17 11 0 14 0 5 20 0 11 11 22 0 22 22 20 13 11 0 24 8 22 20 14 24 20 7 13 17 7 17 17 7 20 5 17 24 17 11 7 5 14 7 5 13 8 7 17 11 17 5 7 11 14 8 14 14 17 11 11 0 24 24 24 24 5 8 11 13 8 0 5 22 0 0 0 0 24 22 8 14 7 5 20 17 0 8 20 14 8 11 11 5 17 5
facility : 1 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 0 1 0 1 0 0 0 0 0
cost is 11669
this case waste time is 2.614 s
===================================================================
../Instances/p31 result:
customer arrange: 20 11 13 2 20 5 2 24 14 17 25 8 8 20 2 14 14 17 25 11 2 0 25 17 25 8 2 24 5 5 25 25 13 25 20 20 24 24 0 14 0 14 24 8 24 14 0 13 11 8 25 14 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 25 25 20 20 11 17 24 8 5 20 2 24 20 0 13 17 2 17 17 0 20 5 2 24 17 11 17 5 2 2 25 13 8 17 17 25 2 25 17 11 14 8 14 14 2 11 11 25 24 24 5 24 5 8 25 13 8 0 5 5 0 11 0 11 24 11 8 14 17 5 20 17 0 8 20 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 13608
this case waste time is 3.108 s
===================================================================
../Instances/p32 result:
customer arrange: 20 11 13 14 20 5 7 24 8 17 25 20 8 20 7 14 14 17 25 11 17 0 25 7 25 8 17 24 5 5 25 25 13 25 20 20 24 24 0 14 0 8 24 8 24 14 7 13 11 8 25 8 14 5 13 20 17 11 0 14 0 5 20 11 11 11 24 0 25 25 20 13 11 0 24 8 5 20 14 24 20 7 13 17 7 17 17 7 20 5 17 24 17 11 7 5 14 7 25 13 8 7 17 25 17 25 7 11 14 8 14 14 17 11 11 11 24 24 5 24 5 8 25 13 8 0 5 5 0 25 0 11 24 11 8 14 7 5 20 17 0 8 20 14 8 11 25 5 17 5
facility : 1 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 16088
this case waste time is 2.618 s
===================================================================
../Instances/p33 result:
customer arrange: 20 25 13 2 13 5 2 24 14 17 5 20 20 20 17 14 14 17 5 0 2 0 5 17 5 20 2 24 5 24 5 25 13 25 20 20 24 24 0 14 0 14 24 14 24 14 0 13 25 14 5 14 14 5 13 20 17 25 0 14 0 5 20 0 0 25 24 0 5 5 13 13 5 17 24 20 24 20 14 24 20 0 13 17 17 17 17 0 20 5 2 24 17 0 17 24 2 2 25 13 20 17 17 25 2 25 17 0 14 14 14 14 2 0 25 25 24 24 24 24 5 20 25 13 20 0 5 24 0 25 0 0 24 5 14 14 17 5 20 17 0 20 20 14 20 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 0 0 0 0 0 1 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 12283
this case waste time is 3.698 s
===================================================================
../Instances/p34 result:
customer arrange: 20 11 20 14 20 5 17 24 14 17 5 8 8 20 0 14 14 17 5 11 14 0 5 17 5 8 17 24 5 24 5 11 8 11 20 20 24 24 0 14 0 14 24 8 24 14 0 20 11 8 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 24 5 8 20 11 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 11 0 5 14 14 11 20 8 17 17 11 17 5 17 11 14 8 14 14 17 11 11 11 24 24 24 24 5 8 11 20 8 0 5 24 0 11 0 11 24 5 8 14 0 5 20 17 0 8 20 14 8 11 11 5 17 5
facility : 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 10632
this case waste time is 2.542 s
===================================================================
../Instances/p35 result:
customer arrange: 20 25 20 2 8 5 2 24 14 17 5 8 8 20 17 14 14 17 5 0 2 0 5 17 5 8 2 24 5 24 5 25 20 25 20 20 24 24 0 14 0 14 24 8 24 14 0 20 25 8 5 14 14 5 20 20 17 25 0 14 0 5 20 0 0 25 24 0 5 5 8 20 5 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 2 24 17 0 17 24 2 2 25 8 8 17 17 25 2 25 17 0 14 8 14 14 2 0 25 25 24 24 24 24 5 8 25 20 8 0 5 24 0 25 0 0 24 5 8 14 17 5 20 17 0 8 20 14 8 25 25 5 2 5
facility : 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0
cost is 12684
this case waste time is 3.526 s
===================================================================
../Instances/p36 result:
customer arrange: 20 0 20 14 20 5 17 24 14 17 5 8 8 20 0 14 14 17 5 0 14 0 5 17 5 8 17 24 5 24 5 5 8 27 20 20 24 24 27 14 0 14 24 8 24 14 27 20 27 8 5 14 14 5 20 20 17 27 0 14 0 5 20 27 0 0 24 0 5 5 8 20 5 17 24 8 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 27 17 24 14 27 27 20 8 17 17 0 14 5 17 0 14 8 14 14 17 0 0 27 24 24 24 24 5 8 27 20 8 0 5 24 0 27 0 27 24 27 8 14 0 5 20 17 0 8 20 14 8 27 0 5 17 5
facility : 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0
cost is 14160
this case waste time is 2.67 s
===================================================================
../Instances/p37 result:
customer arrange: 20 11 20 14 20 5 14 24 14 17 24 20 20 20 17 14 14 17 5 11 14 17 5 17 5 20 17 24 5 24 5 11 20 11 20 20 24 24 11 14 17 14 24 14 24 14 11 20 11 14 5 14 14 5 20 20 17 11 11 14 17 5 20 11 11 11 24 17 5 24 20 20 11 17 24 20 24 20 14 24 20 17 20 17 17 17 17 17 20 5 17 24 17 11 17 5 14 14 11 20 20 17 17 11 17 5 17 11 14 14 14 14 17 11 11 11 24 24 24 24 5 14 11 20 20 17 5 24 11 11 17 11 24 5 14 14 17 5 20 17 17 20 20 14 20 11 11 5 17 5
facility : 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 11258
this case waste time is 3.354 s
===================================================================
../Instances/p38 result:
customer arrange: 20 11 20 14 20 5 17 24 14 17 24 20 20 20 17 14 14 17 5 11 14 0 5 17 5 20 17 24 5 24 5 11 20 11 20 20 24 24 0 14 0 14 24 14 24 14 0 20 11 14 5 14 14 5 20 20 17 11 0 14 0 5 20 11 11 11 24 0 24 24 20 20 11 17 24 20 24 20 14 24 20 0 20 17 17 17 17 0 20 5 17 24 17 11 17 5 14 14 11 20 20 17 17 11 17 5 17 11 14 14 14 14 17 11 11 11 24 24 24 24 5 14 11 20 20 0 5 24 0 5 0 11 24 5 14 14 17 5 20 17 0 20 20 14 20 11 11 5 17 5
facility : 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 10551
this case waste time is 2.695 s
===================================================================
../Instances/p39 result:
customer arrange: 20 11 20 14 20 5 14 24 14 17 24 20 20 20 17 14 14 17 5 11 14 17 5 17 5 20 17 24 5 24 5 11 20 11 20 20 24 24 11 14 17 14 24 14 24 14 11 20 11 14 5 14 14 5 20 20 17 11 11 14 17 5 20 11 11 11 24 17 24 24 20 20 11 17 24 20 24 20 14 24 20 17 20 17 17 17 17 17 20 5 17 24 17 11 17 24 14 14 11 20 20 17 17 11 17 5 17 11 14 14 14 14 17 11 11 11 24 24 24 24 5 14 11 20 20 11 5 24 11 5 17 11 24 5 14 14 17 5 20 17 17 20 20 14 20 11 11 5 17 5
facility : 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 11859
this case waste time is 3.082 s
===================================================================
../Instances/p40 result:
customer arrange: 20 11 20 14 20 5 14 24 14 17 24 20 20 20 17 14 14 17 5 11 14 17 5 17 5 20 17 24 5 24 5 11 20 11 20 20 24 24 11 14 17 14 24 14 24 14 11 20 11 14 5 14 14 5 20 20 17 11 11 14 17 5 20 11 11 11 24 17 24 24 20 20 11 17 24 20 24 20 14 24 20 17 20 17 17 17 17 17 20 5 17 24 17 11 17 24 14 17 11 20 20 17 17 11 17 5 17 11 14 14 14 14 17 11 11 11 24 24 24 24 5 14 11 20 20 11 5 24 11 5 17 11 24 5 14 14 17 5 20 17 17 20 20 14 20 11 11 5 17 5
facility : 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0
cost is 13059
this case waste time is 2.644 s
===================================================================
../Instances/p41 result:
customer arrange: 5 6 0 6 7 9 7 7 8 8 5 6 7 6 7 7 7 8 0 6 6 6 6 6 6 5 5 0 5 5 8 0 0 0 7 9 9 6 6 9 9 7 7 7 7 5 0 5 5 6 6 6 6 6 7 7 7 8 8 8 0 0 6 5 0 6 6 6 5 5 0 0 5 0 7 7 7 7 6 5 7 9 7 7 9 9 9 9 9 9
facility : 1 0 0 0 0 1 1 1 1 1
cost is 6616
this case waste time is 2.302 s
===================================================================
../Instances/p42 result:
customer arrange: 11 10 11 11 19 19 0 11 17 17 11 19 19 10 19 0 0 17 10 10 10 11 11 11 11 11 11 17 17 11 0 19 19 10 10 10 10 0 0 0 0 11 17 0 11 10 10 19 0 19 17 17 17 17 17 10 17 10 10 10 11 11 11 11 11 11 0 0 19 19 10 19 19 19 19 19 19 19 19 19
facility : 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 1
cost is 5936
this case waste time is 1.742 s
===================================================================
../Instances/p43 result:
customer arrange: 29 21 11 29 3 0 3 21 29 29 29 3 3 0 11 11 21 11 21 0 0 3 0 21 0 3 29 11 29 29 29 29 3 3 0 0 0 0 21 11 29 11 29 29 29 3 3 0 3 11 21 0 0 11 11 11 21 0 3 29 29 29 29 29 29 29 29 29 29 29
facility : 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1
cost is 5582
this case waste time is 1.686 s
===================================================================
../Instances/p44 result:
customer arrange: 4 4 4 4 4 4 4 4 0 0 6 0 0 0 0 0 1 8 1 7 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 0 1 1 2 8 7 0 9 7 7 6 4 9 8 8 7 7 9 7 7 4 9 3 0 6 6 8 1 0 4 7 9 7 7 8 6 6 7 8 7 9 9 9 9 9 6 7 7 4
facility : 1 1 1 1 1 0 1 1 1 1
cost is 7028
this case waste time is 2.33 s
===================================================================
../Instances/p45 result:
customer arrange: 0 0 0 0 0 0 0 6 6 6 6 6 6 6 6 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 0 0 3 3 4 3 18 5 18 3 18 5 3 8 8 18 18 18 5 6 3 3 3 3 0 8 18 3 8 8 3 6 18 3 18 8 8 8 8 5 6 18
facility : 1 0 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 1 0
cost is 6310
this case waste time is 1.775 s
===================================================================
../Instances/p46 result:
customer arrange: 10 10 10 10 10 10 10 18 18 1 1 1 1 1 1 3 3 3 3 3 3 5 5 5 5 5 5 9 9 9 9 27 9 9 10 3 3 5 3 18 18 3 3 10 3 18 18 27 18 18 10 27 27 1 3 18 27 18 18 3 3 1 18 18 27 27 27 27 3 18
facility : 0 1 0 1 0 1 0 0 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0
cost is 5988
this case waste time is 1.768 s
===================================================================
../Instances/p47 result:
customer arrange: 0 0 0 0 0 0 0 0 2 0 1 1 1 2 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 7 7 6 7 6 0 7 7 7 7 7 7 8 8 8 8 6 8 8 8 9 2 9 9 9 0 9 9
facility : 1 1 1 1 1 1 1 1 1 1
cost is 6228
this case waste time is 3.042 s
===================================================================
../Instances/p48 result:
customer arrange: 0 0 0 0 0 0 0 0 0 2 2 2 2 2 2 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 8 8 8 8 8 5 8 8 8 8 8 10 10 10 10 10 10 12 17 12 12 12 12 12 14 14 12 14 17 0 14 14 14 14 17 17 17 17 17 17 17 17 19 19 19 19 19 19 19
facility : 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1
cost is 5643
this case waste time is 1.778 s
===================================================================
../Instances/p49 result:
customer arrange: 2 2 2 2 2 2 2 2 2 2 2 2 2 7 7 7 7 7 7 7 7 7 9 9 9 9 9 14 14 14 14 14 14 14 14 14 16 16 16 16 16 16 20 20 20 20 20 20 21 20 21 20 2 21 21 21 21 25 25 25 25 25 25 25 28 28 28 28 25 28
facility : 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 1 0
cost is 5347
this case waste time is 1.633 s
===================================================================
../Instances/p50 result:
customer arrange: 3 6 3 0 5 5 5 5 3 7 7 3 6 9 6 9 9 5 5 3 6 0 0 0 0 6 7 3 3 7 7 7 3 3 3 5 9 9 0 6 0 9 9 9 5 5 5 5 7 3 3 5 6 0 0 0 6 6 1 5 9 7 7 7 3 3 0 3 7 7 3 6 6 0 0 3 3 3 3 3 3 5 5 5 6 5 6 7 5 7 9 9 1 6 1 1 1 9 1 1
facility : 1 1 0 1 0 1 1 1 0 1
cost is 8744
this case waste time is 2.536 s
===================================================================
../Instances/p51 result:
customer arrange: 1 10 15 10 13 13 5 5 15 1 5 10 18 13 13 13 13 5 5 15 10 10 10 10 10 10 1 15 15 1 5 1 15 15 15 5 18 13 10 18 10 13 13 13 5 5 5 5 5 15 15 5 18 10 10 10 13 18 18 13 13 5 1 5 15 15 10 10 1 1 15 10 10 10 10 15 15 15 15 15 15 5 13 13 18 13 13 1 18 1 13 13 18 18 18 18 18 18 18 13
facility : 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0
cost is 7498
this case waste time is 2.034 s
===================================================================
../Instances/p52 result:
customer arrange: 7 7 7 7 7 7 7 7 3 4 4 4 3 4 4 4 4 8 8 8 8 3 3 8 3 9 9 9 9 9 9 9 9 5 6 6 6 6 6 6 6 6 6 6 7 7 4 8 8 5 5 3 4 6 7 5 3 3 3 4 6 5 5 3 3 3 5 7 4 7 6 6 4 3 3 5 3 4 7 6 6 4 3 5 5 3 3 7 5 4 5 5 6 5 5 6 3 4 3 7
facility : 0 0 0 1 1 1 1 1 1 1
cost is 9180
this case waste time is 2 s
===================================================================
../Instances/p53 result:
customer arrange: 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 12 3 12 12 3 12 12 3 9 9 9 9 9 9 9 9 15 18 18 18 18 18 18 18 18 18 18 5 5 7 12 12 15 15 3 7 18 5 15 3 3 3 7 18 15 15 3 3 3 15 18 7 5 18 18 7 3 3 15 3 7 7 15 18 7 3 15 15 3 3 5 15 3 15 15 18 15 15 18 3 7 3 5
facility : 0 0 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 0 1 0
cost is 8531
this case waste time is 2.444 s
===================================================================
../Instances/p54 result:
customer arrange: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 2 3 3 2 3 3 3 3 3 3 3 3 3 3 3 3 3 6 6 8 8 6 8 8 8 8 8 8 3 3 6 6 6 6 6 6 6 6 6 0 4 6 0 6 6 6 6 0 0 6 0 4 4 0 0 0 0 0 0 4 4 4 4 4 4 4 4 4 4 9 4 9 4 9 9 9 9 9
facility : 1 0 1 1 1 0 1 0 1 1
cost is 8777
this case waste time is 2.218 s
===================================================================
../Instances/p55 result:
customer arrange: 18 18 18 18 18 18 18 2 2 2 2 2 2 2 2 2 2 2 2 6 2 6 2 6 2 2 6 2 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 6 6 7 6 7 7 7 7 7 7 7 7 7 7 13 7 7 7 7 7 7 13 13 7 13 13 18 13 13 13 13 13 13 15 15 15 15 15 15 15 15 15 15 18 18 18 18 18 18 18 18 18
facility : 0 0 1 0 0 0 1 1 0 0 0 0 0 1 0 1 0 0 1 0
cost is 7685
this case waste time is 2.442 s
===================================================================
../Instances/p56 result:
customer arrange: 7 19 21 27 2 6 21 27 22 28 4 28 3 3 28 7 3 10 22 0 27 16 5 24 10 27 27 28 4 2 19 19 4 16 27 6 8 8 24 16 7 9 6 4 8 19 3 21 19 19 24 16 24 16 8 6 11 9 22 7 4 0 7 8 3 11 5 19 28 25 7 6 6 9 5 5 8 5 8 16 10 0 9 25 4 10 6 5 27 7 28 6 25 25 2 3 11 6 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 6 11 8 28 7 0 8 9 11 28 19 9 16 2 11 19 0 28 24 25 8 5 9 3 3 28 10 11 22 11 11 25 5 24 21 27 25 24 0 10 0 8 11 2 16 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 2 0 10 4 10 5 21 2 19 11 8 28 10 0 21 2 21 6 4 7 6 7 21 10 19
facility : 1 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0
cost is 21451
this case waste time is 2.87 s
===================================================================
../Instances/p57 result:
customer arrange: 7 6 24 27 15 12 15 28 27 28 4 28 20 3 28 7 3 20 16 27 27 16 5 24 10 27 27 6 4 5 6 26 4 16 27 6 20 8 24 15 7 8 6 4 8 26 3 16 6 20 24 16 24 16 8 6 25 8 7 25 4 0 7 8 3 25 5 20 6 25 7 12 6 8 10 10 20 5 8 16 10 0 26 25 4 10 6 5 27 7 28 6 25 25 0 3 28 6 0 28 28 15 25 7 4 0 4 24 16 3 26 4 27 12 12 8 28 7 0 8 26 25 28 26 26 16 15 12 26 0 28 24 25 20 5 8 3 3 28 10 12 27 12 25 25 5 24 15 27 25 24 0 10 0 8 28 5 15 3 3 3 27 10 24 5 27 5 4 3 15 5 20 28 20 26 0 0 10 4 10 5 15 24 6 12 8 28 10 0 16 5 16 6 4 7 12 7 15 10 6
facility : 1 0 0 1 1 1 1 1 1 0 1 0 1 0 0 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0
cost is 27111
this case waste time is 3.421 s
===================================================================
../Instances/p58 result:
customer arrange: 7 19 21 27 2 6 21 27 27 17 4 17 13 13 19 7 13 20 24 17 7 21 5 24 23 27 27 19 4 5 19 19 4 21 27 6 20 9 24 21 7 9 6 4 9 19 13 21 19 20 24 24 2 21 20 6 25 9 7 25 4 2 7 20 13 11 5 19 19 25 7 6 6 9 23 23 20 23 20 24 23 17 9 25 4 13 6 5 27 7 17 6 25 25 2 13 11 6 17 17 17 21 25 7 4 24 4 24 27 13 19 4 27 6 11 9 11 25 17 9 9 11 17 19 9 24 2 11 9 17 11 24 25 20 23 9 13 13 17 20 11 27 11 25 25 5 24 21 27 25 24 17 23 17 20 11 2 21 13 13 13 27 23 2 5 27 5 4 13 21 5 20 19 20 4 2 24 23 4 20 5 21 2 6 11 9 11 23 17 21 2 21 6 4 7 6 7 21 23 19
facility : 0 0 1 0 1 1 1 1 0 1 0 1 0 1 0 0 0 1 0 1 1 1 0 1 1 1 0 1 0 0
cost is 38342
this case waste time is 2.889 s
===================================================================
../Instances/p59 result:
customer arrange: 18 19 21 22 2 12 21 28 22 28 4 28 13 13 28 18 13 10 22 24 18 21 23 24 10 18 22 19 4 2 19 19 4 21 18 6 10 8 24 21 18 8 6 4 8 19 13 21 19 17 24 24 2 21 8 6 18 8 18 25 4 17 18 8 13 12 23 17 28 25 18 12 6 8 23 23 10 23 8 24 23 17 8 25 4 13 6 2 22 25 28 6 25 25 2 13 28 6 17 28 28 21 25 18 4 24 4 24 22 13 19 4 18 12 12 8 28 25 17 8 19 25 17 19 4 22 2 12 19 17 28 24 12 10 23 8 13 13 28 10 12 22 12 25 25 2 24 21 22 25 24 17 23 17 8 28 2 21 13 13 13 17 10 24 23 22 23 4 13 21 23 8 19 10 4 2 24 10 4 10 2 21 2 6 12 8 28 23 17 21 2 21 6 6 25 12 25 21 10 19
facility : 0 0 1 0 1 0 1 0 1 0 1 0 1 1 0 0 0 1 1 1 0 1 1 1 1 1 0 0 1 0
cost is 27776
this case waste time is 3.392 s
===================================================================
../Instances/p60 result:
customer arrange: 7 19 21 27 21 12 21 27 22 28 4 28 10 3 28 7 3 10 22 27 27 21 5 24 10 27 27 19 4 21 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 25 8 22 25 4 17 7 8 3 25 5 17 28 25 7 12 19 8 5 10 10 5 8 24 10 17 8 25 4 10 19 5 27 7 28 19 25 25 5 3 28 12 17 28 28 21 25 7 4 24 4 24 22 3 19 4 27 12 12 8 28 7 17 8 8 25 17 19 4 21 21 12 19 17 28 24 25 10 5 8 3 3 28 10 12 22 12 25 25 5 24 21 27 25 24 17 10 17 8 28 5 21 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 21 24 10 4 10 5 21 24 19 12 8 28 10 17 21 21 21 19 4 7 12 7 21 10 19
facility : 0 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 0
cost is 20662
this case waste time is 2.843 s
===================================================================
../Instances/p61 result:
customer arrange: 7 19 2 27 2 12 15 27 27 28 4 28 13 13 28 7 13 13 27 27 27 24 2 24 23 27 27 19 4 2 19 19 4 24 27 12 8 8 24 15 7 8 12 4 8 19 13 2 19 19 24 24 24 15 8 12 7 8 27 7 4 2 7 8 13 12 23 19 28 12 7 12 19 8 23 23 8 23 8 24 23 2 8 7 4 13 19 2 27 7 28 19 7 7 2 13 28 12 2 28 28 15 12 7 4 24 4 24 27 13 19 4 27 12 12 8 28 7 28 8 8 12 28 19 4 15 2 12 19 28 28 24 12 8 23 8 13 13 28 23 12 27 28 12 7 2 24 15 27 7 24 28 23 28 8 28 2 15 13 13 13 27 23 24 23 27 23 4 13 15 23 8 19 8 4 2 24 23 4 23 2 15 2 19 12 8 28 23 27 24 2 2 19 4 7 12 7 15 23 19
facility : 0 0 1 0 1 0 0 1 1 0 0 0 1 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0
cost is 25244
this case waste time is 3.421 s
===================================================================
../Instances/p62 result:
customer arrange: 7 6 21 27 21 6 21 27 27 28 26 28 10 5 28 7 5 10 27 27 27 21 5 24 10 27 27 28 26 21 6 26 26 21 27 6 8 8 24 21 7 8 6 26 8 26 8 21 6 10 24 24 24 21 8 6 11 8 27 7 26 24 7 8 8 11 5 28 28 11 7 6 6 8 5 5 10 5 8 24 10 5 26 7 26 10 6 5 27 7 28 6 7 11 5 8 11 6 5 28 28 21 11 7 26 24 26 24 27 8 26 6 27 6 11 8 28 7 28 8 26 11 28 6 26 21 21 11 26 28 28 24 11 10 5 8 8 8 28 10 11 27 11 11 11 5 24 21 27 11 24 28 10 28 8 11 5 21 8 8 10 27 10 24 5 27 5 26 10 21 5 8 28 10 26 21 24 10 26 10 5 21 24 6 11 8 28 10 27 21 21 21 6 6 7 6 7 21 10 6
facility : 0 0 0 0 0 1 1 1 1 0 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0
cost is 33694
this case waste time is 2.975 s
===================================================================
../Instances/p63 result:
customer arrange: 18 6 2 24 2 6 15 28 18 28 4 28 13 13 28 18 13 13 24 24 18 24 23 24 23 18 24 28 4 2 6 4 4 24 28 6 8 8 24 15 18 8 6 4 8 4 13 2 6 17 24 24 2 15 8 6 25 8 18 25 4 2 25 8 13 25 23 17 28 25 18 6 6 8 23 23 8 23 8 24 23 17 8 25 4 13 4 2 24 25 28 6 25 25 2 13 28 6 17 28 28 15 25 18 4 24 4 24 24 13 6 4 18 6 6 8 28 25 17 8 8 25 17 6 4 15 2 28 4 17 28 24 25 8 23 8 13 13 28 17 6 18 28 25 25 2 24 15 18 25 24 17 23 17 8 28 2 15 13 13 13 24 23 24 23 18 23 4 13 15 23 8 28 17 4 2 24 23 4 23 2 15 2 6 25 8 28 23 17 2 2 2 6 4 25 6 25 15 23 6
facility : 0 0 1 0 1 0 1 0 1 0 0 0 0 1 0 1 0 1 1 0 0 0 0 1 1 1 0 0 1 0
cost is 25453
this case waste time is 3.509 s
===================================================================
../Instances/p64 result:
customer arrange: 7 19 21 27 21 12 21 27 22 28 4 28 10 3 28 7 3 10 22 0 27 21 5 24 10 27 27 19 4 21 19 19 4 21 27 12 8 8 24 21 7 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 25 8 22 7 4 0 7 8 3 25 5 19 28 25 7 12 19 8 5 10 10 5 8 24 10 0 8 25 4 10 19 5 27 7 28 19 25 25 0 3 28 12 0 28 28 21 25 7 4 0 4 24 22 3 19 4 27 12 12 8 28 7 0 8 8 25 28 19 4 21 21 12 19 0 28 24 25 10 5 8 3 3 28 10 12 22 12 25 25 5 24 21 27 25 24 0 10 0 8 28 5 21 3 3 3 27 10 24 5 27 5 4 3 21 5 8 19 10 4 21 0 10 4 10 5 21 21 19 12 8 28 10 0 21 21 21 19 4 7 12 7 21 10 19
facility : 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 1 0 1 1 0 1 1 0
cost is 20530
this case waste time is 3.138 s
===================================================================
../Instances/p65 result:
customer arrange: 18 19 21 24 21 12 21 28 18 28 4 28 10 3 28 18 3 10 24 24 18 21 5 24 10 18 24 19 4 21 19 19 4 21 28 12 8 8 24 21 18 8 12 4 8 19 3 21 19 10 24 24 24 21 8 12 25 8 18 25 4 24 25 8 3 25 5 19 28 25 18 12 19 8 5 10 10 5 8 24 10 5 8 25 4 10 19 5 24 25 28 19 25 25 5 3 28 12 10 28 28 21 25 18 4 24 4 24 24 3 19 4 18 12 12 8 28 25 28 8 8 25 28 19 4 21 21 12 19 28 28 24 25 10 5 8 3 3 28 10 12 18 12 25 25 5 24 21 18 25 24 28 10 28 8 28 5 21 3 3 3 24 10 24 5 24 5 4 3 21 5 8 19 10 4 21 24 10 4 10 5 21 21 19 12 8 28 10 24 21 21 21 19 4 25 12 25 21 10 19
facility : 0 0 0 1 1 1 0 0 1 0 1 0 1 0 0 0 0 0 1 1 0 1 0 0 1 1 0 0 1 0
cost is 24610
this case waste time is 3.213 s
===================================================================
../Instances/p66 result:
customer arrange: 18 28 21 18 2 12 21 28 18 28 4 28 10 10 28 18 10 10 18 28 18 21 2 21 10 18 18 28 4 2 4 4 4 21 28 12 8 8 21 21 18 8 12 4 8 4 8 21 28 10 2 21 21 21 8 12 12 8 18 18 4 2 18 8 8 12 2 28 28 12 18 12 4 8 10 10 8 10 8 21 10 2 8 12 4 10 4 2 18 18 28 4 18 12 2 8 28 12 2 28 28 21 12 18 4 2 4 21 18 8 4 4 18 12 12 8 28 18 10 8 8 12 28 4 4 21 2 12 4 28 28 21 12 10 10 8 8 8 28 10 12 18 12 12 12 2 21 21 18 12 2 28 10 28 8 28 2 21 8 8 10 28 10 2 10 18 2 4 8 21 2 8 28 10 4 2 2 10 4 10 2 21 2 28 12 8 28 10 28 21 2 21 4 4 18 12 18 21 10 28
facility : 0 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0
cost is 31879
this case waste time is 3.438 s
===================================================================
../Instances/p67 result:
customer arrange: 18 6 24 24 15 6 15 28 24 28 4 28 3 3 28 18 3 8 18 0 18 24 23 24 23 18 24 28 4 15 6 6 4 15 28 6 8 8 24 15 18 8 6 4 8 4 3 15 28 8 24 24 24 24 8 6 18 8 18 25 4 0 18 8 3 25 23 28 28 25 18 25 6 8 23 23 8 23 8 24 23 0 8 25 4 3 4 15 24 25 28 6 25 25 0 3 28 6 0 28 28 15 25 18 4 0 4 24 18 3 6 4 18 6 6 8 28 25 0 3 8 25 28 6 4 15 0 25 4 0 28 24 25 8 23 8 3 3 28 23 6 18 28 25 25 23 24 15 18 25 24 0 23 0 8 28 0 15 3 3 23 0 23 0 23 18 23 4 3 15 3 8 28 0 4 15 0 8 4 23 15 15 24 6 25 8 28 23 0 24 0 15 6 4 25 6 25 15 23 6
facility : 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 1 1 0 0 1 0
cost is 26649
this case waste time is 2.863 s
===================================================================
../Instances/p68 result:
customer arrange: 18 19 21 27 21 12 21 27 18 28 4 28 13 13 28 18 13 10 27 0 18 21 5 24 10 18 27 19 4 21 19 19 4 21 27 12 8 8 24 21 18 8 12 4 8 19 13 21 19 10 24 24 24 21 8 12 25 8 18 25 4 0 18 8 13 25 5 19 28 25 18 12 19 8 5 13 10 5 8 24 10 0 8 25 4 13 19 5 27 25 28 19 25 25 0 13 28 12 0 28 28 21 25 18 4 0 4 24 27 13 19 4 27 12 12 8 28 25 0 8 8 25 28 19 4 21 21 12 19 0 28 24 25 10 5 8 13 13 28 10 12 27 12 25 25 5 24 21 27 25 24 0 10 0 8 28 5 21 13 13 13 27 10 24 5 27 5 4 13 21 5 8 19 10 4 21 0 10 4 10 5 21 21 19 12 8 28 10 0 21 21 21 19 4 25 12 25 21 10 19
facility : 1 0 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 1 1 0 1 1 0
cost is 20840
this case waste time is 3.384 s
===================================================================
../Instances/p69 result:
customer arrange: 7 19 21 27 21 6 21 27 27 28 4 28 13 13 28 7 13 20 27 0 27 21 5 0 20 27 27 19 4 21 19 19 4 21 27 6 20 8 27 21 7 8 6 4 8 19 13 21 19 20 0 21 21 21 8 6 25 8 27 25 4 0 7 8 13 25 5 19 28 25 7 6 19 8 5 13 20 5 8 21 13 0 8 25 4 13 6 5 27 7 28 6 25 25 0 13 28 6 0 28 28 21 25 7 4 0 4 27 27 13 19 4 27 6 6 8 28 7 0 8 20 25 28 19 4 21 21 25 19 0 28 21 25 20 5 8 13 13 28 20 6 27 6 25 25 5 27 21 27 25 27 0 5 0 8 28 5 21 13 13 13 27 20 0 5 27 5 4 13 21 5 20 19 20 4 21 0 20 4 20 5 21 21 19 25 8 28 13 0 21 21 21 6 4 7 6 7 21 20 19
facility : 1 0 0 0 1 1 1 1 1 0 0 0 0 1 0 0 0 0 0 1 1 1 0 0 0 1 0 1 1 0
cost is 25622
this case waste time is 2.9 s
===================================================================
../Instances/p70 result:
customer arrange: 7 19 24 27 16 11 16 27 27 27 29 19 20 13 19 7 13 20 27 27 27 16 0 24 20 27 27 19 29 24 19 19 29 16 27 11 20 9 24 16 7 9 19 29 9 19 13 16 19 20 24 16 24 16 9 11 11 9 7 7 29 0 7 20 13 11 0 19 19 11 7 11 19 9 20 13 20 0 9 16 20 0 9 7 29 13 19 0 27 7 27 19 7 7 0 13 11 11 0 11 19 16 11 7 29 0 29 24 27 13 19 29 27 11 11 9 27 7 0 9 9 11 0 19 9 16 16 11 9 0 11 24 11 20 13 9 13 13 27 20 11 27 11 11 7 0 24 16 27 7 24 0 13 0 20 11 0 16 13 13 13 27 20 24 0 27 0 29 13 16 13 20 19 20 9 24 0 20 29 20 0 16 24 19 11 9 11 13 0 16 0 16 19 29 7 11 7 16 20 19
facility : 1 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 0 1 0 0 1 0 1
cost is 34882
this case waste time is 3.492 s
===================================================================
../Instances/p71 result:
customer arrange: 18 19 21 27 21 6 21 27 18 28 4 28 13 13 28 18 13 8 27 27 18 21 23 24 23 18 27 19 4 21 19 19 4 21 27 6 8 8 24 21 18 8 6 4 8 19 13 21 19 17 24 24 24 21 8 6 25 8 18 25 4 24 18 8 13 25 23 19 28 25 18 6 19 8 23 23 8 23 8 24 13 17 8 25 4 13 19 21 27 25 28 6 25 25 17 13 28 6 17 28 17 21 25 18 4 24 4 24 27 13 19 4 27 6 6 8 28 25 17 8 8 25 17 19 4 21 21 28 19 17 28 24 25 8 23 8 13 13 28 17 6 27 28 25 25 23 24 21 27 25 24 17 23 17 8 28 21 21 13 13 13 27 13 24 23 27 23 4 13 21 23 8 19 17 4 21 24 8 4 8 23 21 21 19 6 8 28 23 17 21 21 21 6 4 25 6 25 21 13 19
facility : 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 0 1 1 1 0 1 0 1 1 1 0 1 1 0
cost is 26463
this case waste time is 2.919 s
===================================================================
71 cases cost sum is 949453