• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    A Novel Insertion Solution for the Travelling Salesman Problem

    2024-05-25 14:43:10EmmanuelOluwatobiAsaniAderemiElishaOkeyinkaSundayAdeolaAjagbeAyodeleAriyoAdebiyiRoselineOluwaseunOgundokunTemitopeSamsonAdekunlePragasenMudaliandMatthewOlusegunAdigun
    Computers Materials&Continua 2024年4期

    Emmanuel Oluwatobi Asani ,Aderemi Elisha Okeyinka ,Sunday Adeola Ajagbe ,Ayodele Ariyo Adebiyi ,Roseline Oluwaseun Ogundokun,2,7,? ,Temitope Samson Adekunle ,Pragasen Mudali and Matthew Olusegun Adigun

    1Department of Computer Science,Landmark University,Omu Aran,251103,Nigeria

    2SDG 11 Group,Landmark University,Omu Aran,251103,Nigeria

    3Department of Computing,MiVA University,Abuja,900211,Nigeria

    4Department of Computer Science,Ibrahim Badamasi Babangida University,Lapai,911101,Nigeria

    5Department of Computer Science,University of Zululand,Kwadlangezwa,3886,South Africa

    6Department of Computer&Industrial Production Engineering,First Technical University,Ibadan,200243,Nigeria

    7Department of Multimedia Engineering,Kaunas University of Technology,Kaunas,LT-44249,Lithuania

    8Department of Computer Science,Colorado State University,Fort Collins,80523,USA

    ABSTRACT The study presents the Half Max Insertion Heuristic(HMIH)as a novel approach to solving the Travelling Salesman Problem(TSP).The goal is to outperform existing techniques such as the Farthest Insertion Heuristic(FIH)and Nearest Neighbour Heuristic(NNH).The paper discusses the limitations of current construction tour heuristics,focusing particularly on the significant margin of error in FIH.It then proposes HMIH as an alternative that minimizes the increase in tour distance and includes more nodes.HMIH improves tour quality by starting with an initial tour consisting of a‘minimum’polygon and iteratively adding nodes using our novel Half Max routine.The paper thoroughly examines and compares HMIH with FIH and NNH via rigorous testing on standard TSP benchmarks.The results indicate that HMIH consistently delivers superior performance,particularly with respect to tour cost and computational efficiency.HMIH’s tours were sometimes 16%shorter than those generated by FIH and NNH,showcasing its potential and value as a novel benchmark for TSP solutions.The study used statistical methods,including Friedman’s Non-parametric Test,to validate the performance of HMIH over FIH and NNH.This guarantees that the identified advantages are statistically significant and consistent in various situations.This comprehensive analysis emphasizes the reliability and efficiency of the heuristic,making a compelling case for its use in solving TSP issues.The research shows that,in general,HMIH fared better than FIH in all cases studied,except for a few instances(pr439,eil51,and eil101)where FIH either performed equally or slightly better than HMIH.HMIH’s efficiency is shown by its improvements in error percentage(δ)and goodness values(g)compared to FIH and NNH.In the att48 instance,HMIH had an error rate of 6.3%,whereas FIH had 14.6%and NNH had 20.9%,indicating that HMIH was closer to the optimal solution.HMIH consistently showed superior performance across many benchmarks,with lower percentage error and higher goodness values,suggesting a closer match to the optimal tour costs.This study substantially contributes to combinatorial optimization by enhancing current insertion algorithms and presenting a more efficient solution for the Travelling Salesman Problem.It also creates new possibilities for progress in heuristic design and optimization methodologies.

    KEYWORDS Nearest neighbour heuristic;farthest insertion heuristic;half max insertion heuristic;tour construction;travelling salesman problem

    1 Introduction

    Various methods exist to solve the Travelling Salesman Problem(TSP),including exact solutions and heuristics [1].Finding the shortest tour involves determining the optimal route through a set of cities,ensuring each city is visited exactly once before returning to the starting point [1–4].This completed tour is known as the Hamiltonian Cycle.It is assumed that the cost of the distance between any pair of cities is predefined.The cost often relates to distance but may represent other notions,such as time or money.A Hamiltonian cycle,as depicted in Fig.1,refers to a graph cycle that traverses all the graph’s vertices exactly once before returning to its starting vertex.The Travelling Salesman must traverse cities 1to nin a Hamiltonian cycle,that is,start from city 1,traverse the remainingn-1 cities in a specified order and then connect back to the starting city,having touched each of the cities only once at a minimal cost.

    Figure 1: A Hamiltonian weighted graph

    The TSP is simple to define,but the complexity can easily expand exponentially as the solution space increases;thus,it is classified as an NP-Hard problem[1].

    Exact techniques involve the explicit enumeration of the solution space;they try out all possible permutations of the solution.Thus,they have a complexity ofO(n!)[2–5].Exact techniques such as Dijkstra or Bellman-Ford algorithms may be deployed to effectively solve TSPs with a small degree of search space [6];others include Branch-and-Bound,Dynamic Programming Algorithms,Cutting Plane techniques and so on.Exact algorithms guarantee optimal solutions,at least hypothetically.However,the computational complexities of exact techniques are exponential [7];thus,the time required to provide their solutions grows exponentially with its solution space[6–10].Consequently,exact solutions are often impracticable and especially unsuitable for NP-hard problems with large solution space.For instance,the solution renowned as the best-performing exact technique is based on dynamic programming with a complexity ofOthus making TSPs impracticable to solve with the exact approach as the search space expands[11].These limitations of the precise method have driven the design,development,and deployment of heuristics.

    Unlike precise methods [12–15],heuristics offer rough solutions while operating within a polynomial time limit.These methods are known for their reliance on probabilities and specific rules to solve problems[16–18].For an iterative procedure,heuristics can be used when an optimal solution is guaranteed to obtain the solution quickly or make a decision within an exact process.In other words,using heuristics to solve the TSP and problems related to the TSP provides acceptable results that are not too far from the optimal yet computationally affordable.

    There are different classifications of heuristics based on the atomicity of their solution procedures,such as Tour Construction,Improvement/Local Search Heuristics,and Compound Heuristics [19–21].The Tour Construction heuristics are techniques that independently create solutions sequentially following predefined procedures within the problem space.These procedures outline the steps in the Initialization,Selection,and insertion stages.The focus of this study is on construction heuristics.Construction techniques generate reasonable approximate solutions for TSP and are equally central to the performance of the other classes of heuristics,such as improvement techniques,compound heuristics,and metaheuristics.Construction heuristics serve as a seed for the development of some heuristics and can be used to build initial solutions for high-performing techniques[22–25].Construction heuristics generally generate better initial solutions in high-performing improvement methods/metaheuristics than random initial solutions,thereby enhancing the quality of solutions[26–29].

    2 Related Works

    Construction heuristic techniques have been widely utilized in addressing traditional combinatorial optimization challenges.Various methods,such as the Nearest Neighbour Heuristic (NNH),Nearest Insertion(NIH),Cheapest Insertion,Random Insertion,Addition heuristics,Savings Heuristics,and more are commonly used.Existing tour construction methods typically fall short by between 10–30% in terms of solution quality with a worst-case complexity ofT(n)=OThe Nearest Neighbour Heuristic,for instance,is fast,flexible,and simple to implement;it,however,solves the Travelling Salesman Problem using a greedy approach and suffers immensely from the “curse of dimensionality”phenomenon[30].The Farthest Insertion,on the other hand,renowned as the bestperforming lower-order complexity heuristic[31],suffers from a high upper bound of error with farther distance[32].According to Huang et al.[32],the probability of attaining an optimal tour is higher if the distance can be reduced.

    Some well-known constructive heuristic methods are described briefly in Table 1.

    Table 1: Description of some well-known tour construction heuristics

    The Nearest Neighbour Heuristic can efficiently solve the TSP,albeit with slightly lower solution quality.The Nearest Neighbour Heuristic is a popular choice in research due to its quick implementation and straightforward approach.Experimentally,fs/fOPT≈1.26.

    Recent research has highlighted the importance of using the Nearest Neighbor Heuristic in ways such as integrating it into methods [21–23] or utilizing it as an initial step in metaheuristics to create starting solutions [7,38].While the Nearest Neighbor Heuristic is valued for its speed and simplicity,its strategy of selecting nodes with the lowest cost can lead to what is known as the“curse of dimensionality.” This means that outliers become apparent as the search space and nodes grow.The term“curse of dimensionality”is commonly used to explain how increasing dimensions result in a search space,causing data sparsity and outlier occurrences.Fischer et al.[39]described the Quadratic Traveling Salesman Problem (QTSP) as an expansion of the Traveling Salesman Problem (TSP).To solve the QTSP,they utilized a total of nine algorithms: Three exact algorithms (a polynomial transformation-based exact approach to a TSP,branch-and-bound algorithm,and branch-and-cut algorithm),seven approximate algorithms (Cheapest-Insertion Heuristic (CI),Nearest-Neighbour Heuristic(NN),Two-Directional Nearest-Neighbor Heuristic(2NN),Assignment-Patching Heuristic(AP),Nearest-Neighbour-Patching Heuristic (NNP),Two-Directional Nearest-Neighbour-Patching Heuristic (2NNP),and Greedy Heuristic (GR),and Nearest-Neighbour Heuristic (2NN) were utilized.Within around ten minutes,the branch-and-cut approach could tackle complicated real-world problems with as many as one hundred nodes in an efficient manner,successfully reaching optimality.Heuristics could handle the most complex cases in ten seconds or less,which was far faster than the running times of exact algorithms,which were acceptable.In terms of processing speed,the various iterations of the Nearest Neighbour algorithm worked well;nevertheless,when it came to the correctness of their solutions,they were not as good as the exact applications.

    Lity et al.[22]modelled the product ordering process of the incremental Software Product Line(SPL)analysis as a Travelling Salesman Problem(TSP).The aim was to optimize product orders and improve the overall SPL analysis.Products were modelled as nodes in a graph,and the solution-space information defined edge weights between product nodes.Existing graph route-finding heuristics were used to obtain the path with minimal costs.The first heuristic deployed was the Nearest Neighbour heuristic.The nodes were analyzed according to their similarity,so the NNH path was built by adding the product (node) most similar to the last node.However,it was observed that the approximation quality was poor because it first greedily added all the similar nodes and later suffered the curse of dimensionality when not-so-similar nodes were to be added.To circumvent this,a lookup was introduced to examine the next node to be added to the computed path.Thereafter,two insertion heuristics,namely Nearest Insertion and Farthest Insertion,were deployed to insert the remaining product into the existing path created by the Nearest Neighbour Heuristic.The proposed method was simulated on a prototype and evaluated for applicability and performance;a significantly more optimized SPL process was reported.

    In implementing the Iterated Local Search technique,Bernardino et al.[40] used a modified version of the Nearest Neighbor heuristic to obtain an initial answer.The Family Travelling Salesman Problem(FTSP),a famous version of the Travelling Salesman Problem(TSP),was the focus of their research efforts.The first thing they did was model the FTSP,aiming to traverse a certain number of nodes in each cluster to the lowest possible cost.After that,the FTSP sub tour was designed in both a non-compact form.Three compact models were created:The Single Commodity Flow model(SCF),the Family Commodity Flow model (FCF),and the Node Commodity Flow model (NCF),for the compact variations options such as the Connectivity Cuts(CC)model,Rounded Visits(RV)model and Rounded Family Visits(RFV)model were considered.These models were compared using experiments carried out in the C++programming language.Implementing Iterative Local Search(ILS)in C++aimed to establish limits for situations beyond what direct methods could handle.During the first phase of constructing the ILS,an initial solution was constructed using a modified version of the Nearest Neighbor heuristic.Subsequently,a local search was run to arrive at a local optimum.As a further step,they used a perturbation to break out of the local optimum,and finally,they applied removal criteria to harvest the accumulated excess nodes.A well-known research hypothesis that construction tour heuristics create excellent first solutions was verified by the International Land Survey(ILS)performance.Experiments were carried out on benchmark instances that were accessible to the general public,and the results of the experiments were recorded.Results showed that noncompact models did better than their counterpart compact ones.

    In the study by Kitjacharoenchaia [41],the Nearest Neighbour and two other heuristics were used to build an initial solution for their proposed model.Motivated by the increasing adoption of drones to achieve fast and flexible delivery,they conducted a study to simulate a drone delivery system formulated as a multiple Travelling Salesman Problem(mTSP)to minimize time.They implemented Mixed Integer Programming (MIP) to solve the problem and proposed a new technique called the Adaptive Insertion Algorithm (ADI).The ADI was implemented in two phases.An initial solution on only truck tours was built using three heuristics(namely the Nearest Neighbour Heuristic,Genetic Algorithm,and Random Cluster/tour).ThemTSPsolution was generated from the initial tour in the second phase.The method was then experimented on a single truck,multiple trucks,and a single truck and drone system,and the solution was compared with the existing MIP solution.The system reported a promising,competitive performance.It could be deduced that solutions generated from the initial solution by heuristics,such as Nearest Neighbour,hold promising performances.

    Víctor et al.[42]solved the Euclidean TSPs of small and large data sizes with an efficient heuristic that is based on the Girding Polygon,which does not take up much computer memory space and produces approximate results that are near-optimal.The computational performance of the proposed approximate heuristic was compared to that of NNH,which is another approximate heuristic.It was noticed that the proposed heuristic outperformed NNH with an average error of 16.89% while that of NN was 26.55%;it also had standard deviations of 0.05%,and NNH had 0.04%.Even though the proposed algorithm did not produce optimal solutions for the instances used,it gave an approximate solution significantly better than NNH’s.

    Insertion heuristics starts from an arbitrary point to form a sub-tour or partial circuit.Nodes not already in the sub-tour are then inserted based on predefined criteria such that the increment to the total distance of the sub-tour is minimized [23,32].Suppose that nodexis to be added to the edge(xi,xj),and given the cost functionc(xi,xj,x),then,c(xi,xj,x)=d(x,xi)+d(x,xj)-d(xi,xj).Each insertion technique method aims to add a node to an edge(that is,between two nodes)at a minimal cost.Given the sub-tourTi,and given thatxis the next node to be inserted,the insertion technique insertsxbetweenandinTi.Accordingly:

    Insertion techniques are desirable because of their speed,ease of implementation,quality of solutions,and the fact that they can be easily modified to handle complex constraints[43].There are four generally known insertion techniques:Nearest Insertion,Cheapest Insertion,Random Insertion,and Farthest Insertion.Others include Priciest Insertion,quick insertion,and greatest angle insertion[36–44].

    Insertion techniques can be used to get a good tour construction solution[45–47];according to Rosenkrantz et al.[33],insertion techniques findO(logn)approximate solutions.Insertion techniques are also used as an initial solution for improvement heuristics and metaheuristics;insertion techniques have been proven to significantly improve the performance of 2-Opt methods when used as initial solutions[46].Other researchers have presented new insertion techniques,either as a modification of state-of-the-art methods or as novel efforts.

    Experimentally,the Farthest Insertion Heuristic has been known to outperform the Random Insertion,the Cheapest Insertion,and the Nearest Insertion in that order[33–47].

    3 The Proposed HMIH Technique

    The proposed technique is an insertion method referred to in this study as the Half Max Insertion Heuristic (HMIH).The motivation was to explore some strategies with the possibility of improved tour accuracy.The design of the HMIH was motivated by two observations in literature: One,the superior solution quality of insertion techniques based on the use of polygons as an initial tour[23–42]and secondly,the limitation of the FIH’s accuracy due to the distance between its initial circuits and the next node to be inserted.Huang et al.[32]argued that although FIH performs relatively well,the distance between its circuit and new nodes to be inserted impedes its accuracy.

    The insertion heuristics randomly pick one node fromQbyinit(Q) and create a partial circuit which is expanded with every iteration.The partial circuit is made up of a minimum polygon pointu,v,w.

    LetTirepresent the partial circuit across nodes of sizeidefined asTi=(π1,π2,...,πi,π1).During the(i+1)thiteration,the insertion aims to add one node into the current circuit while minimizing the increment in the overall circuit distance.The objective is to determine how to select a node,x,fromQTiand determine how to insertxintoTito obtainTi+1.

    Consider an insertion of a nodex(/∈Ti)betweenu,vandwinTi:

    The method first determines the longest distance.dmaxof any node from either ofuorvand computeIt then find a nodewnot in the sub tour whose distance from eitheru or v≈Determine an edge(u,v)of the sub-tour to which the insertion ofwgives the smallest increase of length,i.e.,for which Δf=cux+cxv+cwx-cuvwis smallest.Insertxbetweenu,vandw.This process is iterated until a Hamiltonian cycle is formed.

    The procedure is as follows:

    The HMIH searches requireO(n)time;therefore,the time complexity of the algorithm isO(n2).The procedure is further depicted in the following flowchart in Fig.2.

    Figure 2: Flowchart of the half max insertion heuristic

    In implementing the proposed technique,the JAVA programming language version 13.0.1.was used,while GNUplot 5.2 and patch-level eight were used to plot the path graph.The heuristic was implemented on Intel Pentium Core i7 3 GHz,Windows 10(64 bit).

    4 Experimental Results

    We experimented with the HMIH,together with two State-of-the-art heuristics(namely Nearest Neighbour Heuristic (NNH) and Farthest Insertion Heuristic (FIH)) on ten publicly available benchmark instances from TSPLIB made available by Heidelberg University on http://comopt.ifi.uniheidelberg.de/software/TSPLIB95/tsp/.There were three groups of instances tested.Group one was instances whose nodes were less than 100.Group two:Instances whose nodes are more than 100 but less than 1000.Group three:Instances whose nodes are more than or equal to 1000.The implementation module generated three outputs.The first is the computation time in milliseconds(ms).Millisecond is one millionth of a second.Evidently,the accuracy of time is improved at that level of granularity.The second output is the tour cost,the distance taken to generate the tour.This is necessary for the performance evaluation of the heuristic.The third output is the tour path,the order in which the nodes join the tour.Table 2.shows the computational speed of the NNH,FIH and the proposed HMIH on the ten benchmark instances considered.Table 3 shows the tour cost of each of the three heuristics on the TSP instances.

    Table 2: The computational speed of NNH,FIH and HMIH on ten benchmark instances

    Table 3: Tour cost of NNH,FIH and HMIH on ten benchmark instances

    It is evident from Table 3 that the proposed HMIH has a shorter tour cost and is closer to the optimal tour cost in terms of solution quality than both FIH and NNH.FIH,however,compares more favourably with HMIH than NNH.

    The FIH and HMIH tour graph for some benchmark instances is presented in Figs.3–6.Fig.3 displays the path graph of FIH and HMIH for theatt48.Fig.4 shows the path graph of FIH and HMIH for theeil51.Fig.5 displays the path graph of FIH and HMIH for theeil101,and Fig.6 displays the path graph of FIH and HMIH for thech150.

    Figure 3: Path graph of FIH and HMIH for att48

    Figure 4: Path graph of FIH and HMIH for eil51

    Figure 5: Path graph of FIH and HMIH for eil101

    Figure 6: Path graph of FIH and HMIH for ch150

    5 Non-Parametric Analysis of HMIH

    Non-parametric analysis was conducted using Friedman’s test to validate the superior performance of the HMIH solutions for both NNH and FIH,which are classic tour construction heuristics.The test was conducted for all the ten instances considered in this study.The Friedman ranking was conducted based on the tour cost of the three algorithms,as presented in Table 3.The mean ranking for HMIH,NNH and FIH across all instances shown in Table 4 revealed a significant difference between the performance of HMIH and that of NNH and FIH.

    Table 4: Freidman mean ranking for the Heuristics across all instances

    These rank scores indicate that,on average,the HMIH algorithm(with the least score)performed best,followed by FIH and NNH.

    Given the rank,as presented in Table 4,Freidman’s test was then conducted using the following equation:

    where:

    nis the number of instances=10

    kis the number of TSP solutions,which in this case is 3

    Riis the sum of ranks for thei-thalgorithm

    The test was premised on the following hypothesis

    -Null Hypothesis(H0):There is no significant difference among the algorithms.

    -Alternative Hypothesis(H1):There is a significant difference among the algorithms.

    Thus,Friedman’s test on the given data instances for the three TSP heuristics(NNH,FIH,HMIH)yielded a test statistic of approximately 15.37 and ap-value of about 0.00046.Since thep-value is less than 0.05,the null hypothesis that there is no significant difference in the performance of these algorithms is therefore rejected.This indicates that the HMIH performs significantly differently from the others.

    Friedman’s analysis revealed that the HMIH technique exhibits a statistically significant superiority to NNH and FIH in performance.

    6 Performance Evaluation and Discussion of Findings

    Table 2 shows that the Nearest Neighbour Heuristic had the fastest computational speed,followed by the Farthest Insertion Heuristic and then the proposed HMI technique in all the instances.It should be noted that the proposed HMIH compared favourably with the FIH in this regard.This is consistent with literature findings that insertion techniques require more computational time than the NNH to complete tours [48–50].Additionally,the increased computational time of the proposed HMIH can be attributed to the additional computation of thehalf-maxinsertion criteria.This is consistent with works by[47–49,51],which suggest that computational speed is affected by the insertion criteria computations.

    The quality of the heuristic’s solution was assessed using the following factors:

    Percentage Error (δ):the percentage error of the heuristics’solution quality is the percentage deviation of the solution from the optimal tour solution.This is computed as×100%,wheresolηis the solution cost obtained by each heuristic,andoptis the optimal solution cost.This is equivalent to the performance ratio for suboptimal heuristics.

    Quality impr. (Σ):this involves enhancing the solution quality of the HMI method with NNH and FIH.This is computed by ENNH/FIH-EHMIH,where ENNH/FIHis the error in percentage of the NNH or FIH and EHMIHis the error in the percentage of the HMIH.

    Goodness Value( ):this is also known as accuracy.This is the inverse of error and is computed as

    Table 5 displays thepercentageerror,qualityimprandgoodnessvaluefor all the heuristics on the ten benchmark instances.

    Table 5: Percentage error,qualityimpr and goodness value for all the heuristics on the ten benchmark instances

    From Table 5,HMIH outperformed FIH in all the instances exceptpr439,eil51andeil101.FIH outperformed HMIH for pr439,while FIH and HMIH had equal tour costs foreil51andeil101.The quality of the NNH tour was,on average,24.51% lower than the quality of the highest-quality trip.Regarding the examples that were considered,the FIH average performance was 16.24%of the Held-Karp lower limit.At its highest point,the Nearest Neighbour Heuristic attained a value of 32%,while its lowest point was 17.8%.At its highest point,the Farthest Insertion Heuristic achieved a value of 26.3%,while its lowest point was 6.7%.There is a correlation between these performances and the results that have been published in the literature about NNH and FIH[47–49].Conversely,the performance of HMIH was 12.1%lower than the ideal tour duration.This was a significant difference.The HMIH that has been presented has a quality improvement of 4.14%points on average compared to the FIH.This chart,seen in Fig.7,illustrates the percentage of departure that NNH,FIH,and HMIH have from the ideal tour length.

    Figure 7: Percentage error of NNH,FIH and HMIH on the ten benchmark instances

    The shaded area of the chart denotes the quality improvement of the HMIH over the FIH.

    The proposed Half Max Insertion Heuristic consistently outperformed the Farthest Insertion.As seen by the shaded region of quality improvement in Fig.7,the heuristic was applied throughout a broad spectrum of benchmark examples,and it had a statistical significance of up to sixteen percent at one point.A comparison was made between the proposed HMIH and the Farthest Insertion,which had an average goodness value of 81.7%,and the Nearest Neighbour Heuristic,which had an average goodness value of 74.5%.This means the proposed HMIH has a higher accuracy than FIH and NNH(see Fig.8).It is worthy of note that the Farthest Insertion is considered the best-performing Insertion technique and among other lower-order complexity heuristics[31,47–50].

    Additionally,while the Farthest Insertion is faster,the computation speed of the proposed HMIH is within the same range,and since the HMIH searches were conductedO(n) times,HMIH has the same complexity ofO(n2) as the FIH and NNH.The computational speed performance of HMIH appears to follow a trend among lower-order complexity heuristics where the performing method tends to take longer computation time,perhaps owing to a more intricate process involved in getting better performance.Except for Random Insertion,which requires no computation effort to add new nodes,the better the performance,the longer the time of computation tends to be[47–52].

    Acknowledgement:The authors gratefully acknowledge the support of the Landmark University Center for Research Innovation and Development (LUCRID) for access to research repositories,literary materials,useful insights from affiliate researchers and funding.

    Funding Statement:This research is supported by the Centre of Excellence in Mobile and e-Services,the University of Zululand,Kwadlangezwa,South Africa.

    Author Contributions:The authors confirm their contribution to the paper as follows: Study conception and design: E.O.Asani,A.E.Okeyinka;data collection: A.A.Adebiyi,E.O.Asani,and R.O.Ogundokun;methodology: A.E.Okeyinka,A.A.Adebiyi,and E.O.Asani;validation and visualization:E.O.Asani,R.O.Ogundokun,T.S.Adekunle,P.Mudali,and M.O.Adigun;analysis and interpretation of results:E.O.Asani,S.A.Ajagbe,T.S.Adekunle,P.Mudali,and M.O.Adigun;draft manuscript preparation:R.O.Ogundokun,E.O.Asani,S.A.Ajagbe.All authors reviewed the results and approved the final version of the manuscript.

    Availability of Data and Materials:The data used for the implementation of this study is publicly available benchmark instances from TSPLIB made available by Heidelberg University on http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp/.

    Conflicts of Interest:The authors declare that there is no conflict of interest regarding the publication of this paper.

    精品久久久久久久人妻蜜臀av| 亚洲性夜色夜夜综合| 一区二区三区四区激情视频 | 成人三级黄色视频| 欧美性猛交╳xxx乱大交人| 久99久视频精品免费| 中文字幕人妻熟人妻熟丝袜美| 日韩国内少妇激情av| 国产黄色免费在线视频| 亚洲国产欧美在线一区| 五月天丁香电影| 观看免费一级毛片| 亚洲电影在线观看av| 少妇丰满av| 视频中文字幕在线观看| 嘟嘟电影网在线观看| 久久久欧美国产精品| 男的添女的下面高潮视频| 97超视频在线观看视频| 日本欧美国产在线视频| 亚洲丝袜综合中文字幕| av网站免费在线观看视频| 亚洲自偷自拍三级| 男人和女人高潮做爰伦理| 欧美高清性xxxxhd video| 国产探花极品一区二区| 日韩中字成人| 卡戴珊不雅视频在线播放| 超碰97精品在线观看| 另类亚洲欧美激情| 午夜日本视频在线| 亚洲欧美成人精品一区二区| 两个人的视频大全免费| 综合色av麻豆| 亚洲成人一二三区av| 久久久欧美国产精品| 日韩一本色道免费dvd| 九色成人免费人妻av| 老司机影院成人| 久久久久久久亚洲中文字幕| 国产爱豆传媒在线观看| 国产精品三级大全| 韩国av在线不卡| 小蜜桃在线观看免费完整版高清| 亚洲精品,欧美精品| 搡老乐熟女国产| 免费黄色在线免费观看| 国产毛片在线视频| 蜜臀久久99精品久久宅男| 精品一区在线观看国产| 国产探花极品一区二区| 免费观看a级毛片全部| 超碰av人人做人人爽久久| a级毛色黄片| 欧美老熟妇乱子伦牲交| 亚洲精品亚洲一区二区| 在线观看国产h片| 午夜激情福利司机影院| 伊人久久精品亚洲午夜| 美女主播在线视频| 欧美一区二区亚洲| 国产v大片淫在线免费观看| 日韩国内少妇激情av| av免费观看日本| 天美传媒精品一区二区| 亚洲av在线观看美女高潮| 亚洲欧美日韩东京热| 精品人妻视频免费看| 超碰av人人做人人爽久久| 国产一级毛片在线| 老司机影院毛片| 国产成人91sexporn| 97热精品久久久久久| av在线app专区| 人体艺术视频欧美日本| 五月玫瑰六月丁香| 国产片特级美女逼逼视频| 高清在线视频一区二区三区| 精品久久久噜噜| 国产精品99久久久久久久久| 日本三级黄在线观看| 欧美高清性xxxxhd video| 国产一级毛片在线| 人人妻人人爽人人添夜夜欢视频 | 午夜激情久久久久久久| 久久久久九九精品影院| 亚洲国产成人一精品久久久| 可以在线观看毛片的网站| 国产毛片在线视频| 免费看a级黄色片| 亚洲国产欧美人成| 18禁裸乳无遮挡免费网站照片| 国产 精品1| 精品久久久噜噜| 九九在线视频观看精品| 成年版毛片免费区| 免费av观看视频| 欧美高清成人免费视频www| 国产老妇女一区| 日韩三级伦理在线观看| 亚洲人与动物交配视频| 精品酒店卫生间| 亚洲欧美成人综合另类久久久| 亚洲精品影视一区二区三区av| 国产日韩欧美亚洲二区| 国产精品一区二区性色av| 国产精品三级大全| 午夜精品国产一区二区电影 | 欧美性猛交╳xxx乱大交人| 亚洲精品中文字幕在线视频 | 国产在线一区二区三区精| 国产伦理片在线播放av一区| 内射极品少妇av片p| 日韩免费高清中文字幕av| 欧美成人精品欧美一级黄| 久久精品国产a三级三级三级| 国产成人freesex在线| av.在线天堂| 日韩中字成人| 欧美另类一区| 水蜜桃什么品种好| 午夜精品一区二区三区免费看| 国产精品.久久久| 在线观看av片永久免费下载| 99久久中文字幕三级久久日本| 一区二区三区四区激情视频| 大片免费播放器 马上看| 国产中年淑女户外野战色| 高清在线视频一区二区三区| 人妻一区二区av| 成人毛片60女人毛片免费| 免费播放大片免费观看视频在线观看| 久久ye,这里只有精品| 插阴视频在线观看视频| 嘟嘟电影网在线观看| 日韩av免费高清视频| 欧美另类一区| 热re99久久精品国产66热6| 看免费成人av毛片| 国产男女内射视频| 亚洲精品456在线播放app| 欧美最新免费一区二区三区| 97在线视频观看| 成年女人在线观看亚洲视频 | 久久久色成人| 不卡视频在线观看欧美| 最近最新中文字幕免费大全7| 乱系列少妇在线播放| 日韩成人伦理影院| 又大又黄又爽视频免费| 好男人在线观看高清免费视频| 亚洲精华国产精华液的使用体验| 亚洲怡红院男人天堂| 国产亚洲av嫩草精品影院| 美女被艹到高潮喷水动态| 街头女战士在线观看网站| 午夜福利视频精品| 亚洲丝袜综合中文字幕| 国内揄拍国产精品人妻在线| 99热全是精品| 欧美三级亚洲精品| 深爱激情五月婷婷| 99热这里只有是精品50| 哪个播放器可以免费观看大片| 天天躁日日操中文字幕| 中文字幕久久专区| 26uuu在线亚洲综合色| 一本久久精品| 国产探花极品一区二区| 日本猛色少妇xxxxx猛交久久| 干丝袜人妻中文字幕| 黄色日韩在线| 欧美性猛交╳xxx乱大交人| 别揉我奶头 嗯啊视频| 欧美精品人与动牲交sv欧美| 一区二区三区四区激情视频| 日韩欧美一区视频在线观看 | 亚洲精品日韩在线中文字幕| 能在线免费看毛片的网站| 成人一区二区视频在线观看| 日韩中字成人| 亚洲国产色片| 国产男女超爽视频在线观看| 听说在线观看完整版免费高清| 精品99又大又爽又粗少妇毛片| 国产免费福利视频在线观看| 国产精品久久久久久av不卡| 国产欧美日韩精品一区二区| 99久久精品热视频| 久久久久国产精品人妻一区二区| 大陆偷拍与自拍| 狂野欧美激情性xxxx在线观看| 中文字幕亚洲精品专区| 午夜日本视频在线| 2021少妇久久久久久久久久久| 国产成人午夜福利电影在线观看| 丰满人妻一区二区三区视频av| 97精品久久久久久久久久精品| 99久久九九国产精品国产免费| 亚洲av免费在线观看| 成年免费大片在线观看| 欧美精品一区二区大全| 久久6这里有精品| 夜夜爽夜夜爽视频| 日韩精品有码人妻一区| 建设人人有责人人尽责人人享有的 | 亚洲精品国产av蜜桃| 亚洲第一区二区三区不卡| av在线天堂中文字幕| 日日啪夜夜爽| 亚洲天堂av无毛| 热99国产精品久久久久久7| 久久精品国产亚洲av涩爱| 国产成人91sexporn| 日韩一区二区三区影片| 精品熟女少妇av免费看| 欧美成人a在线观看| 成人欧美大片| 日韩不卡一区二区三区视频在线| 久久99热6这里只有精品| 99精国产麻豆久久婷婷| 亚洲色图综合在线观看| 日日摸夜夜添夜夜添av毛片| 一级片'在线观看视频| 亚洲av不卡在线观看| 两个人的视频大全免费| 丰满少妇做爰视频| 大香蕉久久网| av在线天堂中文字幕| 久久久久久久亚洲中文字幕| 婷婷色综合大香蕉| 亚洲精品成人av观看孕妇| 美女脱内裤让男人舔精品视频| av在线天堂中文字幕| 99热这里只有是精品50| 国产精品久久久久久精品电影| 少妇 在线观看| 亚洲成人av在线免费| 搡老乐熟女国产| av在线老鸭窝| 亚洲美女视频黄频| 国产一级毛片在线| 免费看a级黄色片| 日本欧美国产在线视频| 国产老妇女一区| 青青草视频在线视频观看| 成人美女网站在线观看视频| 亚洲综合色惰| 九九爱精品视频在线观看| 亚洲激情五月婷婷啪啪| 在线免费十八禁| 波野结衣二区三区在线| 国产av国产精品国产| 少妇的逼水好多| 亚州av有码| 久久久久久久大尺度免费视频| 两个人的视频大全免费| 日本欧美国产在线视频| 高清午夜精品一区二区三区| 女人十人毛片免费观看3o分钟| 国产精品国产av在线观看| 一本—道久久a久久精品蜜桃钙片 精品乱码久久久久久99久播 | 亚洲第一区二区三区不卡| 国精品久久久久久国模美| 午夜视频国产福利| 久久人人爽人人爽人人片va| 久久久久久久久久久丰满| 蜜臀久久99精品久久宅男| 在现免费观看毛片| 99视频精品全部免费 在线| 在线观看美女被高潮喷水网站| 夜夜爽夜夜爽视频| 黑人高潮一二区| 国产爽快片一区二区三区| 亚洲真实伦在线观看| 好男人在线观看高清免费视频| 成人亚洲精品一区在线观看 | 最近手机中文字幕大全| 亚洲成色77777| 在线观看美女被高潮喷水网站| 可以在线观看毛片的网站| 成人国产av品久久久| 亚洲欧洲国产日韩| 欧美成人精品欧美一级黄| 亚洲av国产av综合av卡| 国产精品一区www在线观看| 精品国产露脸久久av麻豆| 亚洲欧美日韩卡通动漫| 亚洲国产日韩一区二区| 久久久精品欧美日韩精品| 国产成人a区在线观看| 少妇人妻 视频| 热re99久久精品国产66热6| 国内少妇人妻偷人精品xxx网站| 一本久久精品| 精品国产露脸久久av麻豆| 国精品久久久久久国模美| 中国美白少妇内射xxxbb| 天天躁日日操中文字幕| 免费大片黄手机在线观看| 久久ye,这里只有精品| 夜夜爽夜夜爽视频| 亚洲国产欧美在线一区| 免费少妇av软件| 久久久久久伊人网av| 18禁动态无遮挡网站| 汤姆久久久久久久影院中文字幕| 一级黄片播放器| 欧美精品一区二区大全| 丝袜脚勾引网站| 全区人妻精品视频| 男插女下体视频免费在线播放| 女人久久www免费人成看片| 欧美性感艳星| 人人妻人人爽人人添夜夜欢视频 | 亚洲精品aⅴ在线观看| 偷拍熟女少妇极品色| 日韩一区二区三区影片| 韩国av在线不卡| 久热这里只有精品99| 国产午夜精品久久久久久一区二区三区| 亚洲,一卡二卡三卡| 国产久久久一区二区三区| 亚洲经典国产精华液单| 国产一区亚洲一区在线观看| videos熟女内射| 视频区图区小说| 国产一级毛片在线| 五月伊人婷婷丁香| 如何舔出高潮| 91aial.com中文字幕在线观看| 国产淫片久久久久久久久| 亚洲第一区二区三区不卡| 性色avwww在线观看| 欧美激情久久久久久爽电影| 中国国产av一级| 日韩欧美一区视频在线观看 | 纵有疾风起免费观看全集完整版| 亚洲精品国产av成人精品| 亚洲色图av天堂| 久久6这里有精品| 日韩国内少妇激情av| 偷拍熟女少妇极品色| 欧美日本视频| 欧美性猛交╳xxx乱大交人| 免费看不卡的av| 国产亚洲午夜精品一区二区久久 | 91久久精品国产一区二区三区| 美女被艹到高潮喷水动态| 又粗又硬又长又爽又黄的视频| 丝袜喷水一区| 高清日韩中文字幕在线| 涩涩av久久男人的天堂| 一本色道久久久久久精品综合| 又爽又黄a免费视频| 日本wwww免费看| 女的被弄到高潮叫床怎么办| 日韩中字成人| 高清毛片免费看| 草草在线视频免费看| 久久久久久久大尺度免费视频| 日本色播在线视频| 久久久久久久大尺度免费视频| 哪个播放器可以免费观看大片| 美女视频免费永久观看网站| 91aial.com中文字幕在线观看| 天堂俺去俺来也www色官网| 国产黄色免费在线视频| 久久精品久久久久久久性| 只有这里有精品99| 免费看av在线观看网站| 成人黄色视频免费在线看| 男人狂女人下面高潮的视频| 又大又黄又爽视频免费| 日日啪夜夜爽| 国产欧美另类精品又又久久亚洲欧美| 成人一区二区视频在线观看| 91久久精品国产一区二区三区| 国产成人午夜福利电影在线观看| 免费大片18禁| 岛国毛片在线播放| 六月丁香七月| 免费av不卡在线播放| 欧美日韩国产mv在线观看视频 | 黑人高潮一二区| 亚洲人成网站高清观看| 国产成人福利小说| 熟女av电影| 欧美一区二区亚洲| 少妇高潮的动态图| 大片免费播放器 马上看| 在线a可以看的网站| 精品久久久精品久久久| 永久网站在线| 国产片特级美女逼逼视频| av网站免费在线观看视频| 最近2019中文字幕mv第一页| 2021天堂中文幕一二区在线观| 国产精品一二三区在线看| 国产精品偷伦视频观看了| 欧美丝袜亚洲另类| 亚洲熟女精品中文字幕| 日本三级黄在线观看| 免费av毛片视频| 成人二区视频| 成人毛片60女人毛片免费| 卡戴珊不雅视频在线播放| 看黄色毛片网站| 国产欧美另类精品又又久久亚洲欧美| 美女高潮的动态| 交换朋友夫妻互换小说| 卡戴珊不雅视频在线播放| 国产精品人妻久久久久久| 日韩大片免费观看网站| 国产精品一二三区在线看| 免费观看av网站的网址| 校园人妻丝袜中文字幕| 国产探花在线观看一区二区| 少妇丰满av| 简卡轻食公司| 夫妻性生交免费视频一级片| 97热精品久久久久久| 成年女人看的毛片在线观看| 亚洲国产色片| 自拍偷自拍亚洲精品老妇| 如何舔出高潮| 99久久精品热视频| 欧美97在线视频| 亚洲内射少妇av| 国产在线男女| 免费观看性生交大片5| 十八禁网站网址无遮挡 | 久久久精品94久久精品| 欧美人与善性xxx| 69av精品久久久久久| 大陆偷拍与自拍| 最近手机中文字幕大全| 男女啪啪激烈高潮av片| 热re99久久精品国产66热6| 日韩伦理黄色片| 久久精品国产亚洲av天美| 国产精品一及| 免费人成在线观看视频色| a级毛片免费高清观看在线播放| 久久久欧美国产精品| 美女xxoo啪啪120秒动态图| 亚洲国产日韩一区二区| 亚洲欧美清纯卡通| 日韩人妻高清精品专区| 亚洲精品中文字幕在线视频 | 亚洲成人av在线免费| 一本一本综合久久| 国产黄色免费在线视频| 国产一级毛片在线| 七月丁香在线播放| 午夜精品一区二区三区免费看| 激情五月婷婷亚洲| 天天一区二区日本电影三级| 好男人视频免费观看在线| av在线蜜桃| 国产视频内射| 看非洲黑人一级黄片| 国产日韩欧美亚洲二区| 少妇的逼好多水| 午夜福利网站1000一区二区三区| 午夜爱爱视频在线播放| 日本色播在线视频| 国产亚洲av片在线观看秒播厂| 亚洲av福利一区| 在线播放无遮挡| 色视频在线一区二区三区| 久久女婷五月综合色啪小说 | 国产欧美亚洲国产| 高清欧美精品videossex| 久久99精品国语久久久| 成年av动漫网址| 七月丁香在线播放| 亚洲人成网站在线观看播放| av在线播放精品| 精品国产露脸久久av麻豆| 水蜜桃什么品种好| 3wmmmm亚洲av在线观看| 丝袜喷水一区| 国产精品精品国产色婷婷| 黄色配什么色好看| 热99国产精品久久久久久7| 蜜臀久久99精品久久宅男| 18禁动态无遮挡网站| 黑人高潮一二区| kizo精华| 国产高清有码在线观看视频| 欧美三级亚洲精品| 久久精品国产亚洲网站| 少妇人妻久久综合中文| 国产伦精品一区二区三区四那| 黄色怎么调成土黄色| 成人亚洲欧美一区二区av| 中文乱码字字幕精品一区二区三区| 亚洲精品,欧美精品| 亚洲国产精品国产精品| 国产男女内射视频| 黄色一级大片看看| 日本欧美国产在线视频| 少妇人妻一区二区三区视频| 中文字幕人妻熟人妻熟丝袜美| 欧美国产精品一级二级三级 | 亚洲,欧美,日韩| 97热精品久久久久久| 交换朋友夫妻互换小说| 女的被弄到高潮叫床怎么办| 国产成人精品婷婷| 日韩国内少妇激情av| 毛片女人毛片| freevideosex欧美| 又爽又黄a免费视频| 亚洲欧洲日产国产| 久久久久国产网址| 下体分泌物呈黄色| 亚洲天堂av无毛| 久久久久久久亚洲中文字幕| 听说在线观看完整版免费高清| 欧美最新免费一区二区三区| 亚洲欧美日韩另类电影网站 | xxx大片免费视频| 亚洲无线观看免费| 高清欧美精品videossex| 国产黄色免费在线视频| 尤物成人国产欧美一区二区三区| 久久久久久久午夜电影| 免费av不卡在线播放| 51国产日韩欧美| 成人国产麻豆网| 80岁老熟妇乱子伦牲交| av卡一久久| 亚洲精品视频女| 久久久久久久大尺度免费视频| 在线观看三级黄色| 国产探花极品一区二区| 国产亚洲av嫩草精品影院| 亚洲欧美日韩无卡精品| 中文字幕人妻熟人妻熟丝袜美| 亚洲av电影在线观看一区二区三区 | 国产成人福利小说| 白带黄色成豆腐渣| 亚洲成人久久爱视频| 看非洲黑人一级黄片| av专区在线播放| 国精品久久久久久国模美| 91久久精品电影网| 男人狂女人下面高潮的视频| 亚洲av福利一区| 国产欧美亚洲国产| 中文乱码字字幕精品一区二区三区| 日韩中字成人| 精品视频人人做人人爽| 亚洲色图综合在线观看| 22中文网久久字幕| 亚洲精品一区蜜桃| 激情 狠狠 欧美| 全区人妻精品视频| 蜜桃亚洲精品一区二区三区| 黑人高潮一二区| 亚洲欧美日韩东京热| 色婷婷久久久亚洲欧美| 久久久久精品久久久久真实原创| 可以在线观看毛片的网站| 少妇猛男粗大的猛烈进出视频 | 春色校园在线视频观看| 纵有疾风起免费观看全集完整版| 国产精品一区www在线观看| 中文字幕av成人在线电影| 午夜激情福利司机影院| 少妇人妻一区二区三区视频| 极品教师在线视频| 亚洲天堂av无毛| 中文字幕亚洲精品专区| 少妇人妻久久综合中文| 夜夜爽夜夜爽视频| 在线观看国产h片| 国产欧美亚洲国产| 亚洲婷婷狠狠爱综合网| 熟女电影av网| 老司机影院成人| 天天躁夜夜躁狠狠久久av| 少妇 在线观看| 亚洲精品,欧美精品| 国产日韩欧美亚洲二区| 色视频在线一区二区三区| 三级国产精品欧美在线观看| 久久久久久久大尺度免费视频| 欧美另类一区| av天堂中文字幕网| 国产精品久久久久久精品古装| 国产成人精品婷婷| 国产黄片美女视频| 久久久久性生活片| av又黄又爽大尺度在线免费看| 国产成人精品福利久久| 亚洲欧美日韩另类电影网站 | 亚洲精品国产成人久久av| 国产av码专区亚洲av| 欧美日韩亚洲高清精品| 国产视频首页在线观看| 日本免费在线观看一区| 如何舔出高潮| 亚洲最大成人av| av在线蜜桃| 精品亚洲乱码少妇综合久久| 国产精品女同一区二区软件| 中文天堂在线官网| 中文在线观看免费www的网站| av国产精品久久久久影院| freevideosex欧美| 精品久久久噜噜| av国产久精品久网站免费入址|