Please use this identifier to cite or link to this item:
Title: Strategic crossdocking with inventory and time window consideration
Authors: CHEN PING
Keywords: Crossdocking, NP-Complete, Integer Programming, Simulated Annealing, Tabu Search
Issue Date: 21-Jul-2004
Citation: CHEN PING (2004-07-21). Strategic crossdocking with inventory and time window consideration. ScholarBank@NUS Repository.
Abstract: Crossdocking is a flow-through distribution, moving products directly from inbound to outbound vehicles with limited or no storage in between. In this thesis, we investigate how to implement a crossdocking system with inventory and time window consideration efficiently and effectively. The problem we are facing is proven to be NP-Complete in the strong sense. The linear-programming package CPLEX reaches its limits of computational time and memory usage soon when solving such a complex problem. We propose several heuristic algorithms to tackle the problem, including Simulated Annealing and Tabu Search. And extensive experiments conducted show favorable results for our heuristic algorithms.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ChenP.pdf466.78 kBAdobe PDF



Page view(s)

checked on May 23, 2019


checked on May 23, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.