scholarly journals A mixed integer linear programming model to support e-fulfillment strategies in warehouse-based supermarket chains

Author(s):  
Mar Vazquez-Noguerol ◽  
Jose A. Comesaña-Benavides ◽  
Sara Riveiro-Sanroman ◽  
J. Carlos Prado-Prado

AbstractThe use of the online channel has greatly increased the logistics costs of supermarket chains. Even the difficulty of managing order picking and delivery processes has increased due to the short delivery times and the preservation of perishable products. Against that backdrop, the proposed approach presents a mathematical model for planning the e-fulfillment activities with the objective of ensuring maximum efficiency. The linear programming model has been designed for e-grocers that prepare their online orders at central warehouses. The mathematical model determines both the time windows during which picking and transport should take place and the assignment of trucks to delivery routes. The allocation of online orders is performed taking into account the conservation requirement of each type of product and the availability of means. Considering this planning tool, managers can improve the decision-making process guaranteeing the quality of service while reducing the e-fulfillment cost for joint picking and delivery point of view. Motivated by a cooperation with a supermarket chain, results bring great insight based on the simulation of different logistics alternatives. Companies and researchers can compare the strategy of leveling the workload and the strategy of reducing the number of means, a common alternative in logistics outsourced to third parties. In addition, the different scenarios developed make it possible to determine the substantial savings achieved by modifying the delivery services and advancing the order preparation. As a result, managerial insights are identified highlighting the importance of efficient order planning to improve the profitability of online sales.

Proceedings ◽  
2018 ◽  
Vol 2 (11) ◽  
pp. 594 ◽  
Author(s):  
Jaime Veintimilla-Reyes ◽  
Annelies De Meyer ◽  
Dirk Cattrysse ◽  
Jos Van Orshoven

The allocation of water flowing through a river-with-reservoirs system to optimally meet spatially distributed and temporally variable demands can be conceived as a Network Flow Optimisation (NFO) problem and addressed by Linear Programming (LP). In this paper we present an extension of the strategic NFO-LP model to simultaneously optimise the allocation of water and the location of one or more reservoirs. The applicability of the MILP model has been illustrated by applying it to a hypothetical river network configuration consisting of seven candidate reservoir nodes and seven demand nodes, and by comparing the outcome (water levels in selected reservoir, penalties) with the values obtained by the original LP-model for the same network with six reservoirs present.


Sign in / Sign up

Export Citation Format

Share Document