Truck scheduling in multi-door cross docking terminal by modified particle swarm optimization
© 2017 Elsevier Ltd In today's distribution environment, one of the main strategies is to minimize cost by reducing inventory and timely shipments. Cross docking is a logistic management strategy in which products delivered to a distribution center by inbound trucks are immediately loaded to ou...
Saved in:
Main Authors: | , |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85009487446&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57044 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Summary: | © 2017 Elsevier Ltd In today's distribution environment, one of the main strategies is to minimize cost by reducing inventory and timely shipments. Cross docking is a logistic management strategy in which products delivered to a distribution center by inbound trucks are immediately loaded to outbound trucks with minimum handling and storage time so that the total cost can be reduced. In a multi-door cross docking terminal, one of the most important operational management problems is the truck scheduling problem which is decomposed to the assignment of trucks to dock doors and the sequence of all inbound and outbound trucks. In this paper, a mathematical model of mixed integer programming for door assigning and truck sequencing in a multi-door cross docking system is presented. The objective of the model is to minimize total operational time or makespan. Then, the modified particle swarm optimization, so called GLNPSO, is proposed with particular encoding and decoding schemes for solving the truck scheduling problem in a multi-door cross docking system. The performances of GLNPSO are evaluated and compared the results with those obtained from the original PSO. The experimental results show that the GLNPSO is capable of finding high quality solutions with fast convergence. |
---|