Beam-ACO for the travelling salesman problem with time windows

DOI10.1016/j.cor.2009.11.015zbMath1190.90165OpenAlexW2086918511MaRDI QIDQ2270441

Christian Blum, Manuel López-Ibáñez

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

zbMATH Keywords

ant colony optimizationhybridizationtravelling salesman problem with time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Scheduled penalty variable neighborhood search ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ The hybrid electric vehicle-traveling salesman problem with time windows ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ 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 variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows ⋮ An efficient GVNS for solving Traveling Salesman Problem with Time Windows ⋮ 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 ⋮ Improving the filtering of branch-and-bound MDD solver

Uses Software

• TSPTW
• Beam-ACO

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• A New Heuristic 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
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Beam-ACO for Simple Assembly Line Balancing
• 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
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Beam-ACO for the travelling salesman problem with time windows