Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
From MaRDI portal
Publication:5943078
DOI10.1007/s101070100218zbMath1039.90056MaRDI QIDQ5943078
Martin Grötschel, Matteo Fischetti, Norbert Ascheuer
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
heuristicstime windowsasymmetric traveling salesman problembranch and cut algorithmcontrol of stacker cranesinteger programs
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
TSP race: minimizing completion time in time-sensitive applications, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, A branch-and-cut framework for the consistent traveling salesman problem, The hybrid electric vehicle-traveling salesman problem, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, 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, A branch-and-cut algorithm for the time window assignment vehicle routing problem, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, A biased random key genetic algorithm for the field Technician scheduling problem, The hybrid electric vehicle-traveling salesman problem with time windows, Exact algorithms for the multi-pickup and delivery problem with time windows, Selective routing problem with synchronization, A branch-and-cut algorithm for the Steiner tree problem with delays, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Routing optimization with time windows under uncertainty, Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem, Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, 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, The vehicle routing problem with release dates and flexible time windows, Solving the single crane scheduling problem at rail transshipment yards, Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, The delivery man problem with time windows, Reachability cuts for the vehicle routing problem with time windows, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions, Heuristic and exact algorithms for the multi-pile vehicle routing problem, A Joint Vehicle Routing and Speed Optimization Problem, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities, A variable iterated greedy algorithm for the traveling salesman problem with time windows, Formulations and exact algorithms for the vehicle routing problem with time windows, Solving a school bus scheduling problem with integer programming, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, 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, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, A LP-based heuristic for a time-constrained routing problem, Beam-ACO for the travelling salesman problem with time windows, Lagrangian duality applied to the vehicle routing problem with time windows, Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, An optimal data-splitting algorithm for aircraft sequencing on a single runway, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, The distributed Kolkata paise restaurant game, Robust vehicle routing under uncertainty via branch-price-and-cut, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, Compact formulations of the Steiner traveling salesman problem and related problems, A cutting plane method for solving harvest scheduling models with area restrictions, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Uses Software
