Publication | Closed Access

An improved shuffled frog-leaping algorithm for the minmax multiple traveling salesman problem

Mathematical ProgrammingEngineeringTraveling Salesman ProblemCombinatorial ProblemFrog-leaping AlgorithmVehicle Routing ProblemSalesman ProblemDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationTabu SearchHeuristic SearchOperations Research