A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter

In this paper, we have presented a solid travelling salesman problem (STSP) with introduction of time‐window and constraints. In STSP, a traveller can avail different conveyance for travelling. Also as constraint, a risk factor is there joining a path between two cities. During a tour, the traveller must ensure that the entire risk of the tour is within a prearranged risk level. Costs, time, and risk factor of travel using different conveyances are dissimilar and interval in nature. Finding a complete tour with minimum cost is the goal of the problem, where risk and time‐window constraints are also to be satisfied. The standard genetic algorithm (GA) is modified by adding three features, namely refinement, immigration, and refreshing population, and thus a modified GA is devised to solve the intended problem. The efficiency of the algorithm is tested by using some model datasets from TSPLIB and some existing benchmark test functions.