返回
Solving Detour-Based Fuel Stations Location Problems
DOI:10.1111/mice.12170.png)
摘要
En 中文
This article studies the problem of locating fuel stations to minimize the extra cost spent in refueling detours, which belongs to a class of discretionary service facility location problems. Unlike many studies of similar problems in the literature, the proposed model considers capacity constraints and compares different ways to incorporate them in the formulation. Note that ignoring the capacity constraint results in nonoptimal and unrealistic solutions. The proposed models are solved using both an off-the-shelf solver (CPLEX) and a specialized meta-heuristic method (Simulated Annealing) developed in this study. The solution methods are tested and compared in two case studies; a test benchmark network and a large-scale network. An effort to overcome the memory limitation of CPLEX through more compact formulation was partially successful: it results in a model that is less tightly bounded by its linear relaxation and hence is much more difficult to solve. In contrast, the Simulated Annealing algorithm scales better and is able to consistently yield high-quality solutions with a reasonable amount of computation time.
Keyword:
MAXIMIZING MARKET-SIZE
FACILITY LOCATION
ELECTRICITY MARKETS
GENETIC ALGORITHMS
NETWORK DESIGN
TABU SEARCH
OPTIMIZATION
HEURISTICS
MODEL
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
9.1
论文数:
2.0K
被引数:
10.0K
机构
引用论文
Optimization of hydrogen stations in Florida using the Flow-Refueling Location Model使用流动加油位置模型优化佛罗里达州的氢气站

