Beam-ACO for the travelling salesman problem with time windows
From MaRDI portal
Publication:2270441
DOI10.1016/J.COR.2009.11.015zbMATH Open1190.90165OpenAlexW2086918511MaRDI QIDQ2270441FDOQ2270441
Authors: Manuel López-Ibáñez, Christian Blum 
Publication date: 18 March 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/88010
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Beam-ACO for simple assembly line balancing
- Optimization by simulated annealing
- Ant colony optimization.
- 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
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- 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
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Title not available (Why is that?)
- A new heuristic for the traveling salesman problem with time windows.
- A hybrid exact algorithm for the TSPTW
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
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
- Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
- An improved ant colony algorithm and its application in vehicle routing 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
Uses Software
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)
