An ant colony system approach for variants of the traveling salesman problem with time windows

DOI10.1080/02522667.2006.10699677zbMath1179.90281OpenAlexW2101084944MaRDI QIDQ3429053

Daniela Favaretto, Paola Pelligrini, Elena Moretti

Publication date: 30 March 2007

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10278/30111

zbMATH Keywords

ant colony systemtemporal-TSPTW

Mathematics Subject Classification ID

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

Related Items (5)

A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Ant colony system for a VRP with multiple time windows and multiple visits ⋮ Path planning on a cuboid using genetic algorithms ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version

Uses Software

• TSPTW

Cites Work

• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Embedding relaxations in global constraints for solving TSP and TSPTW
• An improved ant system algorithm for the vehicle routing problem
• 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
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

This page was built for publication: An ant colony system approach for variants of the traveling salesman problem with time windows