Computational Experience with an M-Salesman Traveling Salesman Algorithm
From MaRDI portal
Publication:5670445
DOI10.1287/mnsc.19.7.790zbMath0255.90033OpenAlexW2068343681MaRDI QIDQ5670445
Vaughn E. Huckfeldt, Joseph A. Svestka
Publication date: 1973
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.7.790
Related Items (22)
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm ⋮ Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ An interactive decision support system for the bank courier routing problem ⋮ Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations ⋮ Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations ⋮ A MILP model for then-job,M-stage flowshop with sequence dependent set-up times ⋮ Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem ⋮ ALTO: A computer system for the design of vehicle routing algorithms ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem ⋮ An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A columnar competitive model for solving multi-traveling salesman problem ⋮ Integer linear programming formulations of multiple salesman problems and its variations ⋮ Truncated \(M\)-travelling salesman problem ⋮ A continuous variable representation of the traveling salesman problem ⋮ An approach for solving a class of transportation scheduling problems ⋮ Vehicle routing via column generation ⋮ An algorithm for the traveling salesman problem with pickup and delivery customers ⋮ A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
This page was built for publication: Computational Experience with an M-Salesman Traveling Salesman Algorithm
