The delivery man problem with time windows

DOI10.1016/J.DISOPT.2010.06.002MaRDI QIDQ429673zbMATH OpenOpenAlexFDO

Authors Géraldine Heilporn, Jean-François Cordeau, G. Laporte

Publication date 20 June 2012

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2010.06.002

zbMATH Keywords

time windowstraveling salesman problemmixed integer linear programmingdelivery man problempolyhedral analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• The pickup and delivery problem with time windows
• The Pickup And Delivery Problem With Time Windows And Transshipment
• The multi-pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and scheduled lines
• The pickup and delivery problem with time windows and occasional drivers
• The pickup and delivery problem with time windows and handling operations
• A metaheuristic for the delivery man problem with time windows
• An exact algorithm for the pickup and delivery problem with time windows
• scientific article; zbMATH DE number 7267210
• The pickup and delivery problem with alternative locations and overlapping time windows

Cites work

• scientific article; zbMATH DE number 870411 (Why is no real title available?)
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A generalized insertion heuristic for the travelling salesman problem with time windows
• A hybrid exact algorithm for the TSPTW
• A new formulation for the traveling deliveryman problem
• A new heuristic for the traveling salesman problem with time windows.
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• An improved approximation ratio for the minimum latency problem
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• Exact algorithms for the minimum latency problem
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• Special cases of traveling salesman and repairman problems with time windows
• TSPLIB—A Traveling Salesman Problem Library
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• 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 Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• The minimum latency problem
• The open vehicle routing problem with time windows
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The traveling salesman problem with cumulative costs
• Time‐dependent traveling salesman problem–the deliveryman case

Cited in

(25)

• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A metaheuristic for the delivery man problem with time windows
• A new formulation for the traveling deliveryman problem
• Models and algorithms for the delivery and installation routing problem
• The surgical patient routing problem: a central planner approach
• Hybrid optimization methods for time-dependent sequencing problems
• Optimising and recognising 2-stage delivery chains with time windows
• Modeling Distribution Problems with Time Windows: Part I
• A comparison of three metaheuristics for the workover rig routing problem
• The delivery man problem on a tree network
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• A simple and effective metaheuristic for the minimum latency problem
• Scheduling last-mile deliveries with truck-based autonomous robots
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
• The Delivery Man Problem and Cumulative Matroids
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
• A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
• The concrete delivery problem
• Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
• An optimization approach for communal home meal delivery service: A case study
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• 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

Describes a project that uses

Uses Software

• TSPLIB
• TSPTW

This page was built for publication: The delivery man problem with time windows

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