Maximum-minimum ant colony optimization method and maximum-minimum ant colony optimization system for solving vehicle scheduling problem
A vehicle scheduling and optimization method technology, applied in the research field of vehicle scheduling, can solve problems such as algorithm search stagnation, and achieve the effects of good stability, strong global optimization ability, and good optimization performance.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0056] refer to figure 1 , a maximum-minimum ant colony algorithm for a vehicle scheduling problem without a time window includes the following steps:
[0057] Step 1: Determine cost-related cost information: fixed cost c for starting the vehicle, storage cost u for each customer point within the planning period, and fixed cost C for delivery from the distribution center to the customer point f , the unit transportation cost t from the distribution center to the customer point df , The fixed cost C of the delivery operation of the distribution center d , the loading capacity w of each distribution vehicle, and the unit transportation cost t between each customer point ij , the maximum number of iterations K_max of the outer layer of the iterative algorithm;
[0058] Step 2: Get delivery information from the order form. This information includes: customer name, total weight of goods required by the customer D i , the unloading address, the required arrival time, and the es...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com