An Incremental Approach for Storage and Delivery Planning Problems

Journal Title: Decision Making in Manufacturing and Services - Year 2012, Vol 6, Issue 1

Abstract

We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation.

Authors and Affiliations

Ikuko Nishikawa, Yajie Tian, Kazutoshi Sakakibara

Keywords

Related Articles

Optimizing Modular Machining Line Design Problem with Mixed Activation Mode of Machining Units

A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints a...

Stretching the Least Squares to Embed Loss Functions Tables

The method of least squares is extended to accommodate a class of loss functions specified in the form of function tables. Each function table is embedded into the standard quadratic loss function so that the nonlinear l...

CP-driven Production Process Planning in Multiproject Environment

The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed...

Editorial

Welcome to the premier issue of the new international journal Decision Making in Manufacturing and Services. The launching of a new journal is a unique opportunity to introduce its mission, scope, and coverage areas.

Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines

This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (PLSP) with identical parallel machines and set-up times overlappingtwo periods. The proposed model assumes constant perio...

Download PDF file
  • EP ID EP166466
  • DOI 10.7494/dmms.2012.6.1.5
  • Views 103
  • Downloads 0

How To Cite

Ikuko Nishikawa, Yajie Tian, Kazutoshi Sakakibara (2012). An Incremental Approach for Storage and Delivery Planning Problems. Decision Making in Manufacturing and Services, 6(1), 5-23. https://europub.co.uk/articles/-A-166466