A comparative study of different genetic algorithms approaches to capacitated vehicle routing problem for collection of agricultural products
A comparative study of different genetic algorithms approaches to capacitated vehicle routing problem for collection of agricultural products
Cosmin Sabo, Natanael Balogh, Petrică C. Pop, Adrian Petrovan
Abstract. In this study, we tackle a local collection challenge, employing VRP to address the problem of collecting fresh agricultural products from administrative territorial units. This paper proposes a comparative description of two solution approaches: a haploid genetic algorithm (HGA) and a pseudo-diploid genetic algorithm (P-DGA). We compare the achieved results by the considered genetic algorithms (GAs) on a set of benchmark instances existing from the literature, analyze their performance against state-of-the-art algorithms, and validate them on a second set of instances provided by the Maramureș County Directorate for Agriculture, that contains information regarding the production of tomatoes, onions, and garlic from the administrative units within Maramureș County.
Keywords: capacitated vehicle routing problem; haploid genetic algorithm; diploid genetic algorithm; agricultural products; Maramureș
📋 Cite this publication
Cosmin Sabo, Natanael Balogh, Petrică C. Pop, Adrian Petrovan, "A comparative study of different genetic algorithms approaches to capacitated vehicle routing problem for collection of agricultural products", Proc. 19th SOCO Int. Conf. on Soft Computing Models in Industrial and Environmental Applications, Springer, 2025, pp. 127–136, 2023. DOI: https://doi.org/10.1007/978-3-031-75010-6_13.
Reference: Proc. 19th SOCO Int. Conf. on Soft Computing Models in Industrial and Environmental Applications, Springer, 2025, pp. 127–136. DOI: 10.1007/978-3-031-75010-6_13
Solving the clustered minimum routing tree problem using Prüfer-coding based hybrid genetic algorithms
Solving the clustered minimum routing tree problem using Prüfer-coding based hybrid genetic...
Augmenting API Security Testing with Automated LLM-Driven Test Generation
Augmenting API Security Testing with Automated LLM-Driven Test GenerationEmil Marian Pasca, Rudolf...
Data Quality Assessment Methodology
Data Quality Assessment MethodologyDaniela Delinschi, Rudolf Erdei, Emil Pasca, Oliviu Matei...
Privacy Assessment Methodology for Machine Learning Models and Data Sources
Privacy Assessment Methodology for Machine Learning Models and Data SourcesRudolf Erdei, Emil...
Evaluation of Feature Selection Methods in Estimation of Precipitation Based on Deep Learning Artificial Neural Networks
Precipitation is the most important element of the water cycle and an indispensable element of water resources management. This paper aims to model the monthly precipitation in 8 precipitation observation stations. The effects and role of different feature weights pre-processing methods (Weight by deviation, Weight by PCA, Weight by correlation, and Weight by Support Vector Machine) on artificial intelligence modeling were investigated.
A Comparison of different crossover operators in genetic algorithms for clusters shortest-path tree problem
The clustered shortest-path tree (CluSPT) problem is an extension of the classical shortest path problem, given a graph with the nodes partitioned into several mutually exclusive and collectively exhaustive clusters looks for a shortest-path spanning tree from a predefined source node to all the other nodes of the graph, with the property that every cluster should generate a connected subgraph.
A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical traveling salesman
problem (TSP), and it is among the most researched combinatorial optimization problems due to its theoretical properties, complexity aspects, and real-life applications in various areas: location-routing problems, material flow design problem, distribution of medical supplies, urban waste collection management, airport selection and routing the courier airplanes, image retrieval and ranking, digital garment manufacturing, etc.
A hybrid based genetic algorithm for solving the clustered generalized traveling salesman problem
We study the clustered generalized traveling salesman problem (CGTSP), which is an extension of the generalized traveling salesman problem (GTSP), which in turn generalizes the well-known traveling salesman problem (TSP).
0 Comments