The delivery man problem with time windows
From MaRDI portal
Publication:429673
DOI10.1016/J.DISOPT.2010.06.002zbMath1241.90110OpenAlexW2114675299MaRDI QIDQ429673
Géraldine Heilporn, Gilbert Laporte, Jean-François Cordeau
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
traveling salesman problemmixed integer linear programmingtime windowsdelivery man problempolyhedral analysis
Related Items (12)
A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ Scheduling last-mile deliveries with truck-based autonomous robots ⋮ A comparison of three metaheuristics for the workover rig routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem ⋮ 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 ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem ⋮ A metaheuristic for the delivery man problem with time windows
Uses Software
Cites Work
- Unnamed Item
- Exact algorithms for the minimum latency problem
- 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
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- A new formulation for the traveling deliveryman problem
- An improved approximation ratio for the minimum latency problem
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- The minimum latency problem
- A Hybrid Exact Algorithm for the TSPTW
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Special cases of traveling salesman and repairman problems with time windows
- TSPLIB—A Traveling Salesman Problem Library
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Delivery Man Problem and Cumulative Matroids
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Time‐dependent traveling salesman problem–the deliveryman case
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The traveling salesman problem with cumulative costs
- The open vehicle routing problem with time windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
This page was built for publication: The delivery man problem with time windows
