An exact and a simulated annealing algorithm for simultaneously determining flow path and the location of P/D stations in bidirectional path

Abstract

Abstract In this paper, we present two algorithms to design flow path and the location of its pickup and delivery (P/D) stations simultaneously in a block layout for Automated Guided Vehicles (AGVs). We develop two algorithms to solve this problem. The first one is a cutting-plane algorithm to solve the mixed integer linear program that models the problem. The second one is a Simulated Annealing (SA) approach which solves the problem heuristically to a near best solution. Computational results show the performance of both algorithms.