2018
DOI: 10.1016/j.ejor.2017.10.012
|View full text |Cite
|
Sign up to set email alerts
|

An efficient heuristic algorithm for the alternative-fuel station location problem

Abstract: We have developed an efficient heuristic algorithm for location of alternative-fuel stations. The algorithm is constructed based on solving the sequence of subproblems restricted on a set of promising station candidates, and fixing a number of the best promising station locations. The set of candidates is initially determined by solving a relaxation model, and then modified by exchanging some stations between the promising candidate set and the remaining station set. A number of the best station candidates in … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(14 citation statements)
references
References 46 publications
0
14
0
Order By: Relevance
“…To minimize the total cost to locate electric vehicle charging stations in road networks, Gagarin and Corcoran [51] suggest a novel approach that searches for the dominating set of locations among the candidate locations whose distance is below a certain threshold from a given driver. Using a parallel computing strategy, Tran et al [52] propose an efficient heuristic algorithm for location of AF refueling stations based on the solution of a sequence of subproblems. e major differences between the proposed model and the existing studies that are directly relevant to ours are summarized in Table 2.…”
Section: Main Distinctions Of Our Research Workmentioning
confidence: 99%
“…To minimize the total cost to locate electric vehicle charging stations in road networks, Gagarin and Corcoran [51] suggest a novel approach that searches for the dominating set of locations among the candidate locations whose distance is below a certain threshold from a given driver. Using a parallel computing strategy, Tran et al [52] propose an efficient heuristic algorithm for location of AF refueling stations based on the solution of a sequence of subproblems. e major differences between the proposed model and the existing studies that are directly relevant to ours are summarized in Table 2.…”
Section: Main Distinctions Of Our Research Workmentioning
confidence: 99%
“…The authors presented a study of a real case and implemented an ILS algorithm for the routing and mathematical techniques for the loading of vehicles. On the other hand, Tran et al [22] implemented a heuristic algorithm for location of alternative-fuel stations. Hosseinabadi et al [23] developed a method called TIME_GELS that uses the gravitational emulation local search algorithm (GELS) for solving the multiobjective flexible dynamic job-shop scheduling problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the literature review, there are four formulations for the FRLM without station failures [for example, Kuby and Lim (2005), Capar and Kuby (2012), MirHassani and Ebrazi (2013) and Capar et al (2013)]. The model developed by Capar et al (2013) is known as the most efficient formulation for the FRLM so far, since the number of variables (i.e., binary and continuous) and the number of constraints in this model are smaller than others (Tran et al 2017a). Based on the formulation of Capar et al (2013), we develop an MINLP model for the FRLM with station failures in the next section.…”
Section: Formulation Of the Standard Frlmmentioning
confidence: 99%
“…A specialized metaheuristic algorithm based on Simulated Annealing is developed to solve the large-size problem in a reasonable computation time. Tran et al (2017a) develop an efficient heuristic algorithm for the FRLM. This algorithm is built based on solving the sequence of sub-problems that are restricted on a set of promising station candidates, and fixing a number of the best promising station locations.…”
Section: Introductionmentioning
confidence: 99%