Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

DOI10.1016/J.COR.2021.105509MaRDI QIDQ2669602zbMATH OpenOpenAlexWikidataFDO

Authors 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

continuous approximation modeldynamic routingmachine learningmTSPtransportationtravelling salesman

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A dynamic vehicle routing problem with multiple delivery routes
• Adaptive labeling algorithms for the dynamic assignment problem
• Dynamic vehicle routing with time windows in theory and practice
• Partially dynamic vehicle routing—models and algorithms
• New policies for the dynamic traveling salesman problem

Cites work

• A distribution-free TSP tour length estimation model for random graphs
• 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
• Algorithms for Large-scale Travelling Salesman Problems
• An introduction to statistical learning. With applications in R
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Continuous approximation models in freight distribution management
• Efficiently solving very large-scale routing problems
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Integer linear programming formulations of multiple salesman problems and its variations
• New benchmark instances for the capacitated vehicle routing problem
• On the vehicle routing problem with lower bound capacities
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The traveling salesman problem. A computational study.
• Transformations of node-balanced routing problems

Cited in

(6)

• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• A sampling algorithm based on supervised learning for a dynamic traveling salesman problem
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
• Balancing resources for dynamic vehicle routing with stochastic customer requests
• Transparency of combinatorial optimisations via machine learning and explainable AI
• A bi-level approach for a dynamic multiple traveling salesman problem

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

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