Vehicle routing and scheduling with time windows

1986 ◽  
pp. 249-251 ◽  
Author(s):  
J. Desrosiers ◽  
F. Soumis ◽  
M. Desrochers ◽  
M. Sauvé
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling

scholarly journals Vehicle Routing and Scheduling Optimization of Ship Steel Distribution Center under Green Shipbuilding Mode

2019 ◽  
Vol 11 (15) ◽  
pp. 4248 ◽  
Author(s):  
Jinghua Li ◽  
Hui Guo ◽  
Qinghua Zhou ◽  
Boxin Yang
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Water Drop ◽  
Time Windows ◽  
Mixed Integer ◽  
Distribution Centers ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Distribution Process ◽  
The Cost

Timeliness of steel distribution centers can effectively ensure the smooth progress of ship construction, but the carbon emissions of vehicles in the distribution process are also a major source of pollution. Therefore, when considering the common cost of vehicle distribution, taking the carbon emissions of vehicles into account, this paper establishes a Mixed Integer Linear Programming (MILP) model called green vehicle routing and scheduling problem with simultaneous pickups and deliveries and time windows (GVRSP-SPDTW). An intelligent water drop algorithm is designed and improved, and compared with the genetic algorithm and traditional intelligent water drop algorithm. The applicability of the improved intelligent water drop algorithm is proven. Finally, it is applied to a specific example to prove that the improved intelligent water drop algorithm can effectively reduce the cost of such problems, thereby reducing the carbon emissions of vehicles in the distribution process, achieving the goals of reducing environmental pollution and green shipbuilding.

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.

scholarly journals Green Vehicle Routing and Scheduling Optimization of Ship Steel Distribution Center Based on Improved Intelligent Water Drop Algorithms

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Gang Chen ◽  
Xiaoyuan Wu ◽  
Jinghua Li ◽  
Hui Guo
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Water Drop ◽  
Time Windows ◽  
Distribution Center ◽  
Problem Model ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Distribution Process ◽  
The Cost

The timeliness of the steel distribution center process contributes to the smooth progress of ship construction. However, carbon emissions from vehicles in the distribution process are a major source of pollution. Reasonable vehicle routing and scheduling can effectively reduce the carbon emissions of vehicles and ensure the timeliness of distribution. To solve this problem, a green vehicle routing and scheduling problem model with soft time windows was proposed in this study. An intelligent water drop algorithm was designed and improved and then compared with the genetic algorithm and the traditional intelligent water drop algorithm. The applicability of the improved intelligent water drop algorithm was demonstrated. Finally, this algorithm was applied to a specific example to demonstrate that the improved intelligent water drop algorithm effectively reduced the cost of such green vehicle problems, thus reducing the carbon emissions of vehicles during the distribution process and achieving reductions in environmental pollution. Ultimately, this algorithm facilitates the achievement of green shipbuilding.

Sign in / Sign up

Export Citation Format

Share Document