Traveling model of an ambulance for finding optimal routes to a hospital
In preparation for optimal routing of patients to a hospital, this paper presents a traveling model of the ambulance that moves from the scene of an emergency to a hospital. The model is given in the form of a speed diagram along the route and constructed based on some rules: The ambulance moves wit...
Main Author: | |
---|---|
Format: | Article |
Language: | Japanese |
Published: |
The Japan Society of Mechanical Engineers
2019-02-01
|
Series: | Nihon Kikai Gakkai ronbunshu |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/transjsme/85/871/85_18-00308/_pdf/-char/en |
_version_ | 1798015141283889152 |
---|---|
author | Takahiko ONO |
author_facet | Takahiko ONO |
author_sort | Takahiko ONO |
collection | DOAJ |
description | In preparation for optimal routing of patients to a hospital, this paper presents a traveling model of the ambulance that moves from the scene of an emergency to a hospital. The model is given in the form of a speed diagram along the route and constructed based on some rules: The ambulance moves with either a constant speed, a constant acceleration speed or a constant deceleration speed. The maximum speed changes depending on the legal speed limit for private vehicles. The ambulance decreases its speed to a specified level when it passes through an intersection with traffic lights or turns left or right. The model has eight adjustable parameters. They were optimized in the framework of the multi-objective optimization problem involving three objective functions, which are defined as modeling errors relevant to the traveling time, the fluctuation of blood pressure and the pressing force acting on the back of a patient. The genetic algorithm was used to obtain Pareto solutions to the problem. An optimal set of parameters was selected from among them. The validity of the model was confirmed by checking the objective functions for the validation data set. However, there was a limitation: The model does not match to the actual speed of the ambulance in such a case that it moves on the road where many traffic lights are placed close to each other and controlled synchronously. |
first_indexed | 2024-04-11T15:28:30Z |
format | Article |
id | doaj.art-f9ca82f5e7bb466c8eb474df790aa849 |
institution | Directory Open Access Journal |
issn | 2187-9761 |
language | Japanese |
last_indexed | 2024-04-11T15:28:30Z |
publishDate | 2019-02-01 |
publisher | The Japan Society of Mechanical Engineers |
record_format | Article |
series | Nihon Kikai Gakkai ronbunshu |
spelling | doaj.art-f9ca82f5e7bb466c8eb474df790aa8492022-12-22T04:16:11ZjpnThe Japan Society of Mechanical EngineersNihon Kikai Gakkai ronbunshu2187-97612019-02-018587118-0030818-0030810.1299/transjsme.18-00308transjsmeTraveling model of an ambulance for finding optimal routes to a hospitalTakahiko ONO0Graduate School of Information Sciences, Hiroshima City UniversityIn preparation for optimal routing of patients to a hospital, this paper presents a traveling model of the ambulance that moves from the scene of an emergency to a hospital. The model is given in the form of a speed diagram along the route and constructed based on some rules: The ambulance moves with either a constant speed, a constant acceleration speed or a constant deceleration speed. The maximum speed changes depending on the legal speed limit for private vehicles. The ambulance decreases its speed to a specified level when it passes through an intersection with traffic lights or turns left or right. The model has eight adjustable parameters. They were optimized in the framework of the multi-objective optimization problem involving three objective functions, which are defined as modeling errors relevant to the traveling time, the fluctuation of blood pressure and the pressing force acting on the back of a patient. The genetic algorithm was used to obtain Pareto solutions to the problem. An optimal set of parameters was selected from among them. The validity of the model was confirmed by checking the objective functions for the validation data set. However, there was a limitation: The model does not match to the actual speed of the ambulance in such a case that it moves on the road where many traffic lights are placed close to each other and controlled synchronously.https://www.jstage.jst.go.jp/article/transjsme/85/871/85_18-00308/_pdf/-char/endrive modelambulancepath searchmultiobjective optimizationgenetic algorithmpareto solution |
spellingShingle | Takahiko ONO Traveling model of an ambulance for finding optimal routes to a hospital Nihon Kikai Gakkai ronbunshu drive model ambulance path search multiobjective optimization genetic algorithm pareto solution |
title | Traveling model of an ambulance for finding optimal routes to a hospital |
title_full | Traveling model of an ambulance for finding optimal routes to a hospital |
title_fullStr | Traveling model of an ambulance for finding optimal routes to a hospital |
title_full_unstemmed | Traveling model of an ambulance for finding optimal routes to a hospital |
title_short | Traveling model of an ambulance for finding optimal routes to a hospital |
title_sort | traveling model of an ambulance for finding optimal routes to a hospital |
topic | drive model ambulance path search multiobjective optimization genetic algorithm pareto solution |
url | https://www.jstage.jst.go.jp/article/transjsme/85/871/85_18-00308/_pdf/-char/en |
work_keys_str_mv | AT takahikoono travelingmodelofanambulanceforfindingoptimalroutestoahospital |