The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the...

The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the...

The two most influential models in delay discounting research have been the exponential (E) and hyperbolic (H) models. We develop a new methodology to design binary choice questions such that exponential and hyperbolic discount rates can be purposefully manipulated to make their rate parameters...