Next Article in Journal
Model for Evaluating Outsourcing Logistics Companies in the COVID-19 Pandemic
Next Article in Special Issue
Digital Twin Integrated Reinforced Learning in Supply Chain and Logistics
Previous Article in Journal
A Systematic Investigation of the Integration of Machine Learning into Supply Chain Risk Management
Previous Article in Special Issue
What Young E-Consumers Want? Forecasting Parcel Lockers Choice in Rome
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Intelligent Vehicle Scheduling and Routing for a Chain of Retail Stores: A Case Study of Dhaka, Bangladesh

1
Department of Mechanical and Production Engineering, Ahsanullah University of Science and Technology, Dhaka 1208, Bangladesh
2
Department of Management, North South University, Dhaka 1229, Bangladesh
*
Author to whom correspondence should be addressed.
Submission received: 24 June 2021 / Revised: 4 August 2021 / Accepted: 9 August 2021 / Published: 14 September 2021

Abstract

:
Background: Retail chains aim to maintain a competitive advantage by ensuring product availability and fulfilling customer demand on-time. However, inefficient scheduling and vehicle routing from the distribution center may cause delivery delays and, thus, stock-outs on the store shelves. Therefore, optimization of vehicle routing can play a vital role in fulfilling customer demand. Methods: In this research, a case study is formulated for a chain of retail stores in Dhaka City, Bangladesh. Orders from various stores are combined, grouped, and scheduled for Region-1 and Region-2 of Dhaka City. The ‘vehicle routing add-on’ feature of Google Sheets is used for scheduling and navigation. An android application, Intelligent Route Optimizer, is developed using the shortest path first algorithm based on the Dijkstra algorithm. The vehicle navigation scheme is programmed to change the direction according to the shortest possible path in the google map generated by the intelligent routing optimizer. Results: With the application, the improvement of optimization results is evident from the reductions of traveled distance (8.1% and 12.2%) and time (20.2% and 15.0%) in Region-1 and Region-2, respectively. Conclusions: A smartphone-based application is developed to improve the distribution plan. It can be utilized for an intelligent vehicle routing system to respond to real-time traffic; hence, the overall replenishment process will be improved.

1. Introduction

Nowadays, Industry 4.0 is transforming the physical, digital, and virtual systems through numerous connections with different entities [1]. Supply chain (SC) digitalization emanates from the communication and coordination [2] in a real-time situation to increase organizational competencies [3] by embracing digital tools [4]. Moreover, digitalization has caused significant economic shifts in supply chain management (SCM) as the demand for products and services is growing exponentially due to globalization. Thus, a great opportunity is arising for SCM to be the focal point of competitive advantage in business. The basic components of SC are organizations, consumers, operations, and information. The most significant aspects of SCM are categorized as procurement, production, and delivery [5]. Thus, management of transportation has become a vital issue for an organization to increase its operating performance, customer loyalty, and profitability [6].
The SCM system is driven by customer demands, the type of goods to be produced, raw materials to be used, manufacturing methods, delivery schedule, and transportation at the end. A key characteristic of SCM is its changing nature which emerges from the movement of inventory, cash, and information among the network entities [7]. The management of these flows falls under the purview of logistics functions for scheduling and routing activities [8]. The efficacy of the logistics system depends on the vehicle scheduling and routing optimization, which influences the profitability and customer satisfaction. The vehicle routing problem (VRP) deals with the issues that arise when the vehicles are scheduled and operated from the hub (initial location) to deliver products to customers (several locations) [9]. The solution of VRP is a group of optimal routes; those routes start and end in the hub, satisfying demands by serving customers. The process requires route selection, estimating alternate routes, and predicting driving time based on criteria variables, objective functions, and constraints [10].
Moreover, the revolutions in transportation systems, telecommunications, and vehicular technologies create opportunities for controlling the supply chain and logistics operations [11]. An intelligent transportation system develops the capability to guide the driver to the destination by providing optimal routing information in real-time traffic conditions [12] and/or by finding optimal routes with less fuel consumption [13]. Therefore, adopting innovative technologies for autonomous vehicles, big data, and the internet of things (IoT) will resolve unforeseeable challenges in the transportation sector [14]. Further-more, cloud computing increases supply chain efficiency through increased visibility and collaboration in order processing, inventory management, warehousing, and logistics [15]. The assimilation of Internet of Things (IoT) to cloud-based system enables dynamic management of vehicle routing operations by inter-communication, connection, and action among various supply chain components [10] as proposed in Figure 1.
In the retail industry, artificial intelligence (AI) applications are increasing in various areas of ordering, processing, and transporting goods [16]. Autonomous transport systems are used in intralogistics for optimizing alternative routes [17]. Machine learning (ML) is used at Amazon for each shipment’s ideal packaging size selection [18]. An intelligent AI application, called Eden, was launched by the global US retail group Walmart to optimize its supply chain by inspecting the freshness of fruit and vegetables [19]. The use of mobile applications has led innovations through various logistics process of e-grocery retail in South Africa [20].
In Bangladesh, chains of retail stores were started with the aim of providing quality-goods at reasonable prices with a comfortable shopping experience [21]. The chain stores (also known as super shops) maintain customer satisfaction to achieve a competitive advantage in the retailing sector [22]. The key points identified for retail chain service improvement are pleasant shopping conditions, better services, a variety of goods, and efficient supply management [23]. The key challenge for a retail chain is to distribute all the products from the warehouse to the stores at the right time at the right place with ensured quality. Moreover, the distribution cost is on the higher side, which needs optimization for a profitable and sustainable retail business [24]. Hence, vehicle routing plays a crucial role for a super shop chain to supply products to its different outlets. In the absence of proper vehicle routing, the driver of a vehicle moves from one outlet to another randomly, and thereby increases both the traveling distance and time. An intelligent vehicle routing system can help to fulfill increased customer service expectations by responding to the real-time traffic condition for route optimization to reach the destination points. Therefore, in this paper, an attempt has been taken to make the vehicle routing of a chain of retail stores effective and automotive by making it intelligent.

2. Literature Review

2.1. Vehicle Routing Problem

Vehicle routing problem (VRP) focuses on determining the optimal vehicle route to fulfill customer demands with minimum distance (time or cost). This concept was introduced to find the optimal paths by minimizing the traveling distances of petrol delivery trucks [25]. Subsequently, many vehicle routine problems were formulated with various logistical applications. In particular, a time slot is maintained for delivery in the VRP with time windows to find appropriate solutions for several real-life problems in manufacturing, scheduling, and logistics. Pickup and delivery with time windows using limited vehicles are considered for delivering several transport requests [26]. The dynamic vehicle routing problem (DVRP) with time windows model was developed to reduce the vehicle cost using real-time travel information. The two components of flow simulation and route choice simulation is linked in the block density model [27], as shown in Figure 2a, where the shortest path is chosen at a node. Real-time routing and dispatching problems were solved by implementing parallel strategies for route re-optimization and computation [28]. A model was developed to find an optimal route by simulating and updating the route plan regularly according to the real-time traffic in Smart Cities [29]. In this model, the classical Dijkstra algorithm [30] was used to find the shortest path in a city map. Emergency vehicle routing was simulated for earthquake conditions in Okayama City, Japan, by using a modified Dijkstra algorithm [31].

2.2. Big Data, IoT and Intelligent Transportation

Big-data based algorithms are increasingly used in intelligent transportation systems (ITS) for a variety of applications in recognition of traffic signals, detection of objects, prediction of traffic flow, and planning of travel times and routes [32]. One such example is the development of an Android application for automatic capturing and image processing using mobile devices’ integrated camera systems for the detection of stolen cars, management of parking systems, and verification of license plates [33]. Very recently, nine disruptive technologies such as additive manufacturing, artificial intelligence (AI), automated robots, autonomous vehicles, big data analytics, blockchain, drones, electric vehicles (EV), and the internet of things (IoT) were identified as the emerging disruptive technologies expected to affect logistics and transportation [34]. Intelligent cloud-based technology is making a significant impact on the logistics sector, as cloud computing is used for autonomous logistics to synchronize the real time flow of material and information [35]. IoT utilizing cyber-physical systems (CPS), equipped with electronics and software, connects the physical system with the digital world to optimize the system’s performance [36]. Vehicular cyber-physical systems (VCPS) are designed for smart roads by realizing mobile cloud computing services where vehicles and mobile devices are connected to both cloud servers and clients [37], as illustrated in Figure 2b. Open source VRP Spreadsheet Solver designed to work by storing information in the server console and supplying information to the worksheet of locations, distances, vehicles, solution and visualization [38], as shown in Figure 2c with the illustration of information flow. A smartphone-based prototype application was developed for cargo transportation using an information and communication technology (ICT) based service [39].

2.3. Pathfinding, Scheduling and Intelligent Navigation

The pathfinding analysis, used for various sectors of logistics and transportation network operation, identifies the shortest path to solve the fundamental vehicle routing problem [40]. An algorithm was developed for the shortest pathfinding from the perspective of space and time complexity [41] in a sequence of partial graphs with original graph growth [42]. The shortest path analysis using artificial intelligence based on linear graph theory applied to avert obstacles on routes [43]. A mobile application was developed for agricultural product logistics by using Dijkstra’s algorithms to calculate the shortest path to discover the transportation routes [44]. Ant Colony Optimization was recently adopted to solve multiple delivery routing problems for E-logistics service providers [45].
An online scheduling approach combined qualitative and quantitative research methods using operational research and artificial intelligence to solve the vehicle routing problem for B2C e-commerce urban logistic problems [46]. By incorporating the intelligent system of traffic image processing and shortest path first algorithm, the traveling time can be reduced significantly. The shortest available path was determined by knowing the real-time traffic conditions to effectively navigate the driving [47]. An Android application for a smartphone was developed for real-time decision-making involving traffic conditions on the road [48]. Using graph theory and shortest path algorithm, a mobile map was designed and developed to find the shortest and quickest route between two locations [49]. To make the vehicle routing algorithms practical, global positioning system (GPS) data was used for the algorithms to provide the optimal solution to a real-world scenario [50]. A system was developed to automatically gather information using sensors attached to the vehicle and transmit information through GSM-enabled devices. An intelligent monitoring system was developed by using GPS, Google Maps, and cloud computing to take all the necessary inputs of the vehicles like their real-time location, fuel level, driver conditions, and speed [51]. An online map service was used to develop a dynamic vehicle routing system to respond to real-time customer demands cost-effectively with improved visual effects [52]. An Android application was developed for the optimal tour (shortest distance) using the Genetic Algorithm and was implemented using the Google API [53]. The essential elements of the navigation system are the minimalist path algorithm and up-to-date road networks on the maps [54]. An AI based transportation system is crucial for the development of mechanical intelligence [55] for Smart Connected Logistics (SCL) systems, making it more complex, automated, intelligent, and adaptive [56].
From the above review of the literature, it is realized that dynamic vehicle routing and scheduling optimization can be an efficient way to attain the optimal output for better adaptability and performance. Hence, the current research aims to implement application-based intelligent vehicle routing for a chain of retail stores to respond in real-time traffic conditions.

3. Problem Identification and Solution Approach

Consider a chain of retail superstores facing challenges distributing several products from its warehouse to different outlets/stores due to scheduling and routing issues. The retail chain is located in Dhaka, Bangladesh, and experiences an inefficient distribution plan with higher transportation costs [24]. Thus, this research was carried out to optimize the scheduling and vehicle routing in supplying goods from the distribution center to outlets. As a current practice, manual scheduling and routing are used to deliver products using limited capacity vehicles. Hence, the optimal output is not achieved due to the extra traveling of vehicles. Moreover, the traffic conditions in Dhaka city are often affected by congestion and traffic jams. Therefore, an optimal route is required to respond to the dynamic traffic conditions. Additionally, navigating on the road without knowing the real-time traffic conditions undermines the product delivery target for the stores. Hence, this paper attempts to implement intelligent vehicle routing and scheduling to improve the distribution system by reducing the transportation distance and time. Daily demand information obtained for two different commodities (rice and pulse) for 87 stores/outlets is shown graphically in Figure 3. Demands are fulfilled daily from the central warehouse (depot) using the vehicles (covered van) to the store/outlets.
The capital city of Bangladesh, also known as of Dhaka City Corporations (North and South), lies between 23.69° and 23.89° North latitudes and 90.33° and 90.44° East longitudes [57]. Due to inadequate space and road infrastructure, frequent traffic congestion results in severe economic losses in the transport system in Dhaka city [58]. The government has initiated comprehensive transport planning and infrastructure programs to improve the traffic conditions [59]. This initiative has increased wider roads and improved the traffic conditions in the newly developing areas (North-East part) of Dhaka city. Thus, a dotted line has been drawn on the map of Dhaka city [60] to identify newly developing areas (Region-1) and old areas (Region-2), as shown in Figure 4. In this study, transportation assignments were considered for vehicle routing as vehicle V1 and V2 for Region-1 and V3 and V4 for Region-2, respectively.
This study collected data through a physical questionnaire survey with four delivery vehicles’ drivers and the operation head. The demand at the outlet is known the day before delivery. The total minimum demand for rice and pulses is 500 kg, while the total maximum demand is 2000 kg. Four vehicles with limited capacities were assigned for scheduling and routing purposes. Vehicles 1 and 2 were considered for Region-1, while vehicles 3 and 4 were considered for Region-2. The maximum capacity of the vehicle (total weight of rice and pulse) is 6000 kg. It was assumed that each vehicle visits one node (store/outlet) only once. The first node was considered as a depot (warehouse). Each vehicle starts its journey from the depot, delivers the goods at nodes (stores), and ends the journey at the depot. The daily demand at nodes does not exceed the capacity of the vehicle. From the 87 stores/outlets, sample data set with 10 outlets in Region-1 and Region-2 were selected with location information such as latitude, longitude, addresses, postal code, and daily demand information, as listed in Table 1 and Table 2.

4. Intelligent Vehicle Scheduling and Routing

Intelligent vehicle routing is demonstrated by finding the shortest path between nodes (outlets) through a two-step procedure of scheduling and routing utilized to identify the optimal vehicle routing for a chain of retail stores/outlets. The methodology was developed by using the demands of different outlets, combining those demands, and clustering these by territory/region. The scheduling and routing plans were developed by considering the vehicle capacity (weight) constraints.

4.1. Scheduling Process

The scheduling process considers the maximum number of stores/outlets that a vehicle can attend with its capacity-constraint (weight) based on the demand at nodes (outlets). The approach appoints the minimum number of vehicles required to serve the nodes (outlets), thereby reducing the number of vehicles. An open-source spreadsheet-based solver can be used for the Vehicle Routing Problem (VRP) where the server console stores information for other worksheets (elements) of locations, distances, vehicles, solutions, and visualizations [38], as is illustrated in Figure 2c. Google Sheets, a free web-based spreadsheet application, was used for vehicle scheduling in the present study. To integrate the road traffic condition, the vehicle routing add-on feature is added on the Google Sheet. Figure 5 shows the key features of the vehicle routing add-on and options for the route solver worksheet developed by Zagetoo [61]. Therefore, manual human efforts were needed less for scheduling the activity due to using the added feature of location and route visibility on Google Maps. The application solver uses information about the store’s demand, location, available vehicle, and vehicle capacity constraints for scheduling and routing solutions in real-time traffic conditions.
To begin the scheduling process, a Google spreadsheet was opened from the desktop browser and ‘vehicle routing add-on’ was added to the Google Sheet. Information from Table 1 was added in the location tab for the location ID, latitude, longitude, address of depot (warehouse), and outlets (stores). Then, vehicle and order information was added to the vehicle and order sections accordingly by following the procedure of Zagetoo [61]. The application solves the problem once “Solve Vehicle Routes” is clicked. Visualization is seen from “View vehicle routes” feature. Moreover, the route sequencing of vehicles is available at “Route” section at the footer. Once all the necessary information was updated for vehicle 1 and vehicle 2 in Region-1, the vehicle routing solver worked to maximize capacity utilization and cover the maximum number of outlets (stores). The solution of scheduling and delivery sequence for Region-1 is shown in Figure 6.
For scheduling of vehicle 3 and vehicle 4 in Region-2, the latitude and longitude of outlet location information listed in Table 2 was added. Then, the vehicle capacity (weight) and the order information were filled in according to the procedure mentioned earlier. Finally, the solution of delivery schedule was obtained for outlets 11 to 20 in Region-2, as shown in Figure 7. For vehicle-3, the order delivery sequence followed as “depot (start)–order 6–order 8–order 7–order 10-depot (return)”. For vehicle 4, the order delivery scheduling plan started from the depot, delivered six orders, and returned to the depot.

4.2. Development of Intelligent Route Optimizer Application (App)

There are many ways to travel from one outlet to another, and thus, many nodes may arise from the depot to reach the destination (outlets). Moreover, as the road traffic conditions are constantly changing, navigating the vehicles based on instant traffic conditions from one outlet to another is crucial to obtain an efficient and optimal routing output. Therefore, the Dynamic Vehicle Routing Problem (DVRP) considers the optimization algorithm to monitor the movement of individual vehicles according to the traffic conditions [62]. In response to changes in the real-time traffic conditions, the optimizer can update the vehicles’ schedules by re-optimizing the route. Therefore, in this study, an attempt was made to develop an intelligent route optimizer process flow shown in Figure 8 based on the vehicle routing approach [63] with the concept of real-time fleet management systems [64]. For the shortest traveling distance between the depot (warehouse) and nodes (outlets/stores), an appropriate weight was considered for the distance between them. The computation was progressed by choosing the smallest distance among the adjacent nodes’ distances. The process continued for generating the path by identifying all adjacent nodes related to the current nodes. The nodes’ weights were added to the current nodes to compute their distance to other nodes to reach the destination. However, the change of the nodes occurred only if it was less than the previous one. The weightage was calculated from previous nodes to current nodes based on adjacent nodes. After completing the algorithm, the shortest route was selected. If any obstruction arises on the selected path, the edges of weight re-evaluate and find another shortest path. Thus, the application (app) process flow was developed based on artificial intelligence to respond to the real-time data of traffic that makes the vehicle routing intelligent.
Internet and mobile applications significantly influence the transportation system, as travelers use traffic and navigation applications to aid their journey [65]. This is evident from the aspects of Industry 4.0 for enabling human-machine interaction (HMI) throughout a highly networked environment [66] of business management, production process and logistics [67]. Moreover, with the progress of digitalization through connectivity, the use of mobile applications (apps) increases due to the widespread diffusion of smartphones and devices [68]. Additionally, these devices can run standalone applications (apps) to access information via a web gateway, thus generating increased interest for mobile apps development among the independent developers [69]. The rapid adoption of Google’s freely licensed operating system (OS) and the availability of the Android Open-Source Project (AOSP) accelerated the mobile apps development culture [70]. Android is a Linux-based open-source OS, where mobile apps are mostly developed using the Java programming language [71]. Consequently, the Android operating system (OS) has been widely accepted by software developers and non-expert users [72]. Android Studio offers an integrated development interface for developing the Android operating system [73], promoting Gradle base build support, quick troubleshooting, fast performance, and user usability and compatibility.
For this study, we developed an intelligent route optimizer app in the Google platform by utilizing the amiable operating system of Android Studio 4.0. The application icon is shown in Figure 9a. The map of Bangladesh is located on the user interface once the application icon is tapped, as shown in Figure 9b. The center location icon helps to identify the user’s current location, as shown in Figure 9c.
The app was specifically designed for a chain of retail superstores to improve their transportation service. Java language was used to develop the application using the Android SDK (Software Development Kit) tool. The key feature of this application is to show the shortest path between the origin and destination points by generating the shortest routes with an alternative best route between the outlets. On the map, the ‘Tap’ feature was used in this app to select a destination point. The application was developed by using the Dijkstra algorithm, alternative path algorithm, and Google API key features. Dijkstra’s shortest path algorithm is employed for road networks to determine the distance between origin and destination nodes. Edsger W. Dijkstra formulated the algorithm in 1956, and then after three years, it was published [74]. To reach the destination from the current location, many nodes may appear. The concept of the algorithm was used to continuously compute the shortest distance by eliminating the longer distances [75] during the optimization process. To plot the route between the nodes, the shortest path was retrieved and stored into a variable. Various tools from the Google cloud platform, such as real-time navigation and ‘On Map Tap’ features, were incorporated into the system for automatic decision-making.

4.3. Application Interface

The application was designed to incorporate intelligence in vehicle routing for a chain of retail stores to improve the transportation service. The application can generate the shortest routes with an alternative best route. Figure 10a illustrates the operation flowchart of the Intelligent Route Optimizer. The ‘On Map Tap’ feature was used so the user can tap the map to select a destination point. The application displays the shortest route with an alternative best route to the destination. This is the unique feature of the application, which generates the path once the location is tapped, compared to other VRP applications where the destination and location have to be selected manually.
Once the location sign is tapped, the app takes the current (instant) location. The stores/outlets are marked in their respective places. If any store location is tapped, the app immediately shows ways to reach that position with optimum and alternate methods. Figure 10b shows the illustration of the application where the vehicle starts a journey from the depot to visit five outlets from its initial depot point. The optimum routes are shown in a green color, and alternate routes are shown in an ash color in the Google map. Moreover, both the estimated distance and time of the proposed routing are shown once the blue marker is tapped. For example, the optimum routing will need an 18 km distance with an estimate of 57 min, whereas alternate routing will require traveling a 19.82 km distance in 1 h 5 min time to reach outlet two, as illustrated in Figure 10c.

4.4. Implementation Results

The developed application was utilized for the delivery journey of vehicles in Region-1 and Region-2 according to the schedule and navigation scheme shown in Figure 6 and Figure 7 in Section 4.1. In these journeys, the total traveling distance and time were investigated with and without using the application. While computing the traveling distance for individual vehicles, the depot (warehouse) distance to the first delivery outlet/store was recorded. Subsequently, the distance from the first delivery outlet/store to the second delivery outlet/store was recorded. This process was repeated until the vehicle returns to the depot. Similarly, the traveling time was recorded. The results of vehicle 1 and vehicle 2 are shown in Table 3 and Table 4, respectively.
Comparison of the traveled distance and time before (without implementing the application) and after (upon implementing the application) is shown in Table 3 and Table 4 for vehicle 1 and vehicle 2, respectively. During the travel, the distance became shorter or the same to reach the next node. The reduction of time was observed while traveling before (without the application) and after (with the application).
Similarly, the traveled distance and time before and after application used is shown for vehicle 3 and vehicle 4 in Table 5 and Table 6, respectively. A reduced distance was observed during the travel, as the vehicle took a shorter way to reach the next node. The traveled time either shortened or remained the same to reach the next node.
Figure 11 shows the vehicle-wise traveled distance and time before and after implementing the intelligent route optimizer. It was observed that the traveled distance for vehicle 1, vehicle 2, vehicle 3 and vehicle 4 are reduced by 3.6 km, 2.1 km, 1.4 km, and 4.7 km, respectively. Moreover, the traveled time is reduced for vehicle 1, vehicle 2, vehicle 3 and vehicle 4 are 35 min, 35 min, 13 min, and 31 min, respectively. In this instance, Figure 12a provides valuable information of traveled time with distance before and after implementing the intelligent route optimizer. The travel time and distance follow similar behavior as observed [76] with empirical results of road transportation.
Additionally, a non-linear relationship between traveling distance and time is evident from Figure 12b, where the optimal route suggests 16.3 km in 48 min and the alternate route suggests 16.3 km in 53 min to reach the destination. The traveling distance was the same (16.3 km), but an increased time is shown for the alternate routing. This could be due to the effect of real-time road traffic conditions considered in the intelligent routing optimizer.
A noticeable improvement of traveled distance and time for the individual vehicle was observed using the developed application on the journey, as illustrated in Figure 13a. This is evident from the juxtaposition of the percent reduction of distance and time for non-optimal (without the application) and optimal (with the application) for each vehicle.
Additionally, percent reduction data of distance and time for Region 1 and Region 2, shown in Figure 13b, suggests a substantial improvement in each region before and after using the intelligent routing optimizer. The non-proportionality relationship between percent reduction of distance and time is observed in Figure 13. This could be due to the inclusion of non-driving time into the total travel time arising from the influence of traffic obstacles, traffic signals, and jams in the Dhaka city road network [58]. Moreover, higher values of the percent reduction in Region 1 than in Region 2 support the effect of new and extended road networks on transportation in Region 1 of Dhaka city [59]. Therefore, improved road traffic conditions and network infrastructure augment better vehicle routing results with Intelligent Routing Optimization.

5. Conclusions

In this study, intelligent vehicle routing is demonstrated for a chain of retail stores using the demand information of different outlets, combining those demands and clustering these by territory. The Google Sheet-based scheduling and navigation plans were developed by using those clustered territories. Finally, an Android Studio 4.0 based application was developed by incorporating artificial intelligence to respond to the real-time traffic data for vehicle routing. The following conclusions can be drawn from this research:
  • An optimization approach was applied to design vehicle scheduling and to find the shortest path between nodes (outlets/stores). Based on real-time traffic data, the application generates an alternate shortest path to avoid any obstruction during the journey, where several outlets are to be visited in a single journey.
  • The spreadsheet-based solver tool utilizing the Google Vehicle Routing add-on improves the vehicle scheduling and navigation sequence. This is due to the use of Google Maps and the consideration of real-time traffic conditions during the scheduling process. Moreover, the application was developed based on real-time traffic information, expecting an optimum vehicle routing solution.
  • The application displays the shortest route with an alternative best route to the destination. The ‘On Map Tap’ feature underpins the uniqueness of the application, as it generates the path once the location is tapped, compared to other VRP applications where the destination and location have to be selected manually. Using the intelligent route optimizer application, both the traveling time and distances are decreased in the journey. Sometimes the path may be shortest, but it may take longer than the other routes due to traffic conditions on the road. Thus, the application not only considers the distance but also suggests the shortest time to reach the outlet to achieve an optimal routing solution.

Limitations and Future Research Directions

This paper presents a numerical example of demand fulfillment of a retail chain store with four vehicles of a 24-ton capacity. Moreover, the study considers rice and pulse only, while a grocery chain deals with many other products. This model can be extended for multiple outlets with larger shipments and more vehicles, as experienced by a retail chain in real life. However, that would generate similar results on a greater scale with a bit of addition to the managerial insights. In this research, traveling routes between two nodes were optimized following the Dijkstra algorithm. The current study assumed that one node is served by one vehicle only. Serving one outlet by two or more vehicles will be an interesting case for further research. In future works, the logistics networks can be improved by sequencing and optimizing all nodes simultaneously based on the real-time traffic. Furthermore, the application of other algorithms such as Bellman-Ford Algorithm and the Floyd-Warshall Algorithm can also be explored. The study can be further enhanced by incorporating the effect of transportation-related factors such as peak and off-peak time, vehicle condition, vehicle speed, transport idle time in the signals, and road/network conditions on the intelligent vehicle routing optimization. This is expected to significantly improve the distribution plan for a chain of retail stores by utilizing the application for the whole delivery system.

Author Contributions

Conceptualization, M.A.R., A.-A.H., B.D. and Z.M.Z.; Data curation, A.-A.H. and B.D.; Formal analysis, M.A.R., B.D. and Z.H.A.; Investigation, A.-A.H., B.D. and Z.M.Z.; Methodology, M.A.R., A.-A.H., B.D. and Z.M.Z.; Resources, M.A.R. and M.S.M.; Software, A.-A.H., B.D. and Z.M.Z.; Supervision, M.A.R.; Validation, A.-A.H. and B.D.; Writing—original draft, M.A.R., A.-A.H., B.D. and Z.H.A.; Writing—review & editing, M.A.R., M.S.M. and Z.H.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All data is included in the manuscript.

Acknowledgments

Department of Mechanical and Production Engineering, Ahsanullah University of Science and Technology, Dhaka, Bangladesh. Authors are delightedly thankful to Elias Parvez, head of operations, for providing the delivery data and Sumon Islam for assisting the programming during the application development.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ponis, S.T.; Efthymiou, O.K. Cloud and IoT applications in material handling automation and intralogistics. Logistics 2020, 4, 22. [Google Scholar] [CrossRef]
  2. Zouari, D.; Ruel, S.; Viale, L. Does digitalising the supply chain contribute to its resilience? Int. J. Phys. Distrib. Logist. Manag. 2021, 51, 149–180. [Google Scholar] [CrossRef]
  3. Colli, M.; Berger, U.; Bockholt, M.; Madsen, O.; Møller, C.; Wæhrens, B.V. A maturity assessment approach for conceiving context-specific roadmaps in the Industry 4.0 era. Annu. Rev. Control. 2019, 48, 165–177. [Google Scholar] [CrossRef]
  4. Büyüközkan, G.; Göçer, F. Digital Supply Chain: Literature review and a proposed framework for future research. Comput. Ind. 2018, 97, 157–177. [Google Scholar] [CrossRef]
  5. Díaz-Madroñero, M.; Peidro, D.; Mula, J. A review of tactical optimization models for integrated production and transport routing planning decisions. Comput. Ind. Eng. 2015, 88, 518–535. [Google Scholar] [CrossRef]
  6. Brekalo, L.; Albers, S. Effective logistics alliance design and management. Int. J. Phys. Distrib. Logist. Manag. 2016, 46, 212–240. [Google Scholar] [CrossRef] [Green Version]
  7. Chopra, S.; Meindl, P.; Kalra, D.V. Supply Chain Management: Strategy, Planning, and Operation; Pearson: Boston, MA, USA, 2013; pp. 13–25. [Google Scholar]
  8. Coyle, J.J.; Langley, C.J.; Novack, R.A.; Gibson, B. Supply Chain Management: A Logistics Perspective; Cengage Learning: Boston, MA, USA, 2016; pp. 51–77. [Google Scholar]
  9. Teodorovic, D.; Lucic, P. Intelligent vehicle routing system. In Proceedings of the IEEE Conference on Intelligent Transportation Systems ITSC2000, Dearborn, MI, USA, 1–3 October 2000; pp. 482–487. [Google Scholar] [CrossRef]
  10. Abosuliman, S.S.; Almagrabi, A.O. Routing and scheduling of intelligent autonomous vehicles in industrial logistics systems. Soft Comput. 2021, 25, 11975–11988. [Google Scholar] [CrossRef]
  11. Liu, J.; Mirchandani, P.; Zhou, X. Integrated vehicle assignment and routing for system-optimal shared mobility planning with endogenous road congestion. Transp. Res. C Emerg. Technol. 2020, 117, 102675. [Google Scholar] [CrossRef]
  12. Lin, C.H.; Yu, J.L.; Liu, J.C.; Lee, C.J. Genetic algorithm for shortest driving time in intelligent transportation systems. In Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), Busan, Korea, 24–26 April 2008; pp. 402–406. [Google Scholar]
  13. Ericsson, E.; Larsson, H.; Brundell-Freij, K. Optimizing route choice for lowest fuel consumption—Potential effects of a new driver support tool. Transp. Res. C Emerg. Technol. 2006, 14, 369–383. [Google Scholar] [CrossRef]
  14. Azmat, M.; Kummer, S.; Moura, L.T.; Gennaro, F.D.; Moser, R. Future outlook of highway operations with implementation of innovative technologies like AV, CV, IoT and Big Data. Logistics 2019, 3, 15. [Google Scholar] [CrossRef] [Green Version]
  15. Prasse, C.; Nettstraeter, A.; Hompel, M.T. How IoT will change the design and operation of logistics systems. In Proceedings of the 2014 International Conference on the Internet of Things (IOT), Cambridge, MA, USA, 6–8 October 2014; pp. 55–60. [Google Scholar]
  16. Weber, F.D.; Schütte, R. State-of-the-art and adoption of artificial intelligence in retailing. Digit. Policy, Regul. Gov. 2019, 21, 264–279. [Google Scholar] [CrossRef]
  17. Wurman, P.R.; D’Andrea, R.; Mountz, M. Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 2008, 29, 9. [Google Scholar]
  18. Stevens, L.; Phillips, E.E. Amazon Puzzles over the Perfect Fit-In Boxes. Available online: https://www.wsj.com/articles/amazon-aims-for-one-box-fits-all-1513765800 (accessed on 17 June 2021).
  19. Weber, F.; Schütte, R. A domain-oriented analysis of the impact of machine learning—The case of retailing. Big Data Cogn. Comput. 2019, 3, 11. [Google Scholar] [CrossRef] [Green Version]
  20. Mkansi, M.; de Leeuw, S.; Amosun, O. Mobile application supported urban-township e-grocery distribution. Int. J. Phys. Distrib. Logist. Manag. 2020, 50, 26–53. [Google Scholar] [CrossRef]
  21. Hossain, M.A. Developing Backward Linkage for Supermarket in Bangladesh: An Empirical Study. Ph.D. Thesis, University of Dhaka, Dhaka, Bangladesh, 2017. [Google Scholar]
  22. Ellram, L.M.; La Londe, B.J.; Weber, M.M. Retail logistics. Int. J. Phys. Distrib. Mater. Manag. 1989, 19, 29–39. [Google Scholar] [CrossRef]
  23. Alam, Z.M.; Rana, S.S.M. Customers’ attitudes towards retail chain store ser-vices in Bangladesh—A comparative study between retail chain stores and small retail stores. J. Bus. Stud. 2013, 5, 1–18. [Google Scholar]
  24. Takvir, A. Distribution management for a retail chain “Shwapno”. Int. J. Sci. Eng. Res. 2018, 9, 431–434. [Google Scholar]
  25. Dantzig, G.B.; Ramser, J.H. The truck dispatching problem. Manag. Sci. 1959, 6, 80–91. [Google Scholar] [CrossRef]
  26. Røpke, S.; Pisinger, D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 2006, 40, 455–472. [Google Scholar] [CrossRef]
  27. Taniguchi, E.; Shimamoto, H. Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transp. Res. C Emerg. Technol. 2004, 12, 235–250. [Google Scholar] [CrossRef]
  28. Ghiani, G.; Guerriero, F.; Laporte, G.; Musmanno, R. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 2003, 151, 1–11. [Google Scholar] [CrossRef]
  29. Nha, V.T.N.; Djahel, S.; Murphy, J. A comparative study of vehicles’ routing algorithms for route planning in smart cities. In Proceedings of the 2012 First International Workshop on Vehicular Traffic Management for Smart Cities (VTM), Dublin, Ireland, 20–20 November 2012. [Google Scholar] [CrossRef] [Green Version]
  30. Dijkstra, E.W. A note on two problems in connexion with graphs. Numer. Math. 1959, 1, 269–271. [Google Scholar] [CrossRef] [Green Version]
  31. Eklund, P.W.; Kirkby, S.; Pollitt, S. Dynamic multi-source Dijkstra’s algorithm for vehicle routing. In Proceedings of the 1996 Australian New Zealand Conference on Intelligent Information Systems ANZIIS 96, Adelaide, SA, Australia, 18–20 November 1996; pp. 329–333. [Google Scholar] [CrossRef]
  32. Kaffash, S.; Nguyen, A.T.; Zhu, J. Big data algorithms and applications in intelligent transportation system: A review and bibliometric analysis. Int. J. Prod. Econ. 2021, 231, 107868. [Google Scholar] [CrossRef]
  33. Do, H.N.; Vo, M.; Vuong, B.Q.; Pham, H.T.; Nguyen, A.H.; Luong, H.Q. Automatic license plate recognition using mobile device. In Proceedings of the International Conference on Advanced Technologies for Communications (ATC), Hanoi, Vietnam, 12–14 October 2016; IEEE: Piscataway, NJ, USA, 2016; pp. 268–271. [Google Scholar]
  34. Dong, C.; Akram, A.; Andersson, D.; Arnäs, P.-O.; Stefansson, G. The impact of emerging and disruptive technologies on freight transportation in the digital era: Current state and future trends. Int. J. Logist. Manag. 2021, 32, 386–412. [Google Scholar] [CrossRef]
  35. Schuldt, A.; Hribernik, K.; Gehrke, J.D.; Thoben, K.-D.; Herzog, O. Cloud computing for autonomous control in logistics. In INFORMATIK 2010. Service Science—Neue Perspektiven für die Informatik; Fähnrich, K.-P., Franczyk, B., Eds.; Gesellschaft für Informatik e.V.: Bonn, Germany, 2010; Volume 1, pp. 305–310. [Google Scholar]
  36. Moufaddal, M.; Benghabrit, A.; Bouhaddou, I. A cyber-physical warehouse management system architecture in an Industry 4.0 context. In Advances in Intelligent Systems and Computing, Proceedings of the Artificial Intelligence and Industrial Applications. A2IA 2020, Meknes, Morocco, 4–5 December 2020; Masrour, T., Cherrafi, A., El Hassani, I., Eds.; Springer: Cham, Switzerland, 2021; Volume 1193. [Google Scholar] [CrossRef]
  37. Rawat, D.B.; Bajracharya, C. An overview of vehicular networking and cyber-physical systems. In Vehicular Cyber Physical Systems; Springer: Cham, Switzerland, 2017; Chapter 1; pp. 1–13. [Google Scholar] [CrossRef]
  38. Erdoğan, G. An open source spreadsheet solver for vehicle routing problems. Comput. Oper. Res. 2017, 84, 62–72. [Google Scholar] [CrossRef]
  39. Azab, A.; Park, J.; Mostafa, N.A. Smart mobile application for short-haul cargo transportation. Logistics 2021, 5, 36. [Google Scholar] [CrossRef]
  40. Zeng, W.; Church, R.L. Finding shortest paths on real road networks: The case for A*. Int. J. Geogr. Inf. Sci. 2009, 23, 531–543. [Google Scholar] [CrossRef]
  41. Gallo, G.; Pallottino, S. A new algorithm to find the shortest paths between all pairs of nodes. Discret. Appl. Math. 1982, 4, 23–35. [Google Scholar] [CrossRef] [Green Version]
  42. Pallottino, S. Shortest-path methods: Complexity, interrelations and new propositions. Networks 1984, 14, 257–267. [Google Scholar] [CrossRef]
  43. Khantanapoka, K.; Chinnasarn, K. Pathfinding of 2D & 3D game real-time strategy with Depth Direction A* algorithm for multi-layer. In Proceedings of the Eighth International Symposium on Natural Language Processing, Bangkok, Thailand, 20–22 October 2009; pp. 184–188. [Google Scholar] [CrossRef]
  44. Nuanmeesri, S. Mobile application for the purpose of marketing, product distribution and location-based logistics for elderly farmers. Appl. Comput. Inform. 2019. [Google Scholar] [CrossRef]
  45. Ky Phuc, P.N.; Phuong Thao, N.L. Ant colony optimization for multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets. Logistics 2021, 5, 28. [Google Scholar] [CrossRef]
  46. Shi, H.; Sun, L.; Teng, Y.; Hu, X. An online intelligent vehicle routing and scheduling approach for B2C e-commerce urban logistics distribution. Procedia Comput. Sci. 2019, 159, 2533–2542. [Google Scholar] [CrossRef]
  47. Chmiel, W.; Skalna, I.; Jędrusik, S. Intelligent route planning system based on interval computing. Multimedia Tools Appl. 2018, 78, 4693–4721. [Google Scholar] [CrossRef] [Green Version]
  48. Ahmadullah, N.; Islam, S.; Ahmed, T. Route Finder: Real-time optimum vehicle routing using mobile phone network. In Proceedings of the TENCON 2015—2015 IEEE Region 10 Conference, Macao, China, 1–4 November 2015; pp. 1–7. [Google Scholar] [CrossRef] [Green Version]
  49. Kikelomo, A.A.; Asafe, Y.N.; Paul, A.; Olawale, L.N. Design and implementation of mobile map application for finding shortest direction between two pair locations using shortest path algorithm: A case study. Int. J. Adv. Netw. Appl. 2017, 9, 3300–3305. [Google Scholar]
  50. Zunic, E.; Hindija, H.; Besirevic, A.; Hodzic, K.; Delalic, S. Improving performance of vehicle routing algorithms using GPS data. In Proceedings of the 14th Symposium on Neural Networks and Applications (NEUREL), Belgrade, Serbia, 20–21 November 2018; pp. 1–4. [Google Scholar] [CrossRef]
  51. Jose, D.; Prasad, S.; Sridhar, V. Intelligent vehicle monitoring using global positioning system and cloud computing. Procedia Comput. Sci. 2015, 50, 440–446. [Google Scholar] [CrossRef] [Green Version]
  52. Li, R.; Cheng, C.; Qi, M.; Lai, W. Design of dynamic vehicle routing system based on online map service. In Proceedings of the 2016 13th International Conference on Service Systems and Service Management (ICSSSM), Kunming, China, 24–26 June 2016; pp. 1–5. [Google Scholar] [CrossRef]
  53. Zambrano-Vega, C.; Acosta, G.; Loor, J.; Suárez, B.; Jaramillo, C.; Oviedo, B. A sales route optimization mobile application applying a genetic algorithm and the Google Maps navigation system. In Proceedings of the Information Technology and Systems. ICITS 2019, Quito, Ecuador, 6–8 February 2019; Rocha, Á., Ferrás, C., Paredes, M., Eds.; Advances in Intelligent Systems and Computing. Springer: Cham, Switzerland, 2019; Volume 918, pp. 517–527. [Google Scholar] [CrossRef]
  54. Pfoser, D.; Efentakis, A.; Wenk, C. Exploiting Road Network Properties in Effiient Shortest-Path Computation; International Computer Science Institute: Berkley, CA, USA, 2009; Available online: http://www.icsi.berkeley.edu/pubs/techreports/TR-09-007.pdf (accessed on 9 August 2021).
  55. Shahrier, M.; Hasnat, A. Route optimization issues and initiatives in Bangladesh: The context of regional significance. Transp. Eng. 2021, 4, 100054. [Google Scholar] [CrossRef]
  56. Gregor, T.; Krajčovič, M.; Więcek, D. Smart connected logistics. Procedia Eng. 2017, 192, 265–270. [Google Scholar] [CrossRef]
  57. Corner, R.J.; Dewan, A.M. Introduction in Dhaka Megacity: Geospatial Perspectives on Urbanisation, Environment and Health; Springer: New York, NY, USA, 2014; pp. 1–22. [Google Scholar]
  58. Khan, S.M.; Hoque, M.S. Traffic flow interruptions in Dhaka city: Is smooth traffic flow possible? J. Precidency Univ. 2013, 2, 46–54. [Google Scholar]
  59. Swapan, M.S.H.; Zaman, A.U.; Ahsan, T.; Ahmed, F. Transforming urban dichotomies and challenges of South Asian megacities: Rethinking sustainable growth of Dhaka, Bangladesh. Urban Sci. 2017, 1, 31. [Google Scholar] [CrossRef] [Green Version]
  60. Islam, S. Banglapedia—The National Encyclopedia of Bangladesh; Dhaka City Corporation: Dhaka, Bangladesh, 2012. [Google Scholar]
  61. Zagetdoo. Available online: https://www.zagetdoo.com/vehicle-routing (accessed on 4 June 2021).
  62. Maciejewski, M.; Bischoff, J.; Hörl, S.; Nagel, K. Towards a testbed for dynamic vehicle routing algorithms. In Proceedings of the Highlights of Practical Applications of Cyber-Physical Multi-Agent Systems, PAAMS 2017, Porto, Portugal, 21–23 June 2017; Bajo, J., Vale, Z., Hallenborg, K., Rocha, A.P., Mathieu, P., Pawlewski, P., Del Val, E., Novais, P., Lopes, F., Duque Méndez, N.D., et al., Eds.; Communications in Computer and Information Science. Springer: Cham, Switzerland, 2017; Volume 722. [Google Scholar] [CrossRef] [Green Version]
  63. Debnath, B.; Hossain, A.; Zefat, Z.M.; Rahman, M.A. An intelligent approach of vehicle routing of Super Shop Shawpno. In Proceedings of the International Conference on Mechanical, Industrial and Energy Engineering (ICMIE), Khulna, Bangladesh, 19–21 December 2020. [Google Scholar]
  64. Barceló, J.; Grzybowska, H.; Pardo, S. Vehicle routing and scheduling models, simulation and city logistics. In Dynamic Fleet Management; Zeimpekis, V., Tarantilis, C.D., Giaglis, G.M., Minis, I., Eds.; Operations Research/Computer Science Interfaces Series; Springer: Boston, MA, USA, 2007; Volume 38. [Google Scholar] [CrossRef] [Green Version]
  65. Suresh, S.; Renukappa, S.; Abdul-Aziz, A.-R.; Paloo, Y.; Jallow, H. Developments in the UK road transport from a smart cities perspective. Eng. Constr. Arch. Manag. 2021, 28, 845–862. [Google Scholar] [CrossRef]
  66. Di Nardo, M. Developing a conceptual framework model of Industry 4.0 for industrial management. Ind. Eng. Manag. Syst. 2020, 19, 551–560. [Google Scholar] [CrossRef]
  67. Nardo, M.; Forino, D.; Murino, T. The evolution of man–machine interaction: The role of human in Industry 4.0 paradigm. Prod. Manuf. Res. 2020, 8, 20–34. [Google Scholar] [CrossRef] [Green Version]
  68. Global Mobile App Revenue 2021. Available online: https://0-www-statista-com.brum.beds.ac.uk/statistics/269024/ (accessed on 26 May 2021).
  69. Holzer, A.; Ondrus, J. Trends in mobile application development. In Proceedings of the Mobile Wireless Middleware, Operating Systems, and Applications—Workshops, MOBILWARE 2009, Berlin, Germany, 28–29 April 2009; Hesselman, C., Giannelli, C., Eds.; Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer: Berlin/Heidelberg, Germany, 2009; Volume 12. [Google Scholar] [CrossRef] [Green Version]
  70. Pon, B.; Seppälä, T.; Kenney, M. Android and the demise of operating system-based power: Firm strategy and platform control in the post-PC world. Telecommun. Policy 2014, 38, 979–991. [Google Scholar] [CrossRef]
  71. Gandhewar, N.; Sheikh, R. Google Android: An Emerging Software Platform for Mobile Devices. Available online: https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.637.3019&rep=rep1&type=pdf (accessed on 9 August 2021).
  72. Morón, M.J.; Luque, R.; Casilari, E. On the capability of smartphones to perform as communication gateways in medical wireless personal area networks. Sensors 2014, 14, 575–594. [Google Scholar] [CrossRef]
  73. Android Studio. Available online: https://developer.android.com/studio (accessed on 26 May 2021).
  74. Cormen, T.H.; Leiserson, C.E.; Rivest, R.L.; Stein, C. Introduction to Algorithms, 2nd ed.; The MIT Press: Cambridge, MA, USA, 2001. [Google Scholar]
  75. Geographic Information Technology Training Alliance. Available online: http://www.gitta.info/Accessibiliti/en/html/Dijkstra_learningObject1.html (accessed on 18 June 2021).
  76. Rietveld, P.; Zwart, B.; van Wee, B.; Hoorn, T.V.D. On the relationship between travel time and travel distance of commuters. Ann. Reg. Sci. 1999, 33, 269–287. [Google Scholar] [CrossRef] [Green Version]
Figure 1. IoT-assisted intelligent logistics transportation management framework [10].
Figure 1. IoT-assisted intelligent logistics transportation management framework [10].
Logistics 05 00063 g001
Figure 2. (a) Structure of the block density model [27] (b) Vehicular Cyber Physical System (VCPS) [37] (c) Spreadsheet structure of VRP Spreadsheet Solver [38].
Figure 2. (a) Structure of the block density model [27] (b) Vehicular Cyber Physical System (VCPS) [37] (c) Spreadsheet structure of VRP Spreadsheet Solver [38].
Logistics 05 00063 g002
Figure 3. Daily demand of 87 stores for two different commodities of rice and pulse.
Figure 3. Daily demand of 87 stores for two different commodities of rice and pulse.
Logistics 05 00063 g003
Figure 4. Vehicle coverage area allocation for Region-1 and Region-2 as shown in the map of Dhaka city.
Figure 4. Vehicle coverage area allocation for Region-1 and Region-2 as shown in the map of Dhaka city.
Logistics 05 00063 g004
Figure 5. (a) Vehicle Routing Add-On features (b) delivery worksheet options in the vehicle routing solver.
Figure 5. (a) Vehicle Routing Add-On features (b) delivery worksheet options in the vehicle routing solver.
Logistics 05 00063 g005
Figure 6. (a) Scheduling (b) Navigation sequencing of vehicle 1 and 2 for Region-1.
Figure 6. (a) Scheduling (b) Navigation sequencing of vehicle 1 and 2 for Region-1.
Logistics 05 00063 g006
Figure 7. (a) Scheduling (b) Navigation sequencing of vehicles 3 and 4 in Region-2.
Figure 7. (a) Scheduling (b) Navigation sequencing of vehicles 3 and 4 in Region-2.
Logistics 05 00063 g007
Figure 8. Intelligent vehicle routing optimization process flow.
Figure 8. Intelligent vehicle routing optimization process flow.
Logistics 05 00063 g008
Figure 9. Overview of intelligent route optimizer showing (a) icon of the application (b) user application interface (c) current user location on the Google map.
Figure 9. Overview of intelligent route optimizer showing (a) icon of the application (b) user application interface (c) current user location on the Google map.
Logistics 05 00063 g009
Figure 10. Illustration of (a) operation flowchart of intelligent route optimizer (b) journey routing showing optimum and alternate route option on Google Map (c) information showing distance and time of optimum and alternate routing to reach outlet two.
Figure 10. Illustration of (a) operation flowchart of intelligent route optimizer (b) journey routing showing optimum and alternate route option on Google Map (c) information showing distance and time of optimum and alternate routing to reach outlet two.
Logistics 05 00063 g010
Figure 11. Comparison of total traveling distance and time.
Figure 11. Comparison of total traveling distance and time.
Logistics 05 00063 g011
Figure 12. (a) Empirical relationship between traveled distance and time before and after using the intelligent routing optimizer (b) non-linear correlation of distance and time showing optimum routing (16.3 km, 48 min) and alternate routing (16.3 km, 53 min).
Figure 12. (a) Empirical relationship between traveled distance and time before and after using the intelligent routing optimizer (b) non-linear correlation of distance and time showing optimum routing (16.3 km, 48 min) and alternate routing (16.3 km, 53 min).
Logistics 05 00063 g012
Figure 13. Percent reductions of distance and time for (a) each individual vehicle; (b) each region.
Figure 13. Percent reductions of distance and time for (a) each individual vehicle; (b) each region.
Logistics 05 00063 g013
Table 1. Depot (Warehouse) and Delivery Locations (Outlet) information in Region-1 for assignment of vehicles 1 and 2.
Table 1. Depot (Warehouse) and Delivery Locations (Outlet) information in Region-1 for assignment of vehicles 1 and 2.
Store IDLatitudeLongitudeAddressPostal CodeORDER IDRice (kg)Pulse (kg)Total (kg)
(Region-1)
Depot (D)23.767990.4039Novo Tower, 270, Tejgaon Industrial Area1208
Outlet 123.863990.3971Plot-32/D&E, Nator Tower, RD-02, Sector-03, Uttara1230Order 115005002000
Outlet 223.81490.3237Plot # 27, Road # 02, Sector # 11, Uttara.1230Order 25000500
Outlet 323.881890.3886House-12, Road-12, Sector-10, Uttara1230Order 310005001500
Outlet 423.845890.41791–18, Kawla Bazar, Civil Avn Mkt, Dakshinkhan1229Order 4500200700
Outlet 523.83490.4154House-1/C, 1/D, Road-16, Nikunja-2, Khilkhet1229Order 5500300800
Outlet 623.764790.4291House- 14 & 30-B, Blk-B, North Banasree, Rampura1219Order 615005002000
Outlet 723.764690.4291Block-K, South Banasree, Rampura1219Order 710002001200
Outlet 823.72990.42953/2, Sky view Plaza, Mugdapara, Sabujbagh1219Order 815005002000
Outlet 923.761290.4293House-12, H Avenue Rd No-08, Rampura, Banasree1219Order 9600200800
Outlet 1023.809890.3865Shop-05, Plot-60, RD-07, Banasree, Rampura1219Order 105000500
Total9100290012,000
Table 2. Depot (Warehouse) and Delivery Locations (Outlet) information in Region-2 for assignment of vehicle 3 and 4.
Table 2. Depot (Warehouse) and Delivery Locations (Outlet) information in Region-2 for assignment of vehicle 3 and 4.
Store IDLatitudeLongitudeAddressPostal CodeORDER IDRice (kg)Pulse (kg)Total (kg)
(Region-2)
Depot (D)23.767990.4039Novo Tower, 270, Tejgaon Industrial Area1208
Outlet 1123.798690.3706544/2-C, Kazipara, Mirpur1216Order 18002001000
Outlet 1223.798690.3654558 East Kazipara, Mirpur1216Order 27003001000
Outlet 1323.796390.35133/A, City Centre, Darussalam RD, Mirpur-011216Order 310005001500
Outlet 1423.798690.36541/2 Arsin Gate, Eastern Housing Society1216Order 4600100700
Outlet 1523.774390.3578Plot-01, Dhaka Housing Ring Road, Shamoli1207Order 5300200500
Outlet 1623.768390.348129, Kaderabad Housing, Katasur, Mohammadpur1207Order 616004002000
Outlet 1723.762190.355904, Mohammadi Housing Ltd., Mohammadpur1207Order 715005002000
Outlet 1823.762190.349320/11, Tajmohal Road, Block C, Mohammadpur1207Order 810002001200
Outlet 1923.752790.372455–2, Qazi Nuruzzaman Sarak, West Panthapath1205Order 9700100800
Outlet 2023.739690.363168/C, Jigatala, Dhanmondi, Dhaka-1209.1209Order 10600200800
Total8800270011,500
Table 3. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 1.
Table 3. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 1.
Location NameDistance
(Before) (km)
Distance (After) (km)Reduction in
Distance (km)
Time (Before) (min)Time (After) (min)Reduction in Time (min)
Depot0.00.00.00.00.00.0
Outlet 210.09.20.853.040.013.0
Outlet 108.78.10.643.034.09.0
Outlet 57.07.00.027.023.04.0
Outlet 36.26.00.224.022.02.0
Outlet 13.33.10.212.010.02.0
Outlet 43.02.50.511.09.02.0
Depot7.56.21.325.022.03.0
Table 4. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 2.
Table 4. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 2.
Location NameDistance
(Before) (km)
Distance
(After) (km)
Reduction in
Distance (km)
Time (Before) (min)Time (After) (min)Reduction in Time (min)
Depot0.00.00.00.00.00.0
Outlet 88.17.40.749.038.011.0
Outlet 95.55.10.441.032.09.0
Outlet 73.02.50.520.014.06.0
Outlet 62.82.30.517.014.03.0
Depot5.05.00.025.019.06.0
Table 5. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 3.
Table 5. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 3.
Location NameDistance (Before) (km)Distance (After) (km)Reduction
in Distance
(km)
Time (Before) (min)Time (After) (min)Reduction
in Time
(min)
Depot0.00.00.00.00.00.0
Outlet 166.46.10.331.028.03.0
Outlet 182.11.60.512.09.03.0
Outlet 171.21.00.28.08.00.0
Outlet 203.43.00.423.020.03.0
Depot7.07.00.042.038.04.0
Table 6. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 4.
Table 6. Traveling distance before and after using the Intelligent Route Optimizer application for vehicle 4.
Location NameDistance (Before) (km)Distance (After) (km)Reduction in Distance (km)Time (Before) (min)Time (After) (min)Reduction in Time (min)
Depot0.00.00.00.00.00.0
Outlet 116.56.10.434.030.04.0
Outlet 144.23.40.820.015.05.0
Outlet 124.13.11.021.015.06.0
Outlet 133.02.40.615.013.02.0
Outlet 154.13.01.126.021.05.0
Outlet 194.03.60.430.027.03.0
Depot4.23.80.431.025.06.0
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Rahman, M.A.; Hossain, A.-A.; Debnath, B.; Zefat, Z.M.; Morshed, M.S.; Adnan, Z.H. Intelligent Vehicle Scheduling and Routing for a Chain of Retail Stores: A Case Study of Dhaka, Bangladesh. Logistics 2021, 5, 63. https://0-doi-org.brum.beds.ac.uk/10.3390/logistics5030063

AMA Style

Rahman MA, Hossain A-A, Debnath B, Zefat ZM, Morshed MS, Adnan ZH. Intelligent Vehicle Scheduling and Routing for a Chain of Retail Stores: A Case Study of Dhaka, Bangladesh. Logistics. 2021; 5(3):63. https://0-doi-org.brum.beds.ac.uk/10.3390/logistics5030063

Chicago/Turabian Style

Rahman, M. Azizur, Al-Amin Hossain, Binoy Debnath, Zinnat Mahmud Zefat, Mohammad Sarwar Morshed, and Ziaul Haq Adnan. 2021. "Intelligent Vehicle Scheduling and Routing for a Chain of Retail Stores: A Case Study of Dhaka, Bangladesh" Logistics 5, no. 3: 63. https://0-doi-org.brum.beds.ac.uk/10.3390/logistics5030063

Article Metrics

Back to TopTop