Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules

Authors:
Zhaowei Miao;Ke Fu;Qi Fei;Fan Wang
Affiliations:
School of Management, Xiamen University, Fu Jian, China;Lingnan College, Sun Yat-sen University, Guangzhou, China;Department of IELM, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong,;School of Business, Sun Yat-Sen University, Guangzhou, China
Venue:
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Year:
2008

Citing 7
Cited 0

A survey of dynamic network flows

Annals of Operations Research
“The quickest transshipment problem”

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Reducing Labor Costs in an LTL Crossdocking Terminal

Operations Research
Sharing and Lateral Transshipment of Inventory in a Supply Chain with Expensive Low-Demand Items

Management Science
A New Decision Rule for Lateral Transshipments in Inventory Systems

Management Science
The Best Shape for a Crossdock

Transportation Science
Designing And Managing The Supply Chain

Designing And Managing The Supply Chain

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we develop an efficient meta-heuristic genetic algorithm for a different type of transshipment problem with supplier and customer time windows, where flow through the crossdock (a kind of transshipment center) is constrained by fixed transportation schedules and crossdocks capacities, and which was proved to be NP-complete in the strong sense. And computational experiments are conducted to show the proposed heuristic outperforms CPLEX.