Research on Open Vehicle Routing Problem based on Multi-Objective and Multi-Constrain Genetic Algorithm
Description
With the advancement of urbanization, the efficiency of take-out delivery has become one of the focuses of urban residents. In order to comprehensively meet the needs of both the delivery system managers and the delivery customers, this paper designs a multiobjective and constraint linear programming model that takes into account the minimum total cost of delivery and is based on the timeliness of delivery to maximize customer satisfaction. At the same time, considering the high concurrency of customers' demands for delivery, this paper designs a set of multi-objective multi-constraint genetic algorithm based on the control evolution direction, which is carried out in feasible domain first, and then to the optimal solution, and elaborates the constraint control evolution operator and sorting operator. Finally, an example is given to verify the feasibility and effectiveness of the algorithm, and a new efficient solution method is proposed for the delivery route planning problem. (paper)
Availability note (English)
Available from http://dx.doi.org/10.1088/1742-6596/1972/1/012062Additional details
Identifiers
Publishing Information
- Journal Title
- Journal of Physics. Conference Series (Online)
- Journal Volume
- 1972
- Journal Issue
- 1
- Journal Page Range
- [14 p.]
- ISSN
- 1742-6596
Conference
- Title
- International Conference on Internet of Things and Smart City
- Acronym
- IoTSC 2021
- Dates
- 4-6 Jun 2021
- Place
- Kunming (China)
INIS
- Country of Publication
- United Kingdom
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 53103697
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING; S42: ENGINEERING;
- Resource subtype / Literary indicator
- Conference
- Descriptors DEI
- CONTROL; DESIGN; EFFICIENCY; GENETIC ALGORITHMS; LINEAR PROGRAMMING; ROUTING; TIME DELAY
- Descriptors DEC
- ALGORITHMS; CALCULATION METHODS; MATHEMATICAL LOGIC