Nested simulated annealing approach to periodic routing problem of a retail distribution system

DOI10.1016/j.cor.2013.06.004zbMath1348.90095OpenAlexW2068764348MaRDI QIDQ336657

Seyda Topaloglu, Alper Hamzadayi, Simge Yelkenci Kose

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.004

zbMATH Keywords

integer programmingsimulated annealingperiodic traveling salesmanretail logisticsvisiting frequency

Mathematics Subject Classification ID

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

Related Items

A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ A matheuristic solution approach for the production routing problem with visit spacing policy

Uses Software

• Matlab
• VRP

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
• Scheduling periodic customer visits for a traveling salesperson
• A classification scheme for vehicle routing and scheduling problems
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• Nested annealing: A provable improvement to simulated annealing
• A multiperiod traveling salesman problem: Heuristic algorithms
• On simulated annealing and nested annealing.
• The period traveling salesman problem: A new heuristic algorithm
• An improved heuristic for the period traveling salesman problem
• A new heuristic for the period traveling salesman problem
• A variable neighborhood search heuristic for periodic routing problems
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
• Multi-objective vehicle routing problems
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The period routing problem
• The Period Vehicle Routing Problem and its Extensions
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• A nested simulated annealing algorithm
• A tabu search heuristic for periodic and multi-depot vehicle routing problems