A layered network formulation for the safe walking route design problem

Kenichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper proposes a mathematical optimization model for designing safe walking routes for children from school to homes. We focus on the existing bi-objective model, the safe walking route design problem, which minimizes both the total walking risk and the total route distances for all children from school to home. The original problem assumes that the combined routes for all children forms a directed out-tree rooted at the school. However, making this assumption excludes solutions such as those involving cycles. This paper explores how to relax the assumption that the graph is an out-tree by using a layered network constructed from the original network. Using the layered network formulation, we obtain some solutions that have better objective values than those obtained by the original formulation when we strongly emphasize reducing the risk objective. The results also show that the new formulation produces the same out-tree solution when minimization of the risk objective and the distance objective are suitably balanced.

Original languageEnglish
JournalJournal of Advanced Mechanical Design, Systems and Manufacturing
Volume12
Issue number3
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Trees (mathematics)

Keywords

  • Child road safety
  • Integer programming
  • Layered network
  • Network design
  • Safe walking route design problem

ASJC Scopus subject areas

  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Cite this

A layered network formulation for the safe walking route design problem. / Tanaka, Kenichi; Miyashiro, Ryuhei; Miyamoto, Yuichiro.

In: Journal of Advanced Mechanical Design, Systems and Manufacturing, Vol. 12, No. 3, 01.01.2018.

Research output: Contribution to journalArticle

@article{a9b1d5e4318345058c7be150d20d0621,
title = "A layered network formulation for the safe walking route design problem",
abstract = "This paper proposes a mathematical optimization model for designing safe walking routes for children from school to homes. We focus on the existing bi-objective model, the safe walking route design problem, which minimizes both the total walking risk and the total route distances for all children from school to home. The original problem assumes that the combined routes for all children forms a directed out-tree rooted at the school. However, making this assumption excludes solutions such as those involving cycles. This paper explores how to relax the assumption that the graph is an out-tree by using a layered network constructed from the original network. Using the layered network formulation, we obtain some solutions that have better objective values than those obtained by the original formulation when we strongly emphasize reducing the risk objective. The results also show that the new formulation produces the same out-tree solution when minimization of the risk objective and the distance objective are suitably balanced.",
keywords = "Child road safety, Integer programming, Layered network, Network design, Safe walking route design problem",
author = "Kenichi Tanaka and Ryuhei Miyashiro and Yuichiro Miyamoto",
year = "2018",
month = "1",
day = "1",
doi = "10.1299/jamdsm.2018jamdsm0065",
language = "English",
volume = "12",
journal = "Journal of Advanced Mechanical Design, Systems and Manufacturing",
issn = "1881-3054",
publisher = "Japan Society of Mechanical Engineers",
number = "3",

}

TY - JOUR

T1 - A layered network formulation for the safe walking route design problem

AU - Tanaka, Kenichi

AU - Miyashiro, Ryuhei

AU - Miyamoto, Yuichiro

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper proposes a mathematical optimization model for designing safe walking routes for children from school to homes. We focus on the existing bi-objective model, the safe walking route design problem, which minimizes both the total walking risk and the total route distances for all children from school to home. The original problem assumes that the combined routes for all children forms a directed out-tree rooted at the school. However, making this assumption excludes solutions such as those involving cycles. This paper explores how to relax the assumption that the graph is an out-tree by using a layered network constructed from the original network. Using the layered network formulation, we obtain some solutions that have better objective values than those obtained by the original formulation when we strongly emphasize reducing the risk objective. The results also show that the new formulation produces the same out-tree solution when minimization of the risk objective and the distance objective are suitably balanced.

AB - This paper proposes a mathematical optimization model for designing safe walking routes for children from school to homes. We focus on the existing bi-objective model, the safe walking route design problem, which minimizes both the total walking risk and the total route distances for all children from school to home. The original problem assumes that the combined routes for all children forms a directed out-tree rooted at the school. However, making this assumption excludes solutions such as those involving cycles. This paper explores how to relax the assumption that the graph is an out-tree by using a layered network constructed from the original network. Using the layered network formulation, we obtain some solutions that have better objective values than those obtained by the original formulation when we strongly emphasize reducing the risk objective. The results also show that the new formulation produces the same out-tree solution when minimization of the risk objective and the distance objective are suitably balanced.

KW - Child road safety

KW - Integer programming

KW - Layered network

KW - Network design

KW - Safe walking route design problem

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

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

U2 - 10.1299/jamdsm.2018jamdsm0065

DO - 10.1299/jamdsm.2018jamdsm0065

M3 - Article

AN - SCOPUS:85051428541

VL - 12

JO - Journal of Advanced Mechanical Design, Systems and Manufacturing

JF - Journal of Advanced Mechanical Design, Systems and Manufacturing

SN - 1881-3054

IS - 3

ER -