2015 · 16 citations · 20 references
ComputingComputer ScienceAlgorithmsOptimizationScientific ComputingCombinatorial OptimizationHeuristic OptimizationHeuristic SearchMetaheuristic OptimizationSorting AlgorithmsHeuristic AlgorithmsInitializationNeighborhood SearchNp-hardnessTime WindowsTraveling Salesman ProblemTraveling Salesperson ProblemVariable Neighborhood Search
This paper presents a General Variable Search heuristic, trying to discover initial, feasible solution for the Travelling Salesman Problem with Time Windows. More specifically, we provide all relevant information regarding TSP-TW, Variable Neighborhood Search (VNS) and initialization methods, then we quote all related work in the direction on solving this NP-HARD problem, and at last we propose our new implementation for generating initial, feasible solution for the TSP-TW. We are thoroughly focused on the behavior of our main algorithm to different random-based or sorting-based initialization procedures of our main implemented algorithm. At last, we show experimentally that in some cases, the use of a sorting function as an initialization function in this algorithm did not work and never returned a feasible solution in some cases.
20
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
Nenad Mladenović, Pierre Hansen · Computers & Operations Research · 1997 · 4.1K citations
Metaheuristics in combinatorial optimization
Christian Blum, Andrea Roli · ACM Computing Surveys · 2003 · 3.1K citations
Metaheuristics in Combinatorial Optimization
Michel Gendreau, Jean‐Yves Potvin · Annals of Operations Research · 2005 · 2.3K citations