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

Hamzadayı, Alper; Topaloğlu, Şeyda; Köse, Simge Yelkenci

doi:10.1016/j.cor.2013.06.004

Cited by 10 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Doerner et al [14] have described a similar model for the twoday blood delivery service of the Austrian red cross. Hamzadayi, Topaloglu, and Kose [20] considered m-period TSP as a model for delivery goods by a soft drinks company in Turkey.…”

Section: Definitions and Related Workmentioning

confidence: 99%

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

Deı̆neko¹,

Klinz²,

Wang³

2022

Preprint

View full text Add to dashboard Cite

We consider the N P-hard 2-period balanced travelling salesman problem. In this problem the salesman needs to visit a set of customers in two time periods. A given subset of the customers has to be visited in both periods while the rest of the customers need to be visited only once, in any of the two periods. Moreover, it is required that the number of customers visited in the first period does not differ from the respective number in the second period by more than p, where p is a given small constant. The objective is to find tours for visiting the customers in the two periods with minimal total length. We show that in the case when the underlying distance matrix is a Kalmanson matrix, the problem can be solved in polynomial time. For the general case, we propose two new heuristics. A combination of these two heuristics has shown very favourable results in computational experiments on benchmark instances from the literature.

show abstract

Section: Definitions and Related Workmentioning

confidence: 99%

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

Deı̆neko¹,

Klinz²,

Wang³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The SA algorithm [ 23 , 25 ] is an iterative improvement process inspired from simulating the annealing process and has frequently been used to solve a variety of combinatorial optimization problems, for example, periodic routing problem of a retail distribution system [ 26 ] and dynamic facility layout problem [ 27 ], among others. The basic idea of the SA is to simulate the annealing process of metal crystals to iteratively refine the solution quality and search for nearly optimal solutions.…”

Section: Our Sa Approach To the Rsc Problemmentioning

confidence: 99%

A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

Lin

Liu

Chou³

et al. 2014

The Scientific World Journal

View full text Add to dashboard Cite

This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems.

show abstract

“…A control parameter is set to an initial 'temperature' value and is systematically decreased according to a cooling schedule (see Hamzadayi et al, 2013 for more details). Before starting the SA algorithm, it is necessary to choose starting values for the parameters, the cooling schedule and the stopping conditions (see Eglese (1990);Ingber (1993) and Alavi and Gandomi, (2011) for more details).…”

Section: Simulated Annealingmentioning

confidence: 99%

Application of artificial neural network coupled with genetic algorithm and simulated annealing to solve groundwater inflow problem to an advancing open pit mine

Bahrami

Ardejani

Baafi

2016

Journal of Hydrology

View full text Add to dashboard Cite

(2016). Application of artificial neural network coupled with genetic algorithm and simulated annealing to solve groundwater inflow problem to an advancing open pit mine. Journal of Hydrology, Application of artificial neural network coupled with genetic algorithm and simulated annealing to solve groundwater inflow problem to an advancing open pit mine AbstractIn this study, hybrid models are designed to predict groundwater inflow to an advancing open pit mine and the hydraulic head (HH) in observation wells at different distances from the centre of the pit during its advance. Hybrid methods coupling artificial neural network (ANN) with genetic algorithm (GA) methods (ANN-GA), and simulated annealing (SA) methods (ANN-SA), were utilised. Ratios of depth of pit penetration in aquifer to aquifer thickness, pit bottom radius to its top radius, inverse of pit advance time and the HH in the observation wells to the distance of observation wells from the centre of the pit were used as inputs to the networks. To achieve the objective two hybrid models consisting of ANN-GA and ANN-SA with 4-5-3-1 arrangement were designed. In addition, by switching the last argument of the input layer with the argument of the output layer of two earlier models, two new models were developed to predict the HH in the observation wells for the period of the mining process. The accuracy and reliability of models are verified by field data, results of a numerical finite element model using SEEP/W, outputs of simple ANNs and some well-known analytical solutions. Predicted results obtained by the hybrid methods are closer to the field data compared to the outputs of analytical and simple ANN models. Results show that despite the use of fewer and simpler parameters by the hybrid models, the ANN-GA and to some extent the ANN-SA have the ability to compete with the numerical models. AbstractIn this study, hybrid models are designed to predict groundwater inflow to an advancing open pit mine and the hydraulic head (HH) in observation wells at different distances from the centre of the pit during its advance. Hybrid methods coupling artificial neural network (ANN) with genetic algorithm (GA) methods (ANN-GA), and simulated annealing (SA) methods (ANN-SA), were utilised. Ratios of depth of pit penetration in aquifer to aquifer thickness, pit bottom radius to its top radius, inverse of pit advance time and the HH in the observation wells to the distance of observation wells from the centre of the pit were used as inputs to the networks. To achieve the objective two hybrid models consisting of ANN-GA and ANN-SA with 4-5-3-1 arrangement were designed. In addition, by switching the last argument of the input layer with the argument of the output layer of two earlier models, two new models were developed to predict the HH in the observation wells for the period of the mining process. The accuracy and reliability of models are verified by field data, results of a numerical finite element model using SEEP/W, outputs of simple ANNs and some well-known ana...

show abstract

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

Cited by 10 publications

References 27 publications

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

Application of artificial neural network coupled with genetic algorithm and simulated annealing to solve groundwater inflow problem to an advancing open pit mine

Contact Info

Product

Resources

About