A logistics vehicle scheduling method for finished cigarettes considering short-term and low-cost
A technology for finished cigarettes and logistics vehicles, applied in the direction of logistics, calculation, genetic rules, etc., can solve problems such as scheduling, unreasonable, and unreasonable, and achieve the effect of realizing scheduling knowledge
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0077] The required hardware is a handheld barcode scanner and computing server, and the service configuration is an Intel Core(TM) i7-9750H 2.59GHz processor, 16G memory, and a 64-bit operating system. Based on actual data, the present invention establishes a finished cigarette logistics vehicle dispatching model that takes into account short-term low cost, saves transportation costs, and improves dispatching efficiency and quality.
[0078] The logistics vehicle scheduling method for finished cigarettes based on cigarette industrial enterprises described in the present invention, the specific implementation steps are as follows: Step 1. In a certain distribution scheduling period, comprehensively consider the transportation route, inventory balance
[0079] structure, vehicle load, shipping point
[0080] Operational capability, and the time window consisting of the required arrival date of the order and the time limit of the permit, establish a multi-target finished cigaret...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



