Jiacheng Li
ABSTRACT
In order to better solve the logistics distribution problems and improve customer satisfaction, aiming at minimizing total cost, the author adds a variable that restricts drivers' fatigue driving in the model, and builds a model of route optimization based on heterogeneous vehicles, so as to design a single-parent genetic algorithm for this model, and validates the algorithm by the delivery case of Japan Takkyubin Corporation. The numerical results of the example show that the logistics distribution route optimization scheme based on the single-parent genetic algorithm can meet the customer's cargo and time requirements, and can reduce vehicle use costs, save early or late penalty costs, and improve the company's economic interests. This study provides new solution ideas for improving delivery issues.
- Baker E K. Technical note-an exact algorithm for the time-constrained traveling salesman problem {J}, Operations Research, 1983, 31(5): 938--945. Google Scholar
Digital Library
- Solomon M M. Algorithms for the vehicle routing and scheduling problems with time window constraints {J}, Operations research, 1987, 35(2): 254--265.Google Scholar
- AWJ Kolen, Kan AHG Rinnooy and HWIM Trienekens. Vehicle Routing with Time Windows {J}, Operations Research, 1987(35): 266--273.Google Scholar
- Desrochers M, Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time windows {J}, Operations research, 1992, 40(2):342--354. Google ScholarDigital Library
- Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation {J}, Operations Research, 1997, 45(31): 395--406. Google ScholarDigital Library
- Hong SC, Park YB. A heuristic for bi-objective vehicle routing with time window constraints {J}, International Journal of Production Economics. 1999, 62(3):249--58.Google ScholarCross Ref
- Favarett D, Moretti E, Pellegrini P. Ant colony system for a VRP with multiple time window and multiple visitors {J}, Journal of Interdisciplinary Mathematics, 2007, 10(2):263--284.Google ScholarCross Ref
- Ceschina S, Di Gaspero L, Schaerf A. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs {J}, Journal of Scheduling, 2011, 14(6):601--615.Google ScholarCross Ref
- Lei HT, Laporte G. Guo B. The capacitated vehicle routing problem with stochastic demands and time windows {J}, Computers & Operations Research. 2011, 38(12):1775--83. Google ScholarDigital Library
- Belhaiza S, Hansen P; Laporte G A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows {J}, Computers & Operations Research. 2014, 52: 269--81. Google ScholarDigital Library
Index Terms
- Optimization of vehicle routing problem with fatigue driving based on genetic algorithm
Recommendations
Optimization of Heterogeneous Vehicle Routing Problem Using Genetic Algorithm in Courier Service
APCORISE '20: Proceedings of the 3rd Asia Pacific Conference on Research in Industrial and Systems EngineeringCurrent technological developments triggered the public to use e-commerce platforms as providers of transactions. This resulted in an increase in the courier service business for shipping goods to customers. The types of goods processed through courier ...
Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows
ICICCI '10: Proceedings of the 2010 International Conference on Intelligent Computing and Cognitive InformaticsVehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, we propose an improved genetic algorithm to solve the VRPTW problem. The ...
An Improved Genetic Algorithm for Vehicle Routing Problem with Time-Window
ISCSCT '08: Proceedings of the 2008 International Symposium on Computer Science and Computational Technology - Volume 01To overcome the common defects of early convergence in the existing genetic algorithm, an improved genetic algorithm with new crossover operator and new crossover strategy was presented for the solution to the vehicle routing problem with soft time ...
Comments