Computational Experience with an M-Salesman Traveling Salesman Algorithm

DOI10.1287/MNSC.19.7.790MaRDI QIDQ5670445zbMATH OpenOpenAlexFDO

Authors Joseph A. Svestka, Vaughn E. Huckfeldt

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(22)

• Vehicle routing via column generation
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• ALTO: A computer system for the design of vehicle routing algorithms
• An approach for solving a class of transportation scheduling problems
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
• An interactive decision support system for the bank courier routing problem
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• 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
• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
• 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
• A continuous variable representation of the traveling salesman problem
• 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
• Truncated \(M\)-travelling salesman problem

This page was built for publication: Computational Experience with an M-Salesman Traveling Salesman Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5670445)