The University of Southampton
University of Southampton Institutional Repository

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

An efficient heuristic algorithm for the alternative-fuel station location problem
An efficient heuristic algorithm for the alternative-fuel station location problem
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 the promising candidate set can be fixed to improve computation time. In addition, a parallel computing strategy is integrated into solving simultaneously the set of subproblems to speed up computation time. Experimental results carried out on the benchmark instances show that our algorithm outperforms genetic algorithm and greedy algorithm. As compared with CPLEX solver, our algorithm can obtain all the optimal solutions on the tested instances with less computation time.
0377-2217
Tran, Trung Hieu
ce314ab5-32ec-48ab-a5bc-4790ebfa5531
Nagy, Gabor
459b8c96-ce8c-45d7-b01d-58ac71c4e279
Nguyen, Thu Ba T.
e9f85a8c-c454-4ccb-9b34-fea01ce8c7bd
Wassan, Niaz A.
66d43a70-d25b-46cf-9c90-bfe0c84277f9
Tran, Trung Hieu
ce314ab5-32ec-48ab-a5bc-4790ebfa5531
Nagy, Gabor
459b8c96-ce8c-45d7-b01d-58ac71c4e279
Nguyen, Thu Ba T.
e9f85a8c-c454-4ccb-9b34-fea01ce8c7bd
Wassan, Niaz A.
66d43a70-d25b-46cf-9c90-bfe0c84277f9

Tran, Trung Hieu, Nagy, Gabor, Nguyen, Thu Ba T. and Wassan, Niaz A. (2017) An efficient heuristic algorithm for the alternative-fuel station location problem. European Journal of Operational Research. (doi:10.1016/j.ejor.2017.10.012).

Record type: Article

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 the promising candidate set can be fixed to improve computation time. In addition, a parallel computing strategy is integrated into solving simultaneously the set of subproblems to speed up computation time. Experimental results carried out on the benchmark instances show that our algorithm outperforms genetic algorithm and greedy algorithm. As compared with CPLEX solver, our algorithm can obtain all the optimal solutions on the tested instances with less computation time.

Text
An Efficient Heuristic Algorithm for the Alternative-Fuel Station - Accepted Manuscript
Restricted to Repository staff only until 16 November 2019.
Request a copy

More information

Accepted/In Press date: 7 October 2017
e-pub ahead of print date: 16 October 2017

Identifiers

Local EPrints ID: 416300
URI: https://eprints.soton.ac.uk/id/eprint/416300
ISSN: 0377-2217
PURE UUID: 095741e4-801d-4c43-bdde-43b0cb086fa6

Catalogue record

Date deposited: 12 Dec 2017 17:30
Last modified: 09 Sep 2019 17:14

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×