A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

author

  • Parinaz Pourrahimian
Abstract:

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Algorithm (MA) for optimizing partitioning problem of tandem AGVS. MAs employ a Genetic Algorithm (GA), as a global search, and apply a local search to bring the solutions to a local optimum point. A new Tabu Search (TS) has been developed and combined with a GA to refine the newly generated individuals by GA. The aim of the proposed algorithm is to minimize the maximum workload of the system. After all, the performance of the proposed algorithm is evaluated using Matlab. This study also compared the objective function of the proposed MA with GA. The results showed that the TS, as a local search, significantly improves the objective function of the GA for different system sizes with large and small numbers of zone by 1.26 in average.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Threshold Accepting Algorithm for Partitioning Machines in a Tandem Automated Guided Vehicle

Abstract : A tandem automated guided vehicle (AGV) system deals with grouping workstations into some non-overlapping zones , and assigning exactly one AGV to each zone. This paper presents a new non-linear integer mathematical model to group n machines into N loops that minimizes both inter and intra-loop flows simultaneously. Due to computational difficulties of exact methods in solving our pr...

full text

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

full text

A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking

In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...

full text

A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem

The minimum conductance problem is an NP-hard graph partitioning problem. Apart from the search for bottlenecks in complex networks, the problem is very closely related to the popular area of network community detection. In this paper, we tackle the minimum conductance problem as a pseudo-Boolean optimisation problem and propose a memetic algorithm to solve it. An efficient local search strateg...

full text

Tandem Configuration Automated Guided Vehicle Systems: A Compa

and Reference List Automated guided vehicle systems (AGVs) provide the flexibility and integration required for flexible manufacturing systems. Previous AGVS studies have attempted to reduce the controlling complexities commonly encountered in these systems. However, this has not been accomplished without additional resources (e.g., automated guided vehicles) and lower system flexibility. The p...

full text

Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem

The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Paralle...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 14  issue 4

pages  -

publication date 2018-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023