The delivery man problem with time windows
From MaRDI portal
Publication:429673
DOI10.1016/J.DISOPT.2010.06.002zbMATH Open1241.90110OpenAlexW2114675299MaRDI QIDQ429673FDOQ429673
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
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
time windowstraveling salesman problemmixed integer linear programmingdelivery man problempolyhedral analysis
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The open vehicle routing problem with time windows
- An improved approximation ratio for the minimum latency problem
- The minimum latency problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Special cases of traveling salesman and repairman problems with time windows
- The Delivery Man Problem and Cumulative Matroids
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Time‐dependent traveling salesman problem–the deliveryman case
- The traveling salesman problem with cumulative costs
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- Exact algorithms for the minimum latency problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Title not available (Why is that?)
- A new formulation for the traveling deliveryman problem
- A new heuristic for the traveling salesman problem with time windows.
- A hybrid exact algorithm for the TSPTW
Cited In (23)
- A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
- An optimization approach for communal home meal delivery service: A case study
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
- Hybrid optimization methods for time-dependent sequencing problems
- The Delivery Man Problem and Cumulative Matroids
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- A new formulation for the traveling deliveryman problem
- The Surgical Patient Routing Problem: A Central Planner Approach
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- The concrete delivery problem
- The delivery man problem on a tree network
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Scheduling last-mile deliveries with truck-based autonomous robots
- Skewed general variable neighborhood search 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
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- A metaheuristic for the delivery man problem with time windows
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Modeling Distribution Problems with Time Windows: Part I
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- A comparison of three metaheuristics for the workover rig routing problem
- A simple and effective metaheuristic for the minimum latency problem
Uses Software
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)
