A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter Online publication date: Wed, 13-Jul-2016
by Chiranjit Changdar; G.S. Mahapatra; Rajat Kumar Pal
International Journal of Operational Research (IJOR), Vol. 26, No. 4, 2016
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook