A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles

Tatsushi Nishi, Yuichiro Hiranaka, Ignacio E. Grossmann

Research output: Contribution to journalArticlepeer-review

61 Citations (Scopus)

Abstract

We address a bilevel decomposition algorithm for solving the simultaneous scheduling and conflict-free routing problems for automated guided vehicles. The overall objective is to minimize the total weighted tardiness of the set of jobs related to these tasks. A mixed integer formulation is decomposed into two levels: the upper level master problem of task assignment and scheduling; and the lower level routing subproblem. The master problem is solved by using Lagrangian relaxation and a lower bound is obtained. Either the solution turns out to be feasible for the lower level or a feasible solution for the problem is constructed, and an upper bound is obtained. If the convergence is not satisfied, cuts are generated to exclude previous feasible solutions before solving the master problem again. Two types of cuts are proposed to reduce the duality gap. The effectiveness of the proposed method is investigated from computational experiments.

Original languageEnglish
Pages (from-to)876-888
Number of pages13
JournalComputers and Operations Research
Volume38
Issue number5
DOIs
Publication statusPublished - May 2011
Externally publishedYes

Keywords

  • Automated guided vehicle
  • Bilevel decomposition
  • Lagrangian relaxation
  • Routing
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles'. Together they form a unique fingerprint.

Cite this