scholarly journals Wave Planning for Cart Picking in a Randomized Storage Warehouse

2020 ◽  
Vol 10 (22) ◽  
pp. 8050
Author(s):  
Jiun-Yan Shiau ◽  
Jie-An Huang
Keyword(s):  
Best Practice ◽  
Time Window ◽  
Programming Model ◽  
Value Added ◽  
Order Picking ◽  
Mixed Integer ◽  
Just In Time ◽  
Distribution Centers ◽  
Truck Loading ◽  
Planning Algorithm

Randomized storage strategy is known as a best practice for storing books of an online bookstore, it simplifies the order picking strategy as to retrieve books in purchase orders from closest locations of the warehouse. However, to be more responsive to customers, many distribution centers have adopted a just-in-time strategy leading to various value-added activities such as kitting, labelling, product or order assembly, customized packaging, or palletization, all of which must be scheduled and integrated in the order-picking process, and this is known as wave planning. In this study, we present a wave planning mathematical model by simultaneously consider: (1) time window from master of schedule (MOS), (2) random storage stock-keeping units (SKUs), and (3) picker-to-order. A conceptual simulation, along with a simplified example for the proposed wave planning algorithm, has been examined to demonstrate the merits of the idea. The result shows the wave planning module can improve the waiting time for truck loading of packages significantly and can reduce the time that packages are heaping in buffer area. The main contribution of this research is to develop a mixed integer programming model that helps the bookseller to generate optimal wave picking lists for a given time window.

scholarly journals A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jianxun Cui ◽  
Shi An ◽  
Meng Zhao
Keyword(s):  
Flow Model ◽  
Time Window ◽  
Programming Model ◽  
Real Life ◽  
Minimum Cost ◽  
Emergency Evacuation ◽  
Mixed Integer ◽  
Fixed Cost ◽  
Minimum Cost Flow ◽  
Cost Flow

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.

Insights to optimise marketing decisions on pig-grower farms

2019 ◽  
Vol 59 (6) ◽  
pp. 1126 ◽  
Author(s):  
S. V. Rodríguez-Sanchez ◽  
L. M. Pla-Aragones ◽  
R. De Castro
Keyword(s):  
Weight Control ◽  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Management Policy ◽  
Mixed Integer ◽  
Factors Affecting ◽  
Pig Production ◽  
Marketing Policy ◽  
Feeding Program

Modern pig production in a vertically integrated company is a highly specialised and industrialised activity, requiring increasingly complex and critical decision-making. The present paper focuses on the decisions made on the pig-grower farms operating on an all-in–all-out management policy at the last stage of pig production. Based on a mixed-integer linear-programming model, an assessment for specific parameters to support marketing decisions on farms without individual weight control is made. The analysis of several key factors affecting the optimal marketing policy, such as transportation cost, when and how many pigs to deliver to the abattoir and weight homogeneity of the batch, served to gain insight into marketing decisions. The results confirmed that not just the feeding program, but also the grading price system, transportation and batch homogeneity have an enormous impact on the optimal marketing policy of fattening farms in a vertically integrated company. In addition, within the range of conditions considered, a time window of 4 weeks was deemed as optimal for delivering animals to the abattoir and the subsequent revenue was 15% higher than with traditional marketing rules.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

scholarly journals Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment

2020 ◽  
Vol 2020 ◽  
pp. 1-22
Author(s):  
Guangcan Xu ◽  
Maozeng Xu ◽  
Yong Wang ◽  
Yong Liu ◽  
Qiguang Lv
Keyword(s):  
Energy Supply ◽  
Time Window ◽  
Programming Model ◽  
Urban Transportation ◽  
Mixed Integer ◽  
Supply Network ◽  
Transportation Energy ◽  
The Sustainable Development ◽  
Petrol Station ◽  
Chongqing City

Energy supply is an important system that affects the overall efficiency of urban transportation. To improve the system operational efficiency and reduce costs, we formulate and solve a collaborative multidepot petrol station replenishment problem with multicompartments and time window assignment by establishing a mixed-integer linear programming model. The hybrid heuristic algorithm composed of genetic algorithm and particle swarm optimization is used as a solution, and then the Shapley value method is applied to analyze the profit allocation of each petrol depot under different coalitions. The optimal membership sequence of the cooperation is determined according to the strict monotone path. To analyze and verify the effectiveness of the proposed method, a regional petrol supply network in Chongqing city in China is investigated. Through cooperation between petrol depots in the supply network, the utilization of customer clustering, time window coordination, and distribution truck sharing can significantly reduce the total operation costs and improve the efficiency of urban transportation energy supply. This approach can provide theoretical support for relevant government departments and enterprises to make optimal decisions. The implementation of the joint distribution of energy can promote the sustainable development of urban transportation.

scholarly journals Supply chain optimization with variable demand by considering financial criteria and scenarios

2017 ◽  
Vol 26 (44) ◽  
pp. 21 ◽  
Author(s):  
John Willmer Escobar
Keyword(s):  
Supply Chain ◽  
Large Scale ◽  
Net Present Value ◽  
Programming Model ◽  
Supply Chain Design ◽  
Mixed Integer ◽  
Supply Network ◽  
Distribution Centers ◽  
Supply Chain Optimization ◽  
Starting Point

This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has been estimated. As starting point, this paper considers an established supply chain for which the main problem is to determine the decisions regarding expansion of distribution centers. The problem is solved by using a mixed-integer linear programming model, which optimizes the different demand scenarios. The proposed methodology uses a scheme of optimization based on the generation of multiple demand scenarios of the supply network. The model is based on a real case taken from a multinational food company, which supplies to the Colombian and some international markets. The obtained results were compared with the equivalent present costs minimization scheme of the supply network, and showed the importance and efficiency of the proposed approach as an alternative for the supply chain design with stochastic parameters.

scholarly journals Scheduling Just-in-Time Transport Vehicles to Feed Parts for Mixed Model Assembly Lines

2020 ◽  
Vol 2020 ◽  
pp. 1-13 ◽  
Author(s):  
Yunfang Peng ◽  
Tian Zeng ◽  
Yajuan Han ◽  
Beixin Xia
Keyword(s):  
Large Scale ◽  
Assembly Line ◽  
Mixed Model ◽  
Programming Model ◽  
Primary Objective ◽  
Mixed Integer ◽  
Inventory Level ◽  
Just In Time ◽  
Time Model ◽  
Delivery Strategy

In order to solve the problem of vehicle scheduling to feed parts at automobile assembly line, this study proposes a just-in-time delivery method combined with the mode of material supermarket. A mixed integer linear programming model with the primary objective of using the least number of tow trains is constructed by considering capacity of vehicle and inventory levels of line. On the basis of the minimum number of tow trains, the schedule of each tour is reasonably planned to minimize inventory of assembly line, which is the secondary objective of the part supply problem. Additionally, a heuristic algorithm which can obtain a satisfactory solution in a short time is designed to solve large-scale problems after considering continuity and complexity of modern automobile production. Furthermore, some cases are analyzed and compared with the widely used periodic delivery strategy, and the feasibility of just-in-time model and algorithm is verified. The results reveal that just-in-time delivery strategy has more advantages in reducing inventory level than periodic delivery strategy.

scholarly journals A Path-Based Selection Solution Approach for the Low Carbon Vehicle Routing Problem with a Time-Window Constraint

2020 ◽  
Vol 10 (4) ◽  
pp. 1489 ◽  
Author(s):  
Xianlong Ge ◽  
Xiaobo Ge ◽  
Weixin Wang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Model Simulation ◽  
Path Selection ◽  
Urban Traffic ◽  
Mixed Integer ◽  
Low Carbon ◽  
Gradual Improvement ◽  
Solution Approach ◽  
Urban Distribution

Due to the gradual improvement of urban traffic network construction and the increasing number of optional paths between any two points, how to optimize a vehicle travel path in a multi-path road network and then improve the efficiency of urban distribution has become a difficult problem for logistics companies. For this purpose, a mixed-integer mathematical programming model with a time window based on multiple paths for urban distribution in a multi-path environment is established and its exact solution solved using software CPLEX. Additionally, in order to test the application and feasibility of the model, simulation experiments were performed on the four parameters of time, distance, cost, and fuel consumption. Furthermore, using Jingdong (JD), the main urban area in Chongqing, as an example, the experimental results reveal that an algorithm that considers the path selection can significantly improve the efficiency of urban distribution in metropolitan areas with complex road structures.

scholarly journals An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Ang Yang ◽  
Yu Cao ◽  
Kang Chen ◽  
Qingcheng Zeng ◽  
Zigen Chen
Keyword(s):  
Power Plant ◽  
Thermal Power Plant ◽  
Large Scale ◽  
Time Window ◽  
Programming Model ◽  
Thermal Power ◽  
Scale Model ◽  
Mixed Integer ◽  
Ship Scheduling ◽  
Operation Cost

The quantity of electrical coal transported through the tramp shipping network is increasing due to the high demands. This trend has increased the scheduling difficulty combined with the underdevelopment of the private thermal power plant port. The high coal consumption and low port storage capacity requires the scheduling of the tramp ship to be on a strict time window to ensure the continuous operation of the thermal power plant. The low port unloading capacity often leads to the port congestion and delay of the unloading operation. This paper develops a mixed-integer-programming model for the optimization of the tramp ship scheduling to reduce the total operation cost, including the transportation cost and the unloading waiting cost, and the branch-and-price algorithm is adopted to solve this large-scale model. The model and algorithm are tested with historical operation data from the thermal power plant in the southern coastal areas of China. The optimized scheme significantly reduces the total operation cost by reducing the unloading waiting time and the number of active vessels in certain periods. The results also demonstrate the algorithm improvement in the aspects of the optimization quality and efficiency comparing with the heuristic solution.

Modeling of Green Supply Chain Logistics

2010 ◽  
pp. 268-282 ◽  
Author(s):  
Hsin-Wei Hsu
Keyword(s):  
Supply Chain ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Minimum Cost ◽  
Mixed Integer ◽  
Green Supply Chain ◽  
Supply Chain Network ◽  
Distribution Centers ◽  
Supply Chain Logistics ◽  
The Subject

The green supply chain management has drawn researchers’ attention in recent years, but most of the proposed models for green topics on the subject are case based, and for this reason, they lack generality. In this work, the design of a supply chain network is studied. In this chapter, we try to overcome this limitation and a generalized model is proposed, in which a logistics chain network problem is formulated into a 0-1 mixed integer linear programming model and the decisions for the function of manufactures, distribution centers, and dismantlers will be suggested with minimum cost. A numerical example is provided for illustration.

Sign in / Sign up

Export Citation Format

Share Document