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

DOI10.1504/IJOR.2016.077688zbMath1362.90321OpenAlexW2470506531MaRDI QIDQ2627724

G. S. Mahapatra, Chiranjit Changdar, Rajat Kumar Pal

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2016.077688

zbMATH Keywords

genetic algorithms immigration travelling salesman problem time windows refinement constraints interval numbers constrained TSP population refreshing solid TSP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

TSPLIB

This page was built for publication: A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter