Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

DOI10.1016/j.cor.2021.105509OpenAlexW3081059499WikidataQ114193094 ScholiaQ114193094MaRDI QIDQ2669602

Wolfgang Garn

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.12063

zbMATH Keywords

transportationtravelling salesmanmachine learningdynamic routingcontinuous approximation modelmTSP

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Hybrid search with neighborhood reduction for the multiple traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distribution-free TSP tour length estimation model for random graphs
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Continuous approximation models in freight distribution management
• Efficiently solving very large-scale routing problems
• New benchmark instances for the capacitated vehicle routing problem
• A dynamic vehicle routing problem with time-dependent travel times
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A review of dynamic vehicle routing problems
• Integer linear programming formulations of multiple salesman problems and its variations
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Transformations of node‐balanced routing problems
• An Introduction to Statistical Learning
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Algorithms for Large-scale Travelling Salesman Problems

This page was built for publication: Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations