Solving the traveling delivery person problem with limited computational time
From MaRDI portal
Publication:2103948
Recommendations
- A new formulation for the traveling deliveryman problem
- The traveling salesman problem with pickup, delivery, and ride-time constraints
- Time‐dependent traveling salesman problem–the deliveryman case
- The \(k\)-delivery traveling salesman problem: revisited
- The traveling salesman problem with delivery and backhauls
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- A heuristic for the pickup and delivery traveling salesman problem
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The travelling salesman problem with pick-up and delivery
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
Cites work
- scientific article; zbMATH DE number 2079325 (Why is no real title available?)
- scientific article; zbMATH DE number 1507215 (Why is no real title available?)
- scientific article; zbMATH DE number 6297719 (Why is no real title available?)
- A Faster, Better Approximation Algorithm for the Minimum Latency Problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A branch-and-price algorithm for the minimum latency problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- A new formulation for the traveling deliveryman problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A simple and effective metaheuristic for the minimum latency problem
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Facets and valid inequalities for the time-dependent travelling salesman problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Natural and extended formulations for the time-dependent traveling salesman problem
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Orienteering problem: a survey of recent variants, solution approaches and applications
- P-Complete Approximation Problems
- Probability distribution of solution time in GRASP: an experimental investigation
- Semi-greedy heuristics: An empirical study
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
- The Delivery Man Problem and Cumulative Matroids
- The \(k\)-traveling repairmen problem
- The minimum latency problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- The traveling salesman problem with cumulative costs
- The travelling salesman problem with neighbourhoods: MINLP solution
- Time‐dependent traveling salesman problem–the deliveryman case
- Variable neighborhood search
- Variable neighborhood search for the travelling deliveryman problem
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
This page was built for publication: Solving the traveling delivery person problem with limited computational time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103948)
