A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case

A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case
复制标题

DOI:
10.1016/j.ejor.2007.01.048
复制
发表时间:
2008-04
期刊:
Eur. J. Oper. Res.
影响因子:
--
通讯作者:
D. Aksen;K. Altinkemer
D. Aksen;K. Altinkemer
中科院分区:
其他
文献类型:
--
作者:
D. Aksen;K. Altinkemer

文献摘要

被引文献

相似文献

从配送物流的角度研究了实体零售向点击+实体混合商业模式的静态转换。零售商经营仓库和实体店,以满足他们的上门顾客的需求。当他们决定在网络上经营电子零售商时,还需要同时服务上门顾客和在线顾客的实体店。家到最近的开放商店之间的距离被用来作为上门顾客的代理度量,而在线顾客的服务质量(QoS)保证是及时交付他们的订单。我们描述并解决了一个基于静态位置路由的问题,该问题适用于在零售业务中采用点击和砖块策略的公司。嵌入在子梯度优化过程中的增广拉格朗日松弛法生成下界,而启发式方法则找到可行解。在一些随机生成的测试问题上测试了基于拉格朗日解的方法的性能。
The static conversion from brick-and-mortar retailing to the hybrid click-and-mortar business model is studied from the perspective of distribution logistics. Retailers run warehouses and brick-and-mortar stores to meet the demand of their walk-in customers. When they decide to operate on the Web as an e-tailer, also click-and-mortar stores are needed which can serve both walk-in and online customers. While the distance between home and the nearest open store is used as a proxy measure for walk-in customers, a quality of service (QoS) guarantee for online customers is timely delivery of their orders. We describe and solve a static location-routing based problem for companies that embrace the clicks-and-bricks strategy in their retail operations. An augmented Lagrangian relaxation method embedded in a subgradient optimization procedure generates lower bounds, whereas a heuristic method finds feasible solutions. The performance of the Lagrangian-based solution method is tested on a number of randomly generated test problems.