Skip to search boxSkip to navigationSkip to main content

The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods

  • M. Hakan Akyüz
  • Galatasaray University
Output:
Contribution to journal
Article
Academic
Peer-review

Information

Output type

Output:
Contribution to journal
Article
Academic
Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 221-240 (20 pages)

Journal (Volume, Issue Number)

Computers & Industrial Engineering (Volume 113)

Publication milestones

  • Published - 01/11/2017

Publication status

Published - 01/11/2017

ISSN

0360-8352

Funding Details

The authors would like to thank the two anonymous referees and the associate editor for their valuable comments, which helped improve this paper. The work described in this paper is supported by a grant from the Turkish Scientific and Technological Research Council Research Grant No: 214M222 and Galatasaray University Scientific Research Project Grant No. 16.402.013 .

Abstract

The Capacitated Multi-facility Weber Problem investigates the optimal locations of I capacitated facilities in the plane to satisfy the demand of J customers so that the total transportation cost is minimized. Facilities can be placed without any restrictions and customers are directly served without interruptions. In this work, we focus on the case with polyhedral barriers in which neither locating a facility nor travelling is permitted. Then, the transportation costs are dependent not only on the direct distances between facilities and customers but also on the location and size of the polyhedral barriers in presence. This results in a non-convex optimization problem which is difficult to solve. We offer two alternate location-allocation heuristics and two discrete approximation heuristics that are specially tailored for this problem. An extensive set of computational experiments are performed on the randomly generated test instances. Our results indicate that suggested heuristic methods are very efficient and yield promising results for this difficult problem.

Metrics

Metrics

SciVal
citations
11
Scopus
citations
11
SciVal
FWCI
0.73
SciVal
Author count
1
SciVal
Paper percentile
63

PlumX, opens in new tab

Captures
17
Citation count
11