A bi-objective model for the used oil location-routing problem

被引:73
|
作者
Zhao, Jiahong [1 ]
Verter, Vedat [2 ]
机构
[1] Guangzhou Univ, Sch Business, Guangzhou, Guangdong, Peoples R China
[2] McGill Univ, Desautels Fac Management, Montreal, PQ H3A 2T5, Canada
关键词
Used oil; Location-routing; Capacity acquisition; Environmental risk; Bi-objective; Dispersion model; HAZARDOUS MATERIALS; OPTIMIZATION;
D O I
10.1016/j.cor.2014.10.016
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A staggering amount of used oils (e.g., 1.4 billion gallons in the U.S.) are generated annually as part of our industrial lifestyle. These are harmful to the population and environment in the vicinity of the transport routes as well as the storage, treatment and disposal facilities. In this paper, we provide an analytical framework to simultaneously answer the following questions: Where should the used oil storage, treatment and disposal facilities be located? What are the most appropriate capacity levels for these facilities? Which routes should be used among the different echelons of facilities in the used oil collection network? Focusing on the hazardous ingredients of used oils that are airborne on release, we propose an environmental risk measure by incorporating the Gaussian plume model in the box model. We present a bi-objective model for the location-routing problem so as to minimize the total environmental risk and the total cost. We use a modified weighted goal programming approach, which proved to be computationally efficient through a wide range of tests. The application of the proposed analytical framework in Chongqing of Southwest China provided interesting managerial insights. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:157 / 168
页数:12
相关论文
共 50 条
  • [31] A Metaheuristic for a Two Echelon Location-Routing Problem
    Boccia, Maurizio
    Crainic, Teodor G.
    Sforza, Antonio
    Sterle, Claudio
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 288 - +
  • [32] Time-dependent and bi-objective vehicle routing problem with time windows
    Zhao, P. X.
    Luo, W. H.
    Han, X.
    ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT, 2019, 14 (02): : 201 - 212
  • [33] SOLVING THE BI-OBJECTIVE ROBUST VEHICLE ROUTING PROBLEM WITH UNCERTAIN COSTS AND DEMANDS
    Solano-Charris, Elyn L.
    Prins, Christian
    Cynthia Santos, Andrea
    RAIRO-OPERATIONS RESEARCH, 2016, 50 (4-5) : 689 - 714
  • [34] Bi-Objective Mixed Integer Nonlinear Programming Model for Low Carbon Location-Inventory-Routing Problem with Time Windows and Customer Satisfaction
    Liu, Lihua
    He, Aneng
    Tian, Tian
    Lee, Lai Soon
    Seow, Hsin-Vonn
    MATHEMATICS, 2024, 12 (15)
  • [35] A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
    Karasakal, Esra
    Silav, Ahmet
    TOP, 2016, 24 (01) : 206 - 232
  • [36] Heuristics for the Bi-Objective Diversity Problem
    Colmenar, J. M.
    Marti, R.
    Duarte, A.
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 108 : 193 - 205
  • [37] ε-Constraintmethod for bi-objective competitive facility location problem with uncertain demand scenario
    Beresnev, Vladimir
    Melnikov, Andrey
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2020, 8 (01) : 33 - 59
  • [38] A supply chain design problem with facility location and bi-objective transportation choices
    Olivares-Benitez, Elias
    Luis Gonzalez-Velarde, Jose
    Rios-Mercado, Roger Z.
    TOP, 2012, 20 (03) : 729 - 753
  • [39] A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
    Asgari, Nasrin
    Rajabi, Mohsen
    Jamshidi, Masoumeh
    Khatami, Maryam
    Farahani, Reza Zanjirani
    ANNALS OF OPERATIONS RESEARCH, 2017, 250 (02) : 279 - 308
  • [40] A branch and cut method for the capacitated location-routing problem
    Belenguer, Jose-Manuel
    Benavent, Enrique
    Prins, Christian
    Prodhon, Caroline
    Wolfler-Calvo, Roberto
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1541 - 1546