Scheduling periodic customer visits for a traveling salesperson

DOI10.1016/j.ejor.2005.03.056zbMath1163.90506OpenAlexW2038139668WikidataQ59389753 ScholiaQ59389753MaRDI QIDQ863999

Michael Polacek, Marc Reimann, Guenter Kiechle, Richard F. Hartl, Karl F. Doerner

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.056

zbMATH Keywords

variable neighborhood searchperiodictraveling salesperson problemreal world problem

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (9)

A variable neighborhood search heuristic for periodic routing problems ⋮ Nested simulated annealing approach to periodic routing problem of a retail distribution system ⋮ A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ Variable neighbourhood search: methods and applications ⋮ Heuristics for the multi-period orienteering problem with multiple time windows ⋮ Forty years of periodic vehicle routing ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• VRP

Cites Work

• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Variable neighborhood search
• The period traveling salesman problem: A new heuristic algorithm
• A period vehicle routing case study
• The traveling salesman problem and its variations
• An improved heuristic for the period traveling salesman problem
• A new heuristic for the period traveling salesman problem
• The Vehicle Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• An asynchronous parallel metaheuristic for the period vehicle routing problem
• A unified tabu search heuristic for vehicle routing problems with time windows
• Variable neighborhood search: Principles and applications

This page was built for publication: Scheduling periodic customer visits for a traveling salesperson