Search results

1 – 10 of over 81000
To view the access options for this content please click here
Article

Gary I. Green, Chang S. Kim and Sang M. Lee

Determination of new warehouse locations is an important managerial decision. The problem typically involves a number of considerations such as cost per distance of…

Abstract

Determination of new warehouse locations is an important managerial decision. The problem typically involves a number of considerations such as cost per distance of distribution to and from the warehouse, volume of distribution, fixed and variable site costs, service performance of the warehouse and potential increases in demand (or service), as well as many other factors. The economic significance of warehouse location decisions is increasing, particularly due to expected increases in transportation costs, competition for market share and changing demand patterns.

Details

International Journal of Physical Distribution & Materials Management, vol. 11 no. 1
Type: Research Article
ISSN: 0269-8218

To view the access options for this content please click here
Article

Horst A. Eiselt and Gilbert Laporte

Distribution systems planning frequently involves two majordecisions: facility location and vehicle routing. The facilities to belocated may be “primary facilities”, e.g…

Abstract

Distribution systems planning frequently involves two major decisions: facility location and vehicle routing. The facilities to be located may be “primary facilities”, e.g. factories, but more often, these are lighter “secondary facilities” such as depots, warehouses or distribution centres. Routing decisions concern the optimal movement of goods and vehicles in the system, usually from primary to secondary facilities, and from secondary facilities to users or customers. Studies which integrate the two areas are more often than not limited to the case where all deliveries are return trips involving only one destination. There exist, however, several situations where vehicles visit more than one point on the same trip. In such cases, relationships between location and routing decisions become more intricate. Strategies by which the two aspects of the problem are optimised separately and sequentially are often sub‐optimal. Also of importance is the trade‐off between the cost of providing service and customer inconvenience. A framework is proposed for the study of such combined location‐routing problems. A number of real‐life cases described in the literature are summarised and some algorithmic issues related to such problems are discussed.

Details

International Journal of Physical Distribution & Materials Management, vol. 19 no. 4
Type: Research Article
ISSN: 0269-8218

Keywords

To view the access options for this content please click here
Article

Himanshu Rathore, Shirsendu Nandi, Peeyush Pandey and Surya Prakash Singh

The purpose of this paper is to examine the efficacy of diversification-based learning (DBL) in expediting the performance of simulated annealing (SA) in hub location problems.

Abstract

Purpose

The purpose of this paper is to examine the efficacy of diversification-based learning (DBL) in expediting the performance of simulated annealing (SA) in hub location problems.

Design/methodology/approach

This study proposes a novel diversification-based learning simulated annealing (DBLSA) algorithm for solving p-hub median problems. It is executed on MATLAB 11.0. Experiments are conducted on CAB and AP data sets.

Findings

This study finds that in hub location models, DBLSA algorithm equipped with social learning operator outperforms the vanilla version of SA algorithm in terms of accuracy and convergence rates.

Practical implications

Hub location problems are relevant in aviation and telecommunication industry. This study proposes a novel application of a DBLSA algorithm to solve larger instances of hub location problems effectively in reasonable computational time.

Originality/value

To the best of the author’s knowledge, this is the first application of DBL in optimisation. By demonstrating its efficacy, this study steers research in the direction of learning mechanisms-based metaheuristic applications.

Details

Benchmarking: An International Journal, vol. 26 no. 6
Type: Research Article
ISSN: 1463-5771

Keywords

To view the access options for this content please click here
Article

Martin Schwardt and Jan Dethloff

A variant of Kohonen's algorithm for the self‐organizing map (SOM) is used to solve a continuous location‐routing problem that can be applied to identify potential sites…

Abstract

Purpose

A variant of Kohonen's algorithm for the self‐organizing map (SOM) is used to solve a continuous location‐routing problem that can be applied to identify potential sites for subsequent selection by a discrete finite set model. The paper aims to show how the algorithm may be customized to fit the problem structure in a way that allows aspects of location and routing to be integrated into the solution procedure.

Design/methodology/approach

A set of test instances is used to compare the solutions of the neural network to those obtained by sequential approaches based on a savings procedure.

Findings

Compared to the results of the sequential approaches, the neural network yields good results.

Research limitations/implications

Future work may cover the expansion of the neural approach to multi‐depot and multi‐stage problems. Additionally, application of procedures other than the savings procedure should be evaluated with respect to their potential for further enhancing the solution quality of the sequential approaches.

Practical implications

This paper shows that strategic location decisions in practical applications with long‐term customer relationships can be taken using simultaneously generated routing information on an operational level.

Originality/value

The paper provides a new variety of applications for SOM as well as high quality results for the specific type of problem considered.

Details

International Journal of Physical Distribution & Logistics Management, vol. 35 no. 6
Type: Research Article
ISSN: 0960-0035

Keywords

To view the access options for this content please click here
Article

Sang M. Lee and Lori Sharp Franz

The location‐allocation problem involves multiple shipping destinations, with known demands for a given product and known transportation costs from sources to…

Abstract

The location‐allocation problem involves multiple shipping destinations, with known demands for a given product and known transportation costs from sources to destinations. The problem is to determine the number of facilities and their locations in order to best service the shipping destinations. This paper presents an approach to facility location which allows the analysis of multiple conflicting goals as an extension of previous solution approaches. Specifically, the paper applies the branch and bound integer goal programming approach to the location‐allocation problem.

Details

International Journal of Physical Distribution & Materials Management, vol. 9 no. 6
Type: Research Article
ISSN: 0269-8218

To view the access options for this content please click here
Article

Tarik Kucukdeniz and Sakir Esnaf

The purpose of this paper is to propose hybrid revised weighted fuzzy c-means (RWFCM) clustering and Nelder–Mead (NM) simplex algorithm, called as RWFCM-NM, for…

Abstract

Purpose

The purpose of this paper is to propose hybrid revised weighted fuzzy c-means (RWFCM) clustering and Nelder–Mead (NM) simplex algorithm, called as RWFCM-NM, for generalized multisource Weber problem (MWP).

Design/methodology/approach

Although the RWFCM claims that there is no obligation to sequentially use different methods together, NM’s local search advantage is investigated and performance of the proposed hybrid algorithm for generalized MWP is tested on well-known research data sets.

Findings

Test results state the outstanding performance of new hybrid RWFCM and NM simplex algorithm in terms of cost minimization and CPU times.

Originality/value

Proposed approach achieves better results in continuous facility location problems.

Details

Journal of Enterprise Information Management, vol. 31 no. 6
Type: Research Article
ISSN: 1741-0398

Keywords

To view the access options for this content please click here
Article

B. Latha Shankar, S. Basavarajappa and Rajeshwar S. Kadadevaramath

The paper aims at the bi‐objective optimization of a two‐echelon distribution network model for facility location and capacity allocation where in a set of customer…

Abstract

Purpose

The paper aims at the bi‐objective optimization of a two‐echelon distribution network model for facility location and capacity allocation where in a set of customer locations with demands and a set of candidate facility locations will be known in advance. The problem is to find the locations of the facilities and the shipment pattern between the facilities and the distribution centers (DCs) to minimize the combined facility location and shipment costs subject to a requirement that maximum customer demands be met.

Design/methodology/approach

To optimize the two objectives simultaneously, the location and distribution two‐echelon network model is mathematically represented in this paper considering the associated constraints, capacity, production and shipment costs and solved using hybrid multi‐objective particle swarm optimization (MOPSO) algorithm.

Findings

This paper shows that the heuristic based hybrid MOPSO algorithm can be used as an optimizer for characterizing the Pareto optimal front by computing well‐distributed non‐dominated solutions. These aolutions represent trade‐off solutions out of which an appropriate solution can be chosen according to industrial requirement.

Originality/value

Very few applications of hybrid MOPSO are mentioned in literature in the area of supply chain management. This paper addresses one of such applications.

Details

Journal of Modelling in Management, vol. 7 no. 3
Type: Research Article
ISSN: 1746-5664

Keywords

To view the access options for this content please click here
Article

Cory Watkins, Lorraine Green Mazerolle, Dennis Rogan and James Frank

Using a quasi‐experimental design methodology, this paper reports the results from a controlled field evaluation of the ShotSpotter gunshot location technology in Redwood…

Abstract

Using a quasi‐experimental design methodology, this paper reports the results from a controlled field evaluation of the ShotSpotter gunshot location technology in Redwood City, California. Results from this field test indicate that overall, the ShotSpotter system was able to annunciate (detect) gunshots in 81 percent of the field trial events (N = 25 of 31 shooting events) and triangulate (locate) gunshots in 84 percent of the field trial events (N = 26 of 31 shooting events) within an average margin of error of 41ft. We conclude this paper with a discussion of the policy implications associated with using gunshot detection technology as a problem‐solving tool to detect, reduce and prevent incidences of random gunfire.

Details

Policing: An International Journal of Police Strategies & Management, vol. 25 no. 2
Type: Research Article
ISSN: 1363-951X

Keywords

To view the access options for this content please click here
Article

C.G. Chentnik

Plant location has been an enigma for planners since the Middle Ages. As early as 1647 Cavaliere tried to find a point which minimised the distance between three given

Abstract

Plant location has been an enigma for planners since the Middle Ages. As early as 1647 Cavaliere tried to find a point which minimised the distance between three given locations. A special case of this problem was formulated by Heinen in 1834. Fagano increased the problem from one considering three points to one of four. Fagano's work was extended to the case of n points by Tedenat in 1810.

Details

International Journal of Physical Distribution, vol. 4 no. 1
Type: Research Article
ISSN: 0020-7527

To view the access options for this content please click here
Article

Cem Canel and Basheer M. Khumawala

For many years, facilities location problems have attracted a great deal of attention in the literature. As a result, there is now a variety of methods for solving these…

Abstract

For many years, facilities location problems have attracted a great deal of attention in the literature. As a result, there is now a variety of methods for solving these problems. However, due to the recent interest, little research is found relating to the issues concerning international facilities location problems. Furthermore, in spite of the extensive modelling work done on facilities location, little modelling research exists on location problems. Provides a capacitated multi‐period, 0‐1 mixed integer programming formulation for the international facilities location problem and discusses its applications to an actual company case. This application is carried out to demonstrate not only how the model can be applied in practice but also to show its potential benefits when compared to other methods.

Details

International Journal of Operations & Production Management, vol. 16 no. 4
Type: Research Article
ISSN: 0144-3577

Keywords

1 – 10 of over 81000