A new formulation for the traveling deliveryman problem

DOI10.1016/J.DAM.2008.05.009MaRDI QIDQ1003469zbMATH OpenOpenAlexFDO

Authors Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena

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

zbMATH Keywords

integer programmingbranch-and-cut algorithmstraveling deliveryman problem

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The Delivery Man Problem and Cumulative Matroids
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• The delivery man problem with time windows
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm

Cites work

• scientific article; zbMATH DE number 3912424 (Why is no real title available?)
• 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 2086925 (Why is no real title available?)
• scientific article; zbMATH DE number 2102754 (Why is no real title available?)
• A General Approximation Technique for Constrained Forest Problems
• An improved approximation ratio for the minimum latency problem
• Approximation schemes for minimum latency problems
• Exact algorithms for the minimum latency problem
• Facets of the linear ordering polytope
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
• News from the online traveling repairman.
• On-line single-server dial-a-ride problems
• P-Complete Approximation Problems
• The Delivery Man Problem and Cumulative Matroids
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The complexity of the travelling repairman problem
• The minimum latency problem
• Time‐dependent traveling salesman problem–the deliveryman case

Cited in

(35)

• An integer programming approach for the time-dependent TSP
• Solving the traveling delivery person problem with limited computational time
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
• Hybrid optimization methods for time-dependent sequencing problems
• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• On combining machine learning with decision making
• Routing multiple work teams to minimize latency in post-disaster road network restoration
• The Delivery Man Problem and Cumulative Matroids
• Facets and valid inequalities for the time-dependent travelling salesman problem
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
• Exact and Approximation Algorithms for the Expanding Search Problem
• Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem
• Weighted online minimum latency problem with edge uncertainty
• 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
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
• Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• The delivery man problem with time windows
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• The arc-item-load and related formulations for the cumulative vehicle routing problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• Natural and extended formulations for the time-dependent traveling salesman problem
• A New Formulation for the Travelling Salesman Problem
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• A comparison of three metaheuristics for the workover rig routing problem
• A simple and effective metaheuristic for the minimum latency problem
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
• Variable neighborhood search for the travelling deliveryman problem
• Minimizing latency in post-disaster road clearance operations
• The multi-depot \(k\)-traveling repairman problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A new formulation for the traveling deliveryman problem

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