Simulated annealing algorithm for balanced allocation problem

Rajesh, R.; Pugazhendhi, S.; Ganesh, K.

doi:10.1007/s00170-011-3725-4

Cited by 6 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the inequality metric, Rajesh et al. (2012) used SA to solve the same allocation problem of Zhao et al. (2011), which is described in the previous paragraph.…”

Section: Related Workmentioning

confidence: 99%

“…Results showed that SA notably outperformed the interchange heuristic for all considered problems. For the inequality metric, Rajesh et al (2012) used SA to solve the same allocation problem of Zhao et al (2011), which is described in the previous paragraph. The authors further compared allocations resulting from their SA-based technique to those resulting from the GA-based approach of the latter article.…”

Section: Single-objective Ga-and Sa-based Allocation Of Facilitiesmentioning

confidence: 99%

See 1 more Smart Citation

Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities

Morgan

Khayyat

2021

Int Trans Operational Res

View full text Add to dashboard Cite

The proper allocation of facilities within Islamic holy places is barely studied. These places annually witness millions of pilgrims and guests. The number of people during pilgrimage has been growing recently and is expected to grow further in the future. Different facilities should be optimally allocated to properly serve this large number of people and efficiently respond to their requests. In this paper, we target the problem of optimally allocating facilities within the largest Islamic holy place, Arafat. We evaluate the current allocation with respect to distance, coverage, and cover inequality metrics. Average‐case and worst‐case values of the three metrics are considered for evaluation. Results show that the current allocation strategy is far from being optimal. For the three considered metrics, we use crowdedness‐based techniques to allocate facilities within the area of Arafat. Optimal allocations are first obtained by solving integer programming (IP) models. Thereafter, two widely used metaheuristics, genetic algorithms (GA) and simulated annealing, are experimented and evaluated. Results show that the optimal solution could be easily obtained for coverage and cover inequality metrics. For the distance metric, the computation time of the IP technique is large and GA appears as a good candidate to balance between computation time and solution quality. Finally, we study allocating facilities from a multiobjective perspective. Both scalar‐weighted formulation and nondominated sorting genetic algorithm II techniques are considered. Results show that the latter technique outperforms the former technique in the number of generated Pareto‐optimal allocations as well as the quality of these allocations.

show abstract

“…For the inequality metric, Rajesh et al. (2012) used SA to solve the same allocation problem of Zhao et al. (2011), which is described in the previous paragraph.…”

Section: Related Workmentioning

confidence: 99%

Section: Single-objective Ga-and Sa-based Allocation Of Facilitiesmentioning

confidence: 99%

Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities

Morgan

Khayyat

2021

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Reference [33] presented a memetic algorithm for a multistage supply chain problem. Reference [34] proposes a simulated annealing algorithm for an allocation problem. Reference [35] presents a hybrid approach using an artificial bee algorithm (BA) with mixed integer programming (MIP) applied to a large-scale CFLP; BA is applied for the purpose of solving the location problem, and the MIP is applied for the purpose of finding the optimal mathematical problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Variations in the Flow Approach to CFCLP‐TC for Multiobjective Supply Chain Design

Hertwin

Olivares-Benítez

Tapia‐Olvera

et al. 2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We review the problem for the design of supply chains called Capacitated Fixed Cost Facility Location Problem with Transportation Choices (CFCLP-TC). The problem is based on a production network of two echelons with multiple plants, a set of potential distribution centers, and customers. The problem is formulated as an optimization model with two objective functions based on time and cost. This paper proposes three changes to the original model to compare the sets of efficient solutions and the computational time required to obtain them. The main contribution of this paper is to extend the existing literature by incorporating approaches for the supply of product to customers through multiple sources, the direct flow between plants and customers, without this necessarily implying removing the distribution centers, and the product flow between distribution centers. From these approaches, we generate mathematical programming models and propose to solve through the epsilon-constraint approach for generating Pareto fronts and thus compare each of these approaches with the original model. The models are implemented in GAMS and solved with CPLEX.

show abstract

QoS and energy consumption aware service composition and optimal-selection based on Pareto group leader algorithm in cloud manufacturing system

Feng

et al. 2013

Cent Eur J Oper Res

View full text Add to dashboard Cite

Simulated annealing algorithm for balanced allocation problem

Cited by 6 publications

References 23 publications

Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities

Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities

Variations in the Flow Approach to CFCLP‐TC for Multiobjective Supply Chain Design

QoS and energy consumption aware service composition and optimal-selection based on Pareto group leader algorithm in cloud manufacturing system

Contact Info

Product

Resources

About