A new formulation for the traveling deliveryman problem
From MaRDI portal
Publication:1003469
DOI10.1016/j.dam.2008.05.009zbMath1155.90471OpenAlexW2088342306MaRDI QIDQ1003469
Abilio Lucena, Isabel Méndez-Díaz, Paula Zabala
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.009
Programming involving graphs or networks (90C35) Linear programming (90C05) Eulerian and Hamiltonian graphs (05C45)
Related Items (31)
An integer programming approach for the time-dependent TSP ⋮ An integer programming approach for the time-dependent traveling salesman problem with time windows ⋮ A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ A comparison of three metaheuristics for the workover rig routing problem ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Variable neighborhood search for the travelling deliveryman problem ⋮ The delivery man problem with time windows ⋮ The time dependent traveling salesman problem: polyhedra and algorithm ⋮ Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem ⋮ Natural and extended formulations for the time-dependent traveling salesman problem ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits ⋮ On combining machine learning with decision making ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Solving the traveling delivery person problem with limited computational time
Uses Software
Cites Work
- Exact algorithms for the minimum latency problem
- An improved approximation ratio for the minimum latency problem
- News from the online traveling repairman.
- The minimum latency problem
- Approximation schemes for minimum latency problems
- Facets of the linear ordering polytope
- The complexity of the travelling repairman problem
- P-Complete Approximation Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Delivery Man Problem and Cumulative Matroids
- Time‐dependent traveling salesman problem–the deliveryman case
- A General Approximation Technique for Constrained Forest Problems
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
- On-line single-server dial-a-ride problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new formulation for the traveling deliveryman problem
