A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles

Jungyun Bae; Woojin Chung

doi:10.1007/s12541-018-0205-x

A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles

Jungyun Bae, Woojin Chung

School of Mechanical Engineering

Research output: Contribution to journal › Article › peer-review

15 Citations (Scopus)

Abstract

This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.

Original language	English
Pages (from-to)	1765-1771
Number of pages	7
Journal	International Journal of Precision Engineering and Manufacturing
Volume	19
Issue number	12
DOIs	https://doi.org/10.1007/s12541-018-0205-x
Publication status	Published - 2018 Dec 1

Keywords

AGV dispatching
AGV routing
Heterogeneous vehicle routing problem
Primal-dual heuristic

ASJC Scopus subject areas

Mechanical Engineering
Industrial and Manufacturing Engineering
Electrical and Electronic Engineering

Access to Document

10.1007/s12541-018-0205-x

Cite this

@article{33f025627ba24d5f89ef2b7d8ce7d3ba,

title = "A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles",

abstract = "This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.",

keywords = "AGV dispatching, AGV routing, Heterogeneous vehicle routing problem, Primal-dual heuristic",

author = "Jungyun Bae and Woojin Chung",

note = "Funding Information: This research was supported by the NRF, MSIP (NRF-2017R1A2A1 A17069329), also supported by the Agriculture, Food and Rural Affairs Research Center Support Program (714002-07), MAFRA, Korea and a Korea University Grant.",

year = "2018",

month = dec,

day = "1",

doi = "10.1007/s12541-018-0205-x",

language = "English",

volume = "19",

pages = "1765--1771",

journal = "International Journal of Precision Engineering and Manufacturing",

issn = "1229-8557",

publisher = "Korean Society of Precision Engineering",

number = "12",

}

TY - JOUR

T1 - A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles

AU - Bae, Jungyun

AU - Chung, Woojin

N1 - Funding Information: This research was supported by the NRF, MSIP (NRF-2017R1A2A1 A17069329), also supported by the Agriculture, Food and Rural Affairs Research Center Support Program (714002-07), MAFRA, Korea and a Korea University Grant.

PY - 2018/12/1

Y1 - 2018/12/1

N2 - This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.

AB - This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.

KW - AGV dispatching

KW - AGV routing

KW - Heterogeneous vehicle routing problem

KW - Primal-dual heuristic

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

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

U2 - 10.1007/s12541-018-0205-x

DO - 10.1007/s12541-018-0205-x

M3 - Article

AN - SCOPUS:85057329139

SN - 1229-8557

VL - 19

SP - 1765

EP - 1771

JO - International Journal of Precision Engineering and Manufacturing

JF - International Journal of Precision Engineering and Manufacturing

IS - 12

ER -

A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this