Search results

The purpose of this paper is to elaborate the picture of strategies and tactics for information seeking and searching by focusing on the heuristic elements of such strategies and tactics.

A conceptual analysis of a sample of 31 pertinent investigations was conducted to find out how researchers have approached heuristics in the above context since the 1970s. To achieve this, the study draws on the ideas produced within the research programmes on Heuristics and Biases, and Fast and Frugal Heuristics.

Researchers have approached the heuristic elements in three major ways. First, these elements are defined as general level constituents of browsing strategies in particular. Second, heuristics are approached as search tips. Third, there are examples of conceptualizations of individual heuristics. Familiarity heuristic suggests that people tend to prefer sources that have worked well in similar situations in the past. Recognition heuristic draws on an all-or-none distinction of the information objects, based on cues such as information scent. Finally, representativeness heuristic is based on recalling similar instances of events or objects and judging their typicality in terms of genres, for example.

As the study focuses on three heuristics only, the findings cannot be generalized to describe the use of all heuristic elements of strategies and tactics for information seeking and searching.

The study pioneers by providing an in-depth analysis of the ways in which the heuristic elements are conceptualized in the context of information seeking and searching. The findings contribute to the elaboration of the conceptual issues of information behavior research.

The purpose of this paper is to develop a methodological usability evaluation approach for e‐commerce websites in developing countries.

A multi‐faceted usability evaluation of three Jordanian e‐commerce websites was used, where three usability methods (user testing, heuristic evaluation and web analytics) were applied to the sites.

A four‐step approach was developed to facilitate the evaluation of e‐commerce sites, mindful of the advantages and disadvantages of the methods used in identifying specific usability problems.

The approach was developed and tested using Jordanian users, experts and e‐commerce sites. The study compared the ability of the methods to detect problems that were present, however, usability issues not present on any of the sites could not be considered when creating the approach.

The approach helps e‐commerce retailers evaluate the usability of their websites and understand which usability method(s) best matches their need.

This research proposes a new approach for evaluating the usability of e‐commerce sites. A novel aspect is the use of web analytics (Google Analytics software) as a component in the usability evaluation in conjunction with heuristics and user testing.

The paper addresses the following research question: how do decision-makers use heuristics in their international business (IB) environment? Whereas, the literature has focused on entrepreneurial companies, here contrasting approaches to learning and using heuristics in international marketing (IM) decisions are examined and discussed.

The paper aims to address a gap in the study of micro-foundations of internationalization, exploiting research from other disciplinary fields. It combines a multidisciplinary literature review and longitudinal case studies to illustrate different approaches in learning and using heuristics by international marketers.

International marketers can adopt “closed” heuristics that are consolidated and consistently followed, or “open” heuristics, which are constantly being adapted and learned. Established multinationals learn heuristics in international marketing decision-making, following both “closed” and “open” models.

This paper offers an original contribution by presenting different approaches not yet examined in the literature, focusing on how international marketers make decisions through learning and using heuristic rules. The focus is on established exporters, in contrast to the literature that has largely paid attention to the effectiveness of heuristics in new entrepreneurial firms.

The purpose of this paper is to review, evaluate and classify the academic research that has been published in facility layout problems (FLPs) and to analyse how researches and practices on FLPs are.

The review is based on 166 papers published from 1953 to 2021 in international peer-reviewed journals. The literature review on FLPs is presented under broader headings of discrete space and continuous space FLPs. The important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. The articles reported in the literature on various representations of facilities for the continuous space Unequal Area Facility Layout Problems (UA-FLPs) are summarized. Discussed and commented on adaptive and robust approaches for dynamic environment FLPs. Highlighted the application of meta-heuristic solution methods for FLPs of a larger size.

It is found that most of the earlier research adopted the discrete space for the formulation of FLPs. This type of space representation for FLPs mostly assumes an equal area for all facilities. UA-FLPs represented in discrete space yield irregular shape facilities. It is also observed that the recent works consider the UA-FLPs in continuous space. The solution of continuous space UA-FLPs is more accurate and realistic. Some of the recent works on UA-FLPs consider the flexible bay structure (FBS) due to its advantages over the other representations. FBS helps the proper design of aisle structure in the detailed layout plan. Further, the recent articles reported in the literature consider the dynamic environment for both equal and unequal area FLPs to cope with the changing market environment. It is also found that FLPs are Non-deterministic Polynomial-complete problems, and hence, they set the challenges to researchers to develop efficient meta-heuristic methods to solve the bigger size FLPs in a reasonable time.

Due to the extremely large number of papers on FLPs, a few papers may have inadvertently been missed. The facility layout design research domain is extremely vast which covers other areas such as cellular layouts, pick and drop points and aisle structure design. This research review on FLPs did not consider the papers published on cellular layouts, pick and drop points and aisle structure design. Despite the possibility of not being all-inclusive, the authors firmly believe that most of the papers published on FLPs are covered and the general picture presented on various approaches and parameters of FLPs in this paper are precise and trustworthy.

To the best of the authors’ knowledge, this paper reviews and classifies the literature on FLPs for the first time under the broader headings of discrete space and continuous space representations. Many important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. This paper also provides the observations from the literature review and identifies the prospective future directions.

Locating hub facilities is important in different types of transportation and communication networks. The p‐Hub Median Problem (p‐HMP) addresses a class of hub location problems in which all hubs are interconnected and each non‐hub node is assigned to a single hub. The hubs are uncapacitated, and their number p is initially determined. Introduces an Artificial Intelligence (AI) heuristic called simulated annealing to solve the p‐HMP. The results are compared against another AI heuristic, namely Tabu Search, and against two other non‐AI heuristics. A real world data set of airline passenger flow in the USA, and randomly generated data sets are used for computational testing. The results confirm that AI heuristic approaches to the p‐HMP outperform non‐AI heuristic approaches on solution quality.

The purpose of this paper is to investigate the use of problem-solving approaches in maintenance cost management (MCM). In particular, the paper aims to examine characteristics of MCM models and to identify patterns for classification of problem-solving approaches.

This paper reflects an extensive and detailed literature survey of 68 (quantitative or qualitative) cost models within the scope of MCM published in the period from 1969 to 2013. The reviewed papers have been critically examined and classified based on implementing a morphological analysis which employs eight criteria and associated expressions. In addition, the survey identified two main perspectives of problem solving: first, synoptic/incremental and second, heuristics/meta-heuristics.

The literature survey revealed the patterns for classification of the MCM models, especially the characteristics of the models for problem-solving in association with the type of modeling, focus of purpose, extent and scope of application, and reaction and dynamics of parameters. Majority of the surveyed approaches is mathematical, respectively, synoptic. Incremental approaches are much less and only few are combined (i.e. synoptic and incremental). A set of features is identified for proper classification, selection, and coexistence of the two approaches.

This paper provides a basis for further study of heuristic and meta-heuristic approaches to problem-solving. Especially the coexistence of heuristic, synoptic, and incremental approaches needs to be further investigated.

The detected dominance of synoptic approaches in literature – especially in the case of specific application areas – contrasts to some extent to the needs of maintenance managers in practice. Hence the findings of this paper particularly address the need for further investigation on combining problem-solving approaches for improving planning, monitoring, and controlling phases of MCM. Continuous improvement of MCM, especially problem-solving and decision-making activities, is tailored to the use of maintenance knowledge assets. In particular, maintenance management systems and processes are knowledge driven. Thus, combining problem-solving approaches with knowledge management methods is of interest, especially for continuous learning from past experiences in MCM.

This paper provides a unique study of 68 problem-solving approaches in MCM, based on a morphological analysis. Hence suitable criteria and their expressions are provided. The paper reveals the opportunities for further interdisciplinary research in the maintenance cost life cycle.

Walking-worker assembly lines can be regarded as an effective method to achieve the above-mentioned characteristics. In such systems, workers, following each other, travel workstations in sequence by performing all of the required tasks of their own product. As the eventual stage of assembly line design, efforts should be made for capacity adjustments to meet the demand in terms of allocating tasks to workers via assembly line balancing. In this context, the purpose of this study is to address the balancing problem for multi-model walking-worker assembly systems, with the aim of improving planning capability for such systems by means of developing an optimization methodology.

Two linear integer programming models are proposed to balance a multi-model walking-worker assembly line optimally in a sequential manner. The first mathematical programming model attempts to determine number of workers in each segment (i.e. rabbit chase loop) for each model. The second model generates stations in each segment to smooth workflow. What is more, heuristic algorithms are provided due to computational burden of mathematical programming models. Two segment generation heuristic algorithms and a station generation heuristic algorithm are provided for the addressed problem.

The application of the mathematical programming approach improved the performance of a tap-off box assembly line in terms of number of workers (9.1 per cent) and non-value-added time ratio (between 27.9 and 26.1 per cent for different models) when compared to a classical assembly system design. In addition, the proposed approach (i.e. segmented walking-worker assembly line) provided a more convenient working environment (28.1 and 40.8 per cent shorter walking distance for different models) in contrast with the overall walking-worker assembly line. Meanwhile, segment generation heuristics yielded reduction in labour requirement for a considerable number (43.7 and 49.1 per cent) of test problems. Finally, gaps between the objective values and the lower bounds have been observed as 8.3 per cent (Segment Generation Heuristic 1) and 6.1 (Segment Generation Heuristic 2).

The proposed study presents a decision support for walking-worker line balancing with high level of solution quality and computational performance for even large-sized assembly systems. That being the case, it contributes to the management of real-life assembly systems in terms of labour planning and ergonomics. Owing to the fact that the methodology has the potential of reducing labour requirement, it will present the opportunity of utilizing freed-up capacity for new lines in the start-up period or other bottleneck processes. In addition, this study offers a working environment where skill of the workers can be improved within reasonable walking distances.

To the best knowledge of the author, workload balancing on multi-model walking-worker assembly lines with rabbit chase loop(s) has not yet been handled. Addressing this research gap, this paper presents a methodology including mathematical programming models and heuristic algorithms to solve the multi-model walking-worker assembly line balancing problem for the first time.

To develop and test three different inventory management strategies as applied to the complex emergency in south Sudan.

Quantitative modeling, simulation, and statistics.

This research identified critical system factors that contributed most significantly to inventory system performance, and identified strengths and weaknesses of each inventory management strategy.

This research represents a first step in developing inventory management systems for humanitarian relief. Future work would include modeling correlation among relief items, multiple items, and considering the impact of information.

In a domain that has seen limited application of quantitative models, this work demonstrates the performance benefits of using quantitative methods to manage inventory in a relief setting.

This research has value for relief organizations by providing a real‐world application of quantitative inventory management strategies applied to a complex emergency, and demonstrated performance advantages of quantitative versus ad hoc methods. This research has value for researchers by providing a new application of simulation and mathematical modeling (humanitarian relief).

Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.

This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.

The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.

This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.

Motivated by a problem in the context of DiDi Travel, the biggest taxi hailing platform in China, the purpose of this paper is to propose a novel facility location problem, specifically, the single source capacitated facility location problem with regional demand and time constraints, to help improve overall transportation efficiency and cost.

This study develops a mathematical programming model, considering regional demand and time constraints. A novel two-stage neighborhood search heuristic algorithm is proposed and applied to solve instances based on data sets published by DiDi Travel.

The results of this study show that the model is adequate since new characteristics of demand can be deduced from large vehicle trajectory data sets. The proposed algorithm is effective and efficient on small and medium as well as large instances. The research also solves and presents a real instance in the urban area of Chengdu, China, with up to 30 facilities and demand deduced from 16m taxi trajectory data records covering around 16,000 drivers.

This study examines an offline and single-period case of the problem. It does not consider multi-period or online cases with uncertainties, where decision makers need to dynamically remove out-of-service stations and add other stations to the selected group.

Prior studies have been quite limited. They have not yet considered demand in the form of vehicle trajectory data in facility location problems. This study takes into account new characteristics of demand, regional and time constrained, and proposes a new variant and its solution approach.