Search results

1 – 10 of over 27000
To view the access options for this content please click here
Article
Publication date: 1 October 1999

Charles G. Petersen

Order picking, the activity by which a number of goods are retrieved from a warehousing system to satisfy a number of customer orders, is an essential link in the supply…

Abstract

Order picking, the activity by which a number of goods are retrieved from a warehousing system to satisfy a number of customer orders, is an essential link in the supply chain and is the major cost component of warehousing. The critical issue is to simultaneously reduce the cost and increase the speed of the order picking activity. The main objectives of this paper are: evaluate various routing heuristics and an optimal routine in a volume‐based and random storage environment; compare the performance of volume‐based storage to random storage; and examine the impact of travel speed and picking rates on routing and storage policy performance. The experimental results show the solution gap between routing heuristics and optimal routing is highly dependent on the travel speed and picking rate, the storage policy, and the size of the pick list. In addition, volume‐based storage produced significant savings over random storage, but again these savings are dependent on the travel speed and picking rate.

Details

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

Keywords

To view the access options for this content please click here
Article
Publication date: 14 August 2017

Torsten Franzke, Eric H. Grosse, Christoph H. Glock and Ralf Elbert

Order picking is one of the most costly logistics processes in warehouses. As a result, the optimization of order picking processes has received an increased attention in…

Abstract

Purpose

Order picking is one of the most costly logistics processes in warehouses. As a result, the optimization of order picking processes has received an increased attention in recent years. One potential source for improving order picking is the reduction of picker blocking. The purpose of this paper is to investigate picker blocking under different storage assignment and order picker-route combinations and evaluate its effects on the performance of manual order picking processes.

Design/methodology/approach

This study develops an agent-based simulation model (ABS) for order picking in a rectangular warehouse. By employing an ABS, we are able to study the behaviour of individual order pickers and their interactions with the environment.

Findings

The simulation model determines shortest mean throughput times when the same routing policy is assigned to all order pickers. In addition, it evaluates the efficiency of alternative routing policies–storage assignment combinations.

Research limitations/implications

The paper implies that ABS is well-suited for further investigations in the field of picker blocking, for example, with respect to the individual behaviour of agents.

Practical implications

Based on the results of this paper, warehouse managers can choose an appropriate routing policy that best matches their storage assignment policy and the number of order pickers employed.

Originality/value

This paper is the first to comprehensively study the effects of different combinations of order picker routing and storage assignment policies on the occurrence of picker blocking.

Details

The International Journal of Logistics Management, vol. 28 no. 3
Type: Research Article
ISSN: 0957-4093

Keywords

To view the access options for this content please click here
Article
Publication date: 23 September 2019

Rajendran N., Jawahar P.K. and Priyadarshini R.

The purpose of this paper is to apply security policies over the mobile ad hoc networks. A mobile ad hoc network refers to infrastructure-less, persistently self-designing…

Abstract

Purpose

The purpose of this paper is to apply security policies over the mobile ad hoc networks. A mobile ad hoc network refers to infrastructure-less, persistently self-designing systems; likewise, there is a noteworthy innovation that supplies virtual equipment and programming assets according to the requirement of mobile ad hoc network.

Design/methodology/approach

It faces different execution and effectiveness-based difficulties. The major challenge is the compromise of performance because of unavailable resources with respect to the MANET. In order to increase the MANET environment’s performance, various techniques are employed for routing and security purpose. An efficient security module requires a quality-of-service (QoS)-based security policy. It performs the task of routing and of the mobile nodes, and it also reduces the routing cost by finding the most trusted node.

Findings

The experimental results specify that QoS-based security policy effectively minimizes the cost, response time as well as the mobile makespan (routing cost and response time) of an application with respect to other existing approaches.

Research limitations/implications

In this paper, the authors proposed an enhancement of Cross Centric Intrusion Detection System named as PIHNSPRA Routing Algorithm (PIHNSPRA).

Practical implications

It maps the security with the secure IDS communication and distributes the packets among different destinations, based on priority. This calculation is proposed for the purpose of routing and security by considering greatest throughput with least routing cost and reaction time.

Social implications

When the concept is applied to practical applications. Quality of Service introduced in the proposed research reduces the cost of routing and improves the throughput.

Originality/value

The proposed calculation is tested by NS2 simulator and the outcomes showed that the execution of the calculation is superior to other conventional algorithms.

Details

International Journal of Intelligent Unmanned Systems, vol. 7 no. 4
Type: Research Article
ISSN: 2049-6427

Keywords

To view the access options for this content please click here
Article
Publication date: 1 August 2004

Charles G. Petersen, Gerald R. Aase and Daniel R. Heiser

Class‐based storage (CBS) partitions stock‐keeping units (SKUs) into storage classes by demand and randomly assigns storage locations within each storage class area. This…

Abstract

Class‐based storage (CBS) partitions stock‐keeping units (SKUs) into storage classes by demand and randomly assigns storage locations within each storage class area. This study compares the performance implications of CBS to both random and volume‐based storage (VBS) for a manual order picking warehouse. In addition, this study considers the effect of the number of storage classes, the partition of storage classes, and the storage implementation strategy applied in the warehouse. The simulation results show that CBS provides savings in picker travel over random storage and offers performance that approaches VBS. Other operational issues having an impact on warehouse performance are examined. The results offer managers insight for improving distribution center operations.

Details

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

Keywords

To view the access options for this content please click here

Abstract

Details

Logistics Systems for Sustainable Cities
Type: Book
ISBN: 978-0-08-044260-0

To view the access options for this content please click here

Abstract

Details

City Logistics
Type: Book
ISBN: 978-0-08-043903-7

To view the access options for this content please click here
Book part
Publication date: 15 December 1998

Suzanne P. Evans

This paper explores the use of some stochastic models for traffic assignment in the case of homogeneous traffic and simple networks. For non-dynamic routing we obtain…

Abstract

This paper explores the use of some stochastic models for traffic assignment in the case of homogeneous traffic and simple networks. For non-dynamic routing we obtain asymptotic results in the form of paths representing time dependent evolution of traffic over routes. A functional limit theorem gives integral equations for the limiting fluid path which converges to an assignment satisfying Wardrop's first principle as time goes to infinity. For linear cost functions we are able to use the theory of large deviations to examine the way in which rare network overload events occur. In the case of dynamic assignment, we discuss the use of heavy traffic limits and Brownian models to examine the efficiency of network capacity usage when drivers choose routes according to conditions obtaining on entrance to the network. In particular we discuss the phenomenon of resource pooling.

Details

Mathematics in Transport Planning and Control
Type: Book
ISBN: 978-0-08-043430-8

To view the access options for this content please click here
Article
Publication date: 1 November 1997

Charles G. Petersen

Order picking, the assembly of a customer’s order from items in storage, is an essential link in the supply chain and is the major cost component of warehousing. The…

Abstract

Order picking, the assembly of a customer’s order from items in storage, is an essential link in the supply chain and is the major cost component of warehousing. The critical issue is to simultaneously reduce the cost and increase the speed of the order picking activity. The main objectives are to: evaluate various routeing policies in a random storage environment; evaluate the impact of warehouse shape and pick‐up/drop‐off location; and examine the interaction of the routeing policies, warehouse shape, and pick‐up/drop‐off location under different pick list sizes. The experimental results clearly indicate that the optimal routeing procedure generates significantly shorter routes than heuristic methods. The composite and largest gap routeing policies are, however, significantly better than simpler heuristic procedures. Further testing, in addition, indicates that the shape of the warehouse and the location of the pick‐up/drop‐off point can affect the picking efficiency.

Details

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

Keywords

To view the access options for this content please click here
Article
Publication date: 8 May 2017

Rui Liu, Shan Liu, Yu-Rong Zeng and Lin Wang

The purpose of this paper is to investigate a new and practical decision support model of the coordinated replenishment and delivery (CRD) problem with multi-warehouse…

Abstract

Purpose

The purpose of this paper is to investigate a new and practical decision support model of the coordinated replenishment and delivery (CRD) problem with multi-warehouse (M-CRD) to improve the performance of a supply chain. Two algorithms, tabu search-RAND (TS-RAND) and adaptive hybrid different evolution (AHDE) algorithm, are developed and compared as to the performance of each in solving the M-CRD problem.

Design/methodology/approach

The proposed M-CRD is more complex and practical than classical CRDs, which are non-deterministic polynomial-time hard problems. According to the structure of the M-CRD, a hybrid algorithm, TS-RAND, and AHDE are designed to solve the M-CRD.

Findings

Results of M-CRDs with different scales show that TS-RAND and AHDE are good candidates for handling small-scale M-CRD. TS-RAND can also find satisfactory solutions for large-scale M-CRDs. The total cost (TC) of M-CRD is apparently lower than that of a CRD with a single warehouse. Moreover, the TC is lower for the M-CRD with a larger number of optional warehouses.

Practical implications

The proposed M-CRD is helpful for managers to select the suitable warehouse and to decide the delivery scheduling with a coordinated replenishment policy under complex operations management situations. TS-RAND can be easily used by practitioners because of its robustness, easy implementation, and quick convergence.

Originality/value

Compared with the traditional CRDs with one warehouse, a better policy with lower TC can be obtained by the new M-CRD. Moreover, the proposed TS-RAND is a good candidate for solving the M-CRD.

Details

The International Journal of Logistics Management, vol. 28 no. 2
Type: Research Article
ISSN: 0957-4093

Keywords

To view the access options for this content please click here
Book part
Publication date: 29 January 2021

Grete Brochmann

Immigration represents one of the most contentious and complicated issues for social democracy in many national contexts. In Scandinavia, the social democratic parties…

Abstract

Immigration represents one of the most contentious and complicated issues for social democracy in many national contexts. In Scandinavia, the social democratic parties have been particularly tormented, being split internally on central concerns related to immigration policy. Social democratic parties in Scandinavia have had a basically ambiguous relationship to the issue from the initiation of the era of ‘new immigration’. This chapter argues that this can be explained by the specifically strong attachment and ‘ownership’ of these parties to the Scandinavian welfare model, with its particular claims on a strong tax base and an orderly labour market. ‘Social democracy’ is dealt with mainly as an institutional and political entity, close to what goes as ‘The Nordic Model’ in the international literature. The chapter describes and analyses similarities and differences between the three Scandinavian countries, through a historical exposé of the period after the early 1970s; on the one hand, the institutional and normative prerequisites for social democracies in handling migration, and on the other hand, the way in which recent flows of migrants have influenced the very same social democracies. Theoretically, the chapter is drawing on conceptual tools from political economy, citizenship discourse and institutional theory.

Details

Social Democracy in the 21st Century
Type: Book
ISBN: 978-1-83909-953-3

Keywords

1 – 10 of over 27000