Ant colony system for a VRP with multiple time windows and multiple visits

DOI10.1080/09720502.2007.10700491zbMath1143.90005OpenAlexW1980001618MaRDI QIDQ3511482

Daniela Favaretto, Paola Pellegrini, Elena Moretti

Publication date: 11 July 2008

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

vehicle routing problemlogisticsant colony systemmultiple time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Tuning positive feedback for signal detection in noisy dynamic environments ⋮ A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations ⋮ Variable neighborhood search for vehicle routing problem with multiple time windows ⋮ A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints

Cites Work

• Unnamed Item
• Unnamed Item
• An improved ant system algorithm for the vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An ant colony system approach for variants of the traveling salesman problem with time windows
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

This page was built for publication: Ant colony system for a VRP with multiple time windows and multiple visits