A Task Conflict Detection Model of Logistics Distribution

2012 ◽  
Vol 452-453 ◽  
pp. 736-740
Author(s):  
Qing Kui Cao ◽  
Qian Zhang
Keyword(s):  
Time Window ◽  
Time Windows ◽  
Distribution Center ◽  
Task Conflict ◽  
Scheduling Problem ◽  
Temporal Constraint ◽  
Logistics Distribution ◽  
Detection Model ◽  
Constraint Network ◽  
Multiple Tasks

Based on the time window in the vehicle scheduling problem(VSP), we propose the concept of time windows of delivery tasks(TWDT) in the distribution center, and describe the TWDT in a kind of three-tuple. Transferring time windows constraint of multiple tasks to a simple temporal constraint network, we simplify the problem of checking the time constraint of multiple tasks to the problem of checking the temporal constraint network’s consistency. According to the characteristic of delivery task and simple temporal constraint network, we proposed the model of time window conflict checking of delivery task.

Optimized Vehicle Scheduling Algorithm of Distribution Center

2013 ◽  
Vol 340 ◽  
pp. 581-586
Author(s):  
Zhu Wang
Keyword(s):  
Mathematical Model ◽  
Scheduling Algorithm ◽  
Time Windows ◽  
Distribution Center ◽  
Vehicle Scheduling ◽  
Scheduling Problem ◽  
Research Results ◽  
Logistics Distribution ◽  
The Mathematical Model

This thesis goes deep into the vehicle scheduling problem (VSP), which is the key problem for the distribution center.This paper analyzes and optimizes the mathematical model of vehicle scheduling problem. The problem of dynamic vehicle scheduling with time windows is described in great details in the thesis, which also gives an arithmetic solution aiming at the scheduling problem.Finally, based on the research results and under the background of logistics distribution enterprises, the vehicle scheduling algorithm is exposed to experiment.

Study on Delivery of Perishable Products in Retail Enterprise's Distribution Center

2013 ◽  
Vol 438-439 ◽  
pp. 1979-1982
Author(s):  
Fei Wei ◽  
Zheng Yi Ge ◽  
Zhi Wei Zhang
Keyword(s):  
Service Time ◽  
Time Windows ◽  
Distribution Center ◽  
Perishable Products ◽  
Scheduling Problem ◽  
Distribution Centers ◽  
Ant System ◽  
Distribution Costs ◽  
Hard Time ◽  
Perishable Goods

According to the delivery situation of perishable products in retail enterprises distribution centers, considering a service time limit, the paper establishes a model and applies max-min ant system to solve vehicle scheduling problem with hard time windows to minimize distribution costs of perishable goods. Besides, the paper uses a case to demonstrate the feasibility of this model.

scholarly journals Self-Correction Ship Tracking and Counting with Variable Time Window Based on YOLOv3

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Chun Liu ◽  
Jian Li
Keyword(s):  
Time Window ◽  
Time Windows ◽  
Target Object ◽  
Variable Time ◽  
Ship Detection ◽  
Detection Model ◽  
Maritime Surveillance ◽  
Model Training ◽  
Direction Judgment ◽  
Deep Learning Model

Automatic ship detection, recognition, and counting are crucial for intelligent maritime surveillance, timely ocean rescue, and computer-aided decision-making. YOLOv3 pretraining model is used for model training with sample images for ship detection. The ship detection model is built by adjusting and optimizing parameters. Combining the target HSV color histogram features and LBP local features’ target, object recognition and selection are realized by using the deep learning model due to its efficiency in extracting object characteristics. Since tracking targets are subject to drift and jitter, a self-correction network that composites both direction judgment based on regression and target counting method with variable time windows is designed, which better realizes automatic detection, tracking, and self-correction of moving object numbers in water. The method in this paper shows stability and robustness, applicable to the automatic analysis of waterway videos and statistics extraction.

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.

An Improved Bat Algorithm and its Application in the Logistics Distribution Center Location Problem

2013 ◽  
Vol 404 ◽  
pp. 738-743
Author(s):  
Yue Guang Li
Keyword(s):  
Mathematical Model ◽  
Location Problem ◽  
Time Window ◽  
Influence Factors ◽  
Bat Algorithm ◽  
Distribution Center ◽  
Center Problem ◽  
Logistics Distribution ◽  
Distribution Logistics ◽  
Selection Operator

In this paper, according to the characteristics and influence factors of the distribution logistics and distribution center problem, a mathematical model of the distribution center of the LRTWP (Location and Routing with Time Window Problem) was established. An improved bat algorithm was used to solve the model, the parameter and selection operator in the algorithm is set reasonably. Simulations and results indicate that the improved bat algorithm has better feasibility and validity for solving the LRTWP.

scholarly journals MULTI-OBJECTIVE DISTRIBUTION ROUTING OPTIMIZATION WITH TIME WINDOW BASED ON IMPROVED GENETIC ALGORITHM

2018 ◽  
Vol 48 (3) ◽  
pp. 151-156
Author(s):  
S. WU ◽  
C. CHEN
Keyword(s):  
Genetic Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Population Diversity ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Logistics Distribution ◽  
Routing Optimization

In order to solve the shortcomings of the traditional genetic algorithm in solving the problem of logistics distribution path, a modified genetic algorithm is proposed to solve the Vehicle Routing Problem with Time Windows (VRPTW) under the condition of vehicle load and time window. In the crossover process, the best genes can be preserved to reduce the inferior individuals resulting from the crossover, thus improving the convergence speed of the algorithm. A mutation operation is designed to ensure the population diversity of the algorithm, reduce the generation of infeasible solutions, and improve the global search ability of the algorithm. The algorithm is implemented on Matlab 2016a. The example shows that the improved genetic algorithm reduces the transportation cost by about 10% compared with the traditional genetic algorithm and can jump out of the local convergence and obtain the optimal solution, thus providing a more reasonable vehicle route.

Research of Vehicle Scheduling with Time Window Based on Genetic Algorithm

2013 ◽  
Vol 409-410 ◽  
pp. 1307-1310
Author(s):  
Xiao Rong Zhou ◽  
Meng Tian Song ◽  
Yu Ling Zhang
Keyword(s):  
Genetic Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Distribution Center ◽  
Optimal Scheduling ◽  
Vehicle Scheduling ◽  
Search Process ◽  
Long Distance ◽  
Soft Time Windows ◽  
Scheduling Model

This paper based on the genetic algorithm,introduced part search process and respectively established the mathematical scheduling model of full loads vehicle optimal scheduling with soft time windows and of non-full loads on the basis of the long distance logistics transportation situation of some companys distribution center in Shenzhen. Then programmed to achieve the scheduling of multi-vehicle touting and selection, and conducted example analysis.

An Improved Simulated Annealing Algorithm and its Application in the Logistics Distribution Center Location Problem

2013 ◽  
Vol 389 ◽  
pp. 990-994 ◽  
Author(s):  
Yue Guang Li
Keyword(s):  
Simulated Annealing ◽  
Location Problem ◽  
Simulated Annealing Algorithm ◽  
Time Window ◽  
Influence Factors ◽  
Distribution Center ◽  
Logistics Distribution ◽  
Distribution Logistics ◽  
Annealing Algorithm ◽  
Selection Operator

In this paper, according to the characteristics and influence factors of the distribution logistics and distribution center problem, a mathematical model of the distribution center of the LRTWP (Location and Routing with Time Window Problem) was established. An improved simulated annealing algorithm was used to solve the model, the parameter and selection operator in the algorithm is setted reasonably. Simulations and results indicate that the improved simulated annealing algorithm has better feasibility and validity for solving the LRTWP.

Sign in / Sign up

Export Citation Format

Share Document