A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles

Jungyun Bae, Woo Jin Chung

Research output: Contribution to journalArticle

2 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 languageEnglish
Pages (from-to)1765-1771
Number of pages7
JournalInternational Journal of Precision Engineering and Manufacturing
Volume19
Issue number12
DOIs
Publication statusPublished - 2018 Dec 1

Fingerprint

Motion planning
Hamiltonians

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

Cite this

A Heuristic for Path Planning of Multiple Heterogeneous Automated Guided Vehicles. / Bae, Jungyun; Chung, Woo Jin.

In: International Journal of Precision Engineering and Manufacturing, Vol. 19, No. 12, 01.12.2018, p. 1765-1771.

Research output: Contribution to journalArticle

@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 Chung, {Woo Jin}",
year = "2018",
month = "12",
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, Woo Jin

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

VL - 19

SP - 1765

EP - 1771

JO - International Journal of Precision Engineering and Manufacturing

JF - International Journal of Precision Engineering and Manufacturing

SN - 1229-8557

IS - 12

ER -