Beam-ACO for the travelling salesman problem with time windows
From MaRDI portal
Publication:2270441
Recommendations
- scientific article; zbMATH DE number 1390344
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An ant colony system approach for variants of the traveling salesman problem with time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- A time bucket formulation for the traveling salesman problem with time windows
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- A beam search approach to the traveling tournament problem
- An efficient GVNS for solving traveling salesman problem with time windows
Cites work
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A hybrid exact algorithm for the TSPTW
- A new heuristic for the traveling salesman problem with time windows.
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Ant colony optimization.
- Beam-ACO for simple assembly line balancing
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Optimization by simulated annealing
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- State-space relaxation procedures for the computation of bounds to routing problems
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
Cited in
(16)- 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
- New state-space relaxations for solving the traveling salesman problem with time windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- A modified ant colony system for solving the travelling salesman problem with time windows
- Environmental and social implications of incorporating carpooling service on a customized bus system
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Scheduled penalty variable neighborhood search
- An improved ant colony algorithm and its application in vehicle routing problem
- Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Improving the filtering of branch-and-bound MDD solver
- 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
- An efficient GVNS for solving traveling salesman problem with time windows
- The hybrid electric vehicle-traveling salesman problem with time windows
This page was built for publication: Beam-ACO for the travelling salesman problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270441)
