in this study, an optimization model is proposed to design a global supply chain (gsc) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of economic cooperation organization trade agreement (ecota) is...

Automatic guided vehicles have become an important part of transporting goods in dynamic environments, and how to design efficient path planning method for multiple AGVs is a current research hotspot. Due the complex road conditions there may be obstacles situations which only target point known but complete map lacking, leads poor long time automatic (AGVs). In this paper, two-level (referred ...

Population based metaheuristics, such as hybrid genetic algorithms or memetic algorithms, play an important role in the solution of combinatorial optimization problems. The memetic algorithm presented here for the no-wait flowshop scheduling problem addresses a hierarchically organized complete ternary tree to represent the population that putted together with a recombination plan resembles a p...

Assigning cells to switches in cellular mobile networks is an NP-hard problem which, for realsize mobile networks, could not be solved by using exact methods. In this context, heuristic approaches like genetic algorithms, tabu search and simulated annealing can be used. This paper proposes a comparative study of three heuristics—tabu search, simulated annealing and Parallel Genetic Algorithms w...

A hierarchical memetic algorithm (MA) is proposed for the path planning and formation control of swarm robots. The proposed algorithm consists of a global path planner (GPP) and a local motion planner (LMP). The GPP plans a trajectory within the Voronoi diagram (VD) of the free space. An MA with a non‐random initial population plans a series of configu...

Constructing examination timetable for higher educational institutions is a very complex work due to the complexity of timetabling problems. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this paper, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literat...

Abstract The article discusses the utilitarian problem of mobile collection waste electrical and electronic equipment. Due to its $$\mathcal {NP}$$ NP -hard nature, implies application approximate methods discover suboptimal solutions in an acceptable time. paper presents proposal a novel method designing Evo...

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, dou...

Abstract Application of memetic algorithm (MA) is considered in this work to solve the truck and trailer routing problem (TTRP). In TTRP, some customers can be designated as vehicle customers and can be serviced either by a complete vehicle (a trailer pulling by truck) or a single truck. However, some customers are known as truck customers and have to be serviced by a single truck. To employ t...