scholarly journals Evaluation of the effects of e-commerce on urban freight transport by applying models of pickup and delivery vehicle routing and scheduling problem with time windows

2009 ◽  
Vol 26 (0) ◽  
pp. 725-730
Author(s):  
Kenji TAKAI ◽  
Eiichi TANIGUCHI ◽  
Tadashi YAMADA
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Freight Transport ◽  
Pickup And Delivery ◽  
Scheduling Problem ◽  
Delivery Vehicle ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Urban Freight ◽  
Urban Freight Transport

scholarly journals NEW VERSION OF THE BBS METHOD AND ITS USAGE FOR DETERMINING AND SCHEDULING VEHICLE ROUTES

2014 ◽  
Vol 31 (3) ◽  
pp. 83-91 ◽  
Author(s):  
Andrzej Wolfenburg
Keyword(s):  
Vehicle Routing ◽  
Branch And Bound ◽  
Time Windows ◽  
Simulation Method ◽  
Pickup And Delivery ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Multiple Orders ◽  
Vehicle Loads ◽  
Vehicle Routes

The work presents a method of the vehicle routing and scheduling using the modified Branch and Bound Simulation method for vehicles simultaneously carrying loads from multiple orders. Limitations concerning vehicle loads and time windows in pickup and delivery points are taken into consideration. The developed algorithm appoints the shortest, the fastest and the cheapest routes with a certain known accuracy. A modification of the BBS method is described A sample of result using Google API is shown.

A Vehicle Routing and Scheduling Model for a Distribution Center

2010 ◽  
pp. 334-366 ◽  
Author(s):  
Hsiao-Fan Wang
Keyword(s):  
Vehicle Routing ◽  
Efficient Solution ◽  
Structural Model ◽  
Time Windows ◽  
Distribution Center ◽  
Multiple Time ◽  
Scheduling Problem ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Operation Cost

One key role along green supply chain is the distribution center which has the responsibility to deliver the commodities to the customers and collect the end-used products back to the center for further process. This activity requires a distributor to determine how many vehicles with what sizes along which routes to deliver commodities so that the demands from all customers will be satisfied within customers’ available time with minimum operation cost. This problem can be classified into a vehicle routing and scheduling problem with multiple vehicle types and service time windows. In practice, the complexity of the problem requires a structural model to facilitate general analysis and applications. However, also because of its complexity, an efficient solution procedure is equivalently important. Therefore, in this study, we have first developed a model for a distribution center to support the decisions on vehicle types and numbers; as well as the routing route and schedule so that the overall operation cost will be minimized. Since this model of vehicle routing and scheduling problem with multiple vehicle types and multiple time windows (VRSP-MVMT) is a nondeterministic polynomial time (NP)-hard problem, we have developed a genetic algorithm (GA) for efficient solution. The efficiency and accuracy of the algorithm will be evaluated and illustrated with numerical examples.

Sign in / Sign up

Export Citation Format

Share Document