Multi-facility green Weber problem

2020-01-01
Atashi Khoei, Arsham
Süral, Haldun
Tural, Mustafa Kemal
Locating facilities to satisfy the demands of customers is a strategic decision for a distribution system. In this article, we study the multi-facility green Weber problem (MF-GWP), an extension of the classical multi-facility Weber problem, that considers environmental concerns in a distribution system in the context of a planar facility location problem. In the MF-GWP, the vehicles are sent directly from the facilities to the assigned customers to satisfy their demands. Each customer has a deadline and the vehicles serving the customer must arrive at the location of the customer no later than the deadline. The MF-GWP determines the locations of p facilities on the plane, p > 1, allocations of customers to the facilities, and the speeds of the distribution vehicles so as to minimize the total amount of CO2 emission in the distribution system. We formulate this problem as a mixed integer second order cone programming (MISOCP) problem. This formulation turns out to be weak and therefore only small size instances can be solved to optimality within four hours. For larger size instances, a local search heuristic is proposed and some well-known heuristics developed for the multi-facility Weber problem, namely "location-allocation", "transfer follow-up", and "decomposition" are adapted for the MF-GWR We use second order cone programming (SOCP) and the proposed MISOCP formulation as subproblems within the heuristics. We provide our computational experiments to compare the proposed solution methods in terms of solution quality and time. The results show that within a fixed computational time, even though the location-allocation heuristic is able to make more replications, the improvement heuristics considered, i.e., transfer or transfer followed by decomposition, usually find better solutions while using less number of replications. We also investigate how the total amount of CO2 emitted by distribution vehicles changes with respect to the number of facilities located. We argue that in several real life applications from different sectors including aviation and robotics, MF-GWP and its extensions or modifications can be used to reduce the CO2 emission or energy consumption. As an illustrative example, we show the applicability of the MF-GWP within an assembly line system, where the stations are fed by dedicated rail-guided vehicles.
Computers and Operations Research

Suggestions

Multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse under compound Poisson demand
Topan, E; Bayındır, Zeynep Pelin (Informa UK Limited, 2012-8)
We consider a multi-item two-echelon spare part inventory system in which the central warehouse operates under an (nQ, R) policy and the local warehouses implement order-up-to S policy, each facing a compound Poisson demand. The objective is to find the policy parameters minimizing expected system-wide inventory holding and fixed ordering costs subject to an aggregate mean response time constraint at each warehouse. In this paper, we propose four alternative approximations for the steady state performance o...
A maximal covering location model in the presence of partial coverage
Karasakal, O; Karasakal, Esra (2004-08-01)
The maximal covering location problem (MCLP) addresses the issue of locating a predefined number of facilities in order to maximize the number of demand points that can be covered. In a classical sense, a demand point is assumed to be covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance. Since the optimal solution to a MCLP is likely sensitive to the choice of the critical distance, determining a critical distance value when the c...
Dynamic switching times from season to single tickets in sports and entertainment
Duran, Serhan; Yakici, Ertan (Springer Science and Business Media LLC, 2012-08-01)
Revenue management can be used in many industries where there is a limited, perishable capacity and the market can be segmented. In this paper we focus on the sales of event tickets in the Sports and Entertainment industries, where tickets are sold exclusively as season tickets initially or as single events later in the selling horizon. We specifically study the optimal time to switch between these market segments dynamically as a function of the state of the system. Under Poisson demand processes, we find ...
A Mixed integer second order cone programming reformulation for a congested location and capacity allocation problem on a supply chain network
Salimian, Mohammad; Gürel, Sinan; Department of Industrial Engineering (2013)
Supply chain network design involves location decisions for production facilities and distribution centers. We consider a make-to-order supply chain environment where distribution centers serve as crossdocking terminals. Long waiting times may occur at a cross-docking terminal, unless su cient handling capacity is installed. In this study, we deal with a facility location problem with congestion e ects at distribution centers. Along with location decisions, we make capacity allocation (service rate) and dem...
Retail location competition under carbon penalty
Dilek, Hande; Karaer, Özgen; NADAR, EMRE (2018-08-16)
We study the retail location problem in a competitive linear market in which two retailers simultaneously choose their locations. Both retailers procure identical products from a common supplier and each consumer purchases from the closest retailer. Each retailer incurs transportation costs for inventory replenishment from the warehouse and consumer travels to the store. We consider two carbon tax schemes imposed on retailers: for supply-chain-related transportation and for consumer-related transportation. ...
Citation Formats
A. Atashi Khoei, H. Süral, and M. K. Tural, “Multi-facility green Weber problem,” Computers and Operations Research, pp. 0–0, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33244.