Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem

DOI10.1007/s11590-020-01551-wzbMath1459.90178OpenAlexW3007930322MaRDI QIDQ2228400

Ines Mathlouthi, Malek Masmoudi, Sana Frifita, Abdelaziz Dammak

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01551-w

zbMATH Keywords

inventorymultiple time windowsadaptive memoryGVNSR-\(k\)-TRP

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem

Cites Work

• Unnamed Item
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Variable neighbourhood search: Methods and applications
• The fleet size and mix vehicle routing problem
• Variable neighborhood search
• General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
• Probabilistic diversification and intensification in local search for vehicle routing
• A variable neighborhood search for solving the multi-vehicle covering tour problem
• A note on the traveling repairman problem
• The k -traveling repairmen problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Vehicle Routing Problem with Time Windows
• Mixed integer linear programming for a multi-attribute technician routing and scheduling problem
• VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties