A hybrid exact algorithm for the TSPTW
From MaRDI portal
Publication:2884545
Recommendations
- A hybrid algorithm for TSP
- A new hybrid algorithm for solving large scale TSP
- scientific article; zbMATH DE number 1703862
- Accurate solving hybrid algorithm for small scale TSP
- scientific article; zbMATH DE number 2079469
- A hybrid exact algorithm for complete set partitioning
- A new hybrid stochastic approximation algorithm
- A quasi-polynomial algorithm for well-spaced hyperbolic TSP
- scientific article; zbMATH DE number 7529154
Cited in
(35)- A learning based algorithm for drone routing
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
- A stochastic dynamic traveling salesman problem with hard time windows
- Perspectives on integer programming for time-dependent models
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- 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
- Semidefinite programming and constraint programming
- Bounding, filtering and diversification in CP-based local branching
- Beam-ACO for the travelling salesman problem with time windows
- An efficient algorithm for computing the approximate t-URV and its applications
- A matheuristic for the generalized order acceptance and scheduling problem
- A theoretical framework for the TTA algorithm
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- Constraint programming and operations research
- A general VNS heuristic for the traveling salesman problem with time windows
- The delivery man problem with time windows
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- CP-Based Local Branching
- Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Improved filtering for weighted circuit constraints
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- scientific article; zbMATH DE number 2219205 (Why is no real title available?)
- Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Exact and heuristic algorithms for routing AGV on path with precedence constraints
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
This page was built for publication: A hybrid exact algorithm for the TSPTW
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884545)
