scholarly journals Location and Layout of Common Storage and Multichannel Common Distribution considering Time Windows

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Biqin Hu ◽  
Bin Yang ◽  
Wei Jiang ◽  
Zhe Yang ◽  
Mohammed Abdella Kemal

In the process of logistic activities of common storage and common distribution, due to problems such as urban traffic congestion period, parking restriction, working time restriction, and road restriction time, people often agree on the arrival time for customer orders, so that the receiving and delivering parties can connect in time and speed up unloading and distribution. Therefore, considering the actual distribution operation, it is necessary to consider the location and layout of common storage and multichannel common distribution in time windows. This paper takes multichannel common storage and common distribution as the research object, combines with the actual distribution situation, considers the location and distribution route optimization of the common storage and common distribution mode under the condition of time windows, takes the form of linking time windows with distribution time completion efficiency, and forms a reverse constraint on the objective function by time completion efficiency, thus realizing the double-objective optimization of “minimizing the total cost and satisfying the time windows.” In addition, through the comparison of various intelligent algorithms, find that the squirrel search algorithm (SSA) has more stable performance and better solution results.


2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Hongmei Chen ◽  
Yuanhang Zhang

In recent years, a new mode of transportation, referred to as “shared commuter buses,” has been introduced, which can considerably reduce the dependence of office workers on private cars and relieve urban traffic congestion, but is not widely used owing to efficiency issues. Improving the efficiency of shared commuter buses was set as a goal, and in this study, several research objects were selected to optimize the driving routes of shared commuter buses. The problem of stop location is combined with dynamic route optimization; the “shortest walking distance” model is established to select the most appropriate location for stops. The vehicle routing problem model and “key point updating strategy” are employed to plan routes with real-time traffic information. Finally, we conduct an empirical study to validate our conclusions. The results show that both the model and algorithm are reliable and effective; thus, travel efficiency can be effectively improved and traffic jams can be alleviated.





2020 ◽  
Vol 4 (5) ◽  
pp. 884-891
Author(s):  
Salwa Salsabila Mansur ◽  
Sri Widowati ◽  
Mahmud Imrona

Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.



Author(s):  
Dui Hongyan ◽  
Zhang Chi

Background : Taxi sharing is an emerging transportation arrangement that helps improve the passengers’ travel efficiency and reduce costs. This study proposes an urban taxi sharing system. Methods: Considering each side congestion of the transport network, their corresponding reliability and failure probability are analyzed. Under the constraints of the number of passengers and their own time windows, the analysis is performed on passengers whose optimal path is inclusive. Results: According to the optimal strategy, the different passengers can be arranged into the same taxi to realize the taxi sharing. Then the shared taxi route can be optimized. Conclusion: Due to the reasonable vehicle route planning and passenger combination, these can effectively alleviate the traffic congestion, save the driving time, reduce the taxi no-load rate, and save the driving distance. At last, a numerical example is used to demonstrate the proposed method.



2021 ◽  
Vol 13 (8) ◽  
pp. 4280
Author(s):  
Yu Sang Chang ◽  
Sung Jun Jo ◽  
Yoo-Taek Lee ◽  
Yoonji Lee

A large number of articles have documented that as population density of cities increases, car use declines and public transit use rises. These articles had a significant impact of promoting high-density compact urban development to mitigate traffic congestion. Another approach followed by other researchers used the urban scaling model to indicate that traffic congestion increases as population size of cities increases, thus generating a possible contradictory result. Therefore, this study examines the role of both density and population size on traffic congestion in 164 global cities by the use of Stochastic Impacts by Regression on Population, Affluence and Technology model. We divide 164 cities into the two subgroups of 66 low density cities and 98 high density cities for analysis. The findings from the subgroups analysis indicated a clear-cut difference on the critical role of density in low-density cities and the exclusive role of population size in high-density cities. Furthermore, using threshold regression model, 164 cities are divided into the two regions of large and small population cities to determine population scale advantage of traffic congestion. Our findings highlight the importance of including analysis of subgroups based on density and/or population size in future studies of traffic congestion.



Cities ◽  
2019 ◽  
Vol 88 ◽  
pp. 100-111 ◽  
Author(s):  
Yingcheng Li ◽  
Weiting Xiong ◽  
Xingping Wang


2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.



2021 ◽  
Author(s):  
Abdullah Rasul ◽  
Jaho Seo ◽  
Shuoyan Xu ◽  
Tae J. Kwon ◽  
Justin MacLean ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document