Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

Metaheuristics are renowned to present very efficient elucidation to many of today's combinatorial optimization problems in engineering, industrial, economical and scientific domains such as transportation, bioinformatics, logistics, business etc. Scheduling, timetabling, vehicle routing, resource allocation are intelligently and successfully tackled with Metaheuristic approaches such as Simula...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

This paper introduces a new hybrid algorithmic nature inspired approach based on particle swarm optimization, for solving successfully one of the most popular logistics management problems, the location routing problem (LRP). The proposed algorithm for the solution of the location routing problem, the hybrid particle swarm optimization (HybPSO-LRP), combines a particle swarm optimization (PSO) ...

This paper presents branch-and-bound parallelization strategies applied to the location/ allocation problem with balancing requirements. This formulation is representative of a larger class of discrete network design and location problems arising in many transportation logistics and telecommunications applications: it displays a multicommodity network ̄ow structure and a complex objective funct...

Abstract: Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper, we address the single allocation maximal covering hub location problem in which the objective is to maximise the amount of covered flows associated with origin-destination pairs in a hub-and-spoke network using a fixed number of hub facilities. Two ...

In this paper we consider a generalized class of location-allocation problems, in which N new facilities are to be located in the plane with respect to M objects. We assume each object to be associated with a non-negative convex cost function, specifying the expenses for serving the object from any location in the plane. For the resulting multi-dimensional mixed-integer optimization problem two...

Transportation and logistics are fertile areas for modeling. Simulation has traditionally been used in warehousing and inside the distribution center or processing hub in the trucking and package delivery sectors, for baggage systems and passenger queueing in the airline industry, and for detailed models of terminals and yards in the railroad industry. In addition, simulators are used for certa...