A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2815434
DOI10.1287/ijoc.1100.0432zbMath1462.90103OpenAlexW1998126277MaRDI QIDQ2815434
Andrea Lodi, Andrea Tramontani, Oktay Günlük, Sanjeeb Dash
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
Related Items
Layered graph approaches for combinatorial optimization problems, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, Pricing routines for vehicle routing with time windows on road networks, An integer programming approach for the time-dependent traveling salesman problem with time windows, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Routing optimization with time windows under uncertainty, Optimizing the changing locations of mobile parcel lockers in last-mile distribution, Mixed integer programming formulations for the generalized traveling salesman problem with time windows, An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, An exact algorithm for the service network design problem with hub capacity constraints, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, A Joint Vehicle Routing and Speed Optimization Problem, Enhanced mixed integer programming techniques and routing problems, The windy rural postman problem with a time-dependent zigzag option, Perspectives on integer programming for time-dependent models, Comments on: ``Perspectives on integer programming for time-dependent models, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, An iterative graph expansion approach for the scheduling and routing of airplanes, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enhanced mixed integer programming techniques and routing problems
- Introduction to ABACUS -- a branch-and-cut system
- The precedence-constrained asymmetric traveling salesman polytope
- Probabilistic diversification and intensification in local search for vehicle routing
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- A Hybrid Exact Algorithm for the TSPTW
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- 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
- State-space relaxation procedures for the computation of bounds to routing problems
- 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
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
