A time bucket formulation for the traveling salesman problem with time windows
From MaRDI portal
Publication:2815434
DOI10.1287/IJOC.1100.0432zbMATH Open1462.90103OpenAlexW1998126277MaRDI QIDQ2815434FDOQ2815434
Authors: Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani 
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1100.0432
Recommendations
- New state-space relaxations for solving the traveling salesman problem with time windows
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Cites Work
- Title not available (Why is that?)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- Probabilistic diversification and intensification in local search for vehicle routing
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- The precedence-constrained asymmetric traveling salesman polytope
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- State-space relaxation procedures for the computation of bounds to routing problems
- 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
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Title not available (Why is that?)
- A hybrid exact algorithm for the TSPTW
- Introduction to ABACUS -- a branch-and-cut system
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Enhanced mixed integer programming techniques and routing problems
Cited In (38)
- Beam-ACO for the travelling salesman problem with time windows
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
- A Joint Vehicle Routing and Speed Optimization Problem
- Branch-and-refine for solving time-expanded MILP formulations
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- New state-space relaxations for solving the traveling salesman problem with time windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Layered graph approaches for combinatorial optimization problems
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Comments on: ``Perspectives on integer programming for time-dependent models
- Perspectives on integer programming for time-dependent models
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- A classification of formulations for the (time-dependent) traveling salesman problem
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Pricing routines for vehicle routing with time windows on road networks
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- Optimizing the changing locations of mobile parcel lockers in last-mile distribution
- An exact algorithm for the service network design problem with hub capacity constraints
- Routing optimization with time windows under uncertainty
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- An iterative graph expansion approach for the scheduling and routing of airplanes
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions
- Enhanced mixed integer programming techniques and routing problems
- The windy rural postman problem with a time-dependent zigzag option
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Title not available (Why is that?)
Uses Software
This page was built for publication: A time bucket formulation for the traveling salesman problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815434)
