Finding optimal dwell points for automated guided vehicles in general guide-path layouts

Jose Antonio Ventura, Subramanian Pazhani, Abraham Mendoza

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The dwell points for idle vehicles in an automated guided vehicle (AGV) system determine the response times for pick-up requests and thus affect the performance of automated manufacturing systems. In this paper, we address the problem of optimally locating dwell points for a given number of AGVs in a general guide-path layout. Based on an optimality property, we propose new mixed integer linear programming (MILP) formulations for three versions of the problem: (i) minimizing the mean response time in the system, (ii) minimizing the maximum response time in the system, and (iii) minimizing the maximum response time in the system considering time restrictions on vehicle availability. Given that the computational time required to solve the MILP models significantly increases with the size of the guide-path network and number of available AGVs, we also develop a generic genetic algorithm (GA) that can be applied to all three versions of the problem. A computational study is carried out on the single-loop layout and two special cases of two-dimensional grid networks with the objectives of minimizing mean response time and minimizing the maximum response time. The results show that the proposed GA procedure can yield optimal or near optimal solutions in reasonable time.

Original languageEnglish (US)
Pages (from-to)850-861
Number of pages12
JournalInternational Journal of Production Economics
Volume170
DOIs
StatePublished - Dec 1 2015

Fingerprint

Linear programming
Genetic algorithms
Availability
Response time
Automated guided vehicles
Layout
Mixed integer linear programming
Genetic algorithm

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{069a492b61cb44fc9a73ba01e876acf0,
title = "Finding optimal dwell points for automated guided vehicles in general guide-path layouts",
abstract = "The dwell points for idle vehicles in an automated guided vehicle (AGV) system determine the response times for pick-up requests and thus affect the performance of automated manufacturing systems. In this paper, we address the problem of optimally locating dwell points for a given number of AGVs in a general guide-path layout. Based on an optimality property, we propose new mixed integer linear programming (MILP) formulations for three versions of the problem: (i) minimizing the mean response time in the system, (ii) minimizing the maximum response time in the system, and (iii) minimizing the maximum response time in the system considering time restrictions on vehicle availability. Given that the computational time required to solve the MILP models significantly increases with the size of the guide-path network and number of available AGVs, we also develop a generic genetic algorithm (GA) that can be applied to all three versions of the problem. A computational study is carried out on the single-loop layout and two special cases of two-dimensional grid networks with the objectives of minimizing mean response time and minimizing the maximum response time. The results show that the proposed GA procedure can yield optimal or near optimal solutions in reasonable time.",
author = "Ventura, {Jose Antonio} and Subramanian Pazhani and Abraham Mendoza",
year = "2015",
month = "12",
day = "1",
doi = "10.1016/j.ijpe.2015.03.007",
language = "English (US)",
volume = "170",
pages = "850--861",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",

}

Finding optimal dwell points for automated guided vehicles in general guide-path layouts. / Ventura, Jose Antonio; Pazhani, Subramanian; Mendoza, Abraham.

In: International Journal of Production Economics, Vol. 170, 01.12.2015, p. 850-861.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Finding optimal dwell points for automated guided vehicles in general guide-path layouts

AU - Ventura, Jose Antonio

AU - Pazhani, Subramanian

AU - Mendoza, Abraham

PY - 2015/12/1

Y1 - 2015/12/1

N2 - The dwell points for idle vehicles in an automated guided vehicle (AGV) system determine the response times for pick-up requests and thus affect the performance of automated manufacturing systems. In this paper, we address the problem of optimally locating dwell points for a given number of AGVs in a general guide-path layout. Based on an optimality property, we propose new mixed integer linear programming (MILP) formulations for three versions of the problem: (i) minimizing the mean response time in the system, (ii) minimizing the maximum response time in the system, and (iii) minimizing the maximum response time in the system considering time restrictions on vehicle availability. Given that the computational time required to solve the MILP models significantly increases with the size of the guide-path network and number of available AGVs, we also develop a generic genetic algorithm (GA) that can be applied to all three versions of the problem. A computational study is carried out on the single-loop layout and two special cases of two-dimensional grid networks with the objectives of minimizing mean response time and minimizing the maximum response time. The results show that the proposed GA procedure can yield optimal or near optimal solutions in reasonable time.

AB - The dwell points for idle vehicles in an automated guided vehicle (AGV) system determine the response times for pick-up requests and thus affect the performance of automated manufacturing systems. In this paper, we address the problem of optimally locating dwell points for a given number of AGVs in a general guide-path layout. Based on an optimality property, we propose new mixed integer linear programming (MILP) formulations for three versions of the problem: (i) minimizing the mean response time in the system, (ii) minimizing the maximum response time in the system, and (iii) minimizing the maximum response time in the system considering time restrictions on vehicle availability. Given that the computational time required to solve the MILP models significantly increases with the size of the guide-path network and number of available AGVs, we also develop a generic genetic algorithm (GA) that can be applied to all three versions of the problem. A computational study is carried out on the single-loop layout and two special cases of two-dimensional grid networks with the objectives of minimizing mean response time and minimizing the maximum response time. The results show that the proposed GA procedure can yield optimal or near optimal solutions in reasonable time.

UR - http://www.scopus.com/inward/record.url?scp=84928171623&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84928171623&partnerID=8YFLogxK

U2 - 10.1016/j.ijpe.2015.03.007

DO - 10.1016/j.ijpe.2015.03.007

M3 - Article

AN - SCOPUS:84928171623

VL - 170

SP - 850

EP - 861

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

ER -