Optimal Routing for Vehicles and Pedestrians in the Urban Area

Optimal Routing for Vehicles and Pedestrians in the Urban Area

Gitae Kim, Jinsik Choe
Copyright: © 2022 |Pages: 18
DOI: 10.4018/IJSI.301219
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Traffic congestions, road conditions, and other factors have increased the complexity of vehicle routing problem in urban area. Travel time of a vehicle is obtained by the sum of travel times of road segments. However, the travel time of road segments may not be sufficient to estimate the travel time of a route. When a vehicle arrives at a demand site, the final customer may be in a distance from the vehicle if the site is a complicated building or has a lack of parking space. In this case, we have to consider the route of persons including drivers or service persons. In this paper, we develop integer programming models for the vehicle and pedestrian routing problem. The proposed model provides the strategy to find the optimal route of the vehicle and pedestrians.
Article Preview
Top

Literature Review

Arc Routing Problems

In vehicle routing problems, vehicles travel arc or road to reach the multiple customer sites. Vehicles usually traverses the road or arc in the network. Some cases have vehicles serve any works. The problem of winter maintenance problem has been proposed to find the optimal routes for the snow plowing operations (Perrier et al.). Irnich(2008) proposed a postman traveling problem. They used traveling salesman problem to solve the postman problem (Irnich). They also explored heuristic approaches to solve the problem.

Arc Routing Problems with Turn Penalties

In the arc routing problem, the vehicles are conducting services such as plowing snows or collecting garbage or mail delivery at arcs. When a vehicle is traveling on the road, there are different costs between going straight and turning left or right. Vehicles have to wait when the traffic light is red if the vehicle is going to the left in the intersection. Turning left is taking more costs than turn right. Thus, turn costs have to be taken into account when one determines the costs of vehicle traveling. The turn cost is so called turn penalty. Clossey et al. (2008) investigated an arc routing problem with turn penalties. They also used the traveling salesman problem to solve the problem. Corber et al. (2002) suggested a formulation and solution approaches for rural postman problem. Celik et al. (2016) also dealt with a warehouse problem with turn penalties. Vanhove et al. (2012) presented routing problem with turn restrictions. Vidal (2017) explored the same problem with turn penalties.

Complete Article List

Search this Journal:
Reset
Volume 12: 1 Issue (2024)
Volume 11: 1 Issue (2023)
Volume 10: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 9: 4 Issues (2021)
Volume 8: 4 Issues (2020)
Volume 7: 4 Issues (2019)
Volume 6: 4 Issues (2018)
Volume 5: 4 Issues (2017)
Volume 4: 4 Issues (2016)
Volume 3: 4 Issues (2015)
Volume 2: 4 Issues (2014)
Volume 1: 4 Issues (2013)
View Complete Journal Contents Listing