Open AccessModeling and Solution Algorithm for Fourth-Party Logistics Routing Problem Based on Service Composition
Author(s) -
Xiaochuan Min,
Fanchao Meng,
Dian-Hui Chu,
Lei Wang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1584/1/012030
Subject(s) - crossover , computer science , genetic algorithm , dijkstra's algorithm , mathematical optimization , backtracking , vehicle routing problem , service (business) , ant colony optimization algorithms , algorithm , operations research , routing (electronic design automation) , shortest path problem , mathematics , artificial intelligence , graph , theoretical computer science , machine learning , computer network , economy , economics
Aiming at the problems of limited transportation resources and high transportation costs of a single third-party logistics supplier, our research proposes a route planning model based on service combination from the perspective of fourth-party logistics, which aims to find the route with minimum total cost under the premise of meeting customer needs. In order to improve solution efficiency, a specific genetic algorithm is designed. The algorithm adopts backtracking idea and adaptive operations, which can avoid infeasible solution caused by strict constraints, while reducing the time required for crossover and mutation operations to repair infeasible solutions. In addition, Dijkstra-based heuristic algorithm, traditional genetic algorithm and traditional ant colony algorithm are implemented. The comparison of computational experiments on different scales instances shows that the specific genetic algorithm can obtain the optimal solution in small-scale instances, and the solution quality in large-scale problems is better than other algorithms.