Container swap trailer transportation routing problem based on genetic algorithm

DOI10.1155/2018/6523764MaRDI QIDQ1721272zbMATH OpenOpenAlexWikidataFDO

Authors Lei Tao, Xiao-xuan Hu, Hua-Wei Ma

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/6523764

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: In swap trailer transportation routing problems, trucks and trailers conduct swap operations at special positions called trailer points. The parallelization of stevedoring and transportation can be achieved by means of these trailer points. This logistics organization mode can be more effective than the others. In this paper, an integer programming model with capacity and time-window constraints was established. A repairing strategy is embedded in the genetic algorithm (GA) to solve the model. The repairing strategy is executed after the crossover and mutation operation to eliminate the illegal routes. Furthermore, a parameter self-adaptive adjustment policy is designed to improve the convergence. Then numerical experiments are implemented based on the generated datasets; the performance and robustness of the algorithm parameter self-adaptive adjustment policy are discussed. Finally, the results show that the improved algorithm performs better than elementary GA.

Recommendations

• Solution to chance constrained programming problem in swap trailer transport organisation based on improved simulated annealing algorithm
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
• Ship routing using genetic algorithms
• Vehicle routing problem with trailers
• A united optimization of craned scheduling and yard trailer routing in a container terminal

Cites work

• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• A survey on two-echelon routing problems
• A tabu search heuristic for the truck and trailer routing problem
• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• Truck and trailer routing -- problems, heuristics and computational experience

Cited in

(3)

• Solution to chance constrained programming problem in swap trailer transport organisation based on improved simulated annealing algorithm
• An improved self-organizing genetic algorithm for optimizing container transportation routing problems under times windows
• The container transshipment problem: searching representation landscapes with metaheuristic algorithms

This page was built for publication: Container swap trailer transportation routing problem based on genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721272)