Efficient Design Of Inbound Logistics Networks
| dc.contributor.author | Dong, Zhijie | |
| dc.contributor.chair | Turnquist,Mark Alan | |
| dc.contributor.committeeMember | Topaloglu,Huseyin | |
| dc.contributor.committeeMember | Nozick,Linda K. | |
| dc.date.accessioned | 2015-10-15T18:02:44Z | |
| dc.date.available | 2015-10-15T18:02:44Z | |
| dc.date.issued | 2015-08-17 | |
| dc.description.abstract | Logistics is a vitally important part of the economy, and it is now a $1.45 trillion industry in the United States representing 8.3 percent of GDP. Efficient design of routes and schedules for moving materials into manufacturing or assembly plants is a central part of inbound logistics operations. This dissertation builds on elements of traditional vehicle routing as well as broader elements of logistics planning. At the core of the process is a mathematical optimization termed capacitated clustering. Two major categories of suppliers are analyzed in this research. The first supplier category includes suppliers with small quantities of materials, so daily pickups may not be required. A new approach is proposed that considers pick-up frequency and spatial design as joint decisions to minimize total logistics (transportation plus inventory) cost. The clustering-based optimization uses an approximation to the actual cost of a routing solution without actual route construction. The problem is shown to be analogous to a single-source fixed-charge facility location problem, and near-optimal solutions can be found using an efficient heuristic algorithm. Computational experiments show the effectiveness of how this model is formulated and a case study demonstrates that substantial total cost savings can be achieved in realistic applications. A second category of suppliers ships moderately large volumes to a single plant but not enough to fill a truck themselves. One commonly used process is to have plant- based collection routes on a daily basis that stop at multiple suppliers and return to the plant. The model developed here is formulated as a two-stage stochastic program, which includes uncertainty in the load quantities at suppliers and controls (either penalties or constraints) designed to improve the "regularity" of service to individual suppliers. Two adaptive decomposition heuristics are explored for solving the stochastic program in large scale, integer L-shaped method (ILSM) and progressive hedging (PH). An application to logistics operations in the automotive industry is used to demonstrate the effectiveness of the model and the PH solution method. | |
| dc.identifier.other | bibid: 9255329 | |
| dc.identifier.uri | https://hdl.handle.net/1813/41054 | |
| dc.language.iso | en_US | |
| dc.subject | inbound logistics | |
| dc.subject | network design | |
| dc.subject | capacitated clustering | |
| dc.title | Efficient Design Of Inbound Logistics Networks | |
| dc.type | dissertation or thesis | |
| thesis.degree.discipline | Civil and Environmental Engineering | |
| thesis.degree.grantor | Cornell University | |
| thesis.degree.level | Doctor of Philosophy | |
| thesis.degree.name | Ph. D., Civil and Environmental Engineering |
Files
Original bundle
1 - 1 of 1