Container Swap Trailer Transportation Routing Problem Based on Genetic Algorithm

Hua-wei Ma, Lei Tao and Xiao-xuan Hu

Mathematical Problems in Engineering, 2018, vol. 2018, 1-15

Abstract:

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.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/6523764.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/6523764.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6523764

DOI: 10.1155/2018/6523764

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().