this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

This research presents a retail shelf-space decision model that incorporates a nonlinear profit function, vertical and horizontal location effects, and product cross-elasticity. We propose a linear programming formulation of the nonlinear profit function that can solve the shelf-space problem optimally. We describe potential advances in heuristic and meta-heuristic algorithms and compare the ap...

In this paper, two nature inspired meta heuristic approaches particle swarm optimization and firefly algorithm are discussed. Both the approaches are population based approaches and has wide applications in various problems. Various factors influencing its performance is compared on the basis of selection of size of population, number of iterations, quality of solution, convergence criterion an...

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other cl...

We propose a new distributed and parallel meta-heuristic framework to address the issues of scalability and robustness in the optimization problem. The proposed framework, named PADO (Parallel And Distributed Optimization framework), can utilize heterogeneous computing and communication resources to achieve scalable speedup while maintaining high solution quality. Specifically, we combine an ex...

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...

This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...