-The multiple traveling salesman problem (MTSP) involves the assignment and sequencing procedure simultaneously. The assignment of a set of nodes to each visitors and determining the sequence of visiting of nodes for each visitor. Since specific range of process is needed to be carried out in nodes in commercial environment, several factors associated with routing problem are required to be taken into account. This research considers visitors’ skill and category of customers which can affect visiting time of visitors in nodes. With regard to learning-by-doing, visiting time in nodes can be reduced. And different class of customers which are determined based on their potential purchasing of power specifies that required time for nodes can be vary. So, a novel optimization model is presented to formulate MTSP, which attempts to ascertain the optimum routes for salesmen by minimizing the makespan to ensure the balance of workload of visitors. Since this problem is an NP-hard problem, for overcoming the restriction of exact methods for solving practical large-scale instances within acceptable computational times. So, Artificial Immune System (AIS) and the Firefly (FA) metaheuristic algorithm are implemented in this paper and algorithms parameters are calibrated by applying Taguchi technique. The solution methodology is assessed by an array of numerical examples and the overall performances of these metaheuristic methods are evaluated by analyzing their results with the optimum solutions to suggested problems. The results of statistical analysis by considering 95% confidence interval for calculating average relative percentage of deviation (ARPD) reveal that the solutions of proposed AIS algorithm has less variation and Its’ confidence interval of closer than to zero with no overlapping with that of FA. Although both proposed meta-heuristics are effective and efficient in solving small-scale problems, in medium and large scales problems, AIS had a better performance in a shorter average time. Finally, the applicability of the suggested pattern is implemented in a case study in a specific company, namely Kalleh.
Makespan minimizing on multiple travel salesman problem with a learning effect of visiting time / Colombaroni, C.; Mohammadi, M.; Rahmanifar, G.. - In: WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL. - ISSN 1991-8763. - 15:(2020), pp. 508-526. [10.37394/23203.2020.15.50]
|Titolo:||Makespan minimizing on multiple travel salesman problem with a learning effect of visiting time|
COLOMBARONI, CHIARA (Corresponding author)
|Data di pubblicazione:||2020|
|Citazione:||Makespan minimizing on multiple travel salesman problem with a learning effect of visiting time / Colombaroni, C.; Mohammadi, M.; Rahmanifar, G.. - In: WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL. - ISSN 1991-8763. - 15:(2020), pp. 508-526. [10.37394/23203.2020.15.50]|
|Appartiene alla tipologia:||01a Articolo in rivista|