Search results

The cross-docking strategy has a significant influence on supply chain and logistics efficiency. This paper aims to investigate the most suitable and efficient way to schedule the transfer of logistics activities and present a meta-heuristic method of the truck scheduling problem in cross-docking logistics. A truck scheduling problem with products time window is investigated with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks.

This research proposed a meta-heuristic method for the truck scheduling problem with products time window. To solve the problem, a lower bound of the problem is built through a novel two-stage Lagrangian relaxation problem and on account of the NP-hard nature of the truck scheduling problem, the novel red deer algorithm with the mechanism of the heuristic oscillating local search algorithm, as well as adaptive memory programming was proposed to overcome the inferior capability of the original red deer algorithm in the aspect of local search and run time.

Theory analysis and simulation experiments on an industrial case of a cross-docking center with a product’s time window are conducted in this paper. Satisfactory results show that the performance of the red deer algorithm is enhanced due to the mechanism of heuristic oscillating local search algorithm and adaptive memory programming and the proposed method efficiently solves the real-world size case of truck scheduling problems in cross-docking with product time window.

The consideration of products time window has very realistic significance in different logistics applications such as cold-chain logistics and pharmaceutical supply chain. Furthermore, the novel adaptive memory red deer algorithm could be modified and applied to other complex optimization scheduling problems such as scheduling problems considering energy-efficiency or other logistics strategies.

For the first time in the truck scheduling problem with the cross-docking strategy, the product’s time window is considered. Furthermore, a mathematical model with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks is developed. To solve the proposed problem, a novel adaptive memory red deer algorithm with the mechanism of heuristic oscillating local search algorithm was proposed to overcome the inferior capability of genetic algorithm in the aspect of local search and run time.

A nurse home care scheduling system is described. The objective is to provide medical care at patients’ homes using the fewest number of nurses possible to deliver the required care. The heuristic scheduling system is easy to implement as a computerized adaptive system. As such, it is easy to use on a daily basis and easy to update as new data related to completed treatment and new requests are obtained. A case study illustrates the advantages of implementing such a system.

As the world is becoming more volatile and uncertain, organizations face much complexity in their daily operations. Further, there is a much ambiguity in business operations to achieve the effective utilization of resources. The work optimizes a novel constraint programming model approach of the utilization of shuttle services vehicle while considering cost savings, employee wellbeing and other real an Information Technology enabled service (ITES) industry constraints.

The present work considers a novel extension of the vehicle routing problem related to the shuttle service operation in an ITES industry in VUCA context. Additionally, the model considers the women safety aspects, which engages the company to provide a security guard for women employees in the night shift.

Numerical experiments were conducted on real instances data of ITES industrial partner. The results show that the vehicle utilization increased from 75% up to 96% while ensuring in parallel the wellbeing of employees and women safety during the night shift. Finally, the proposed model is converted to a decision support application allowing ITES partner to plan employees shuttle service operations efficiently.

Study has evaluated the shuttle services optimization for ITES industry using data from industrial which makes it a unique contribution to literature in shuttle operations. Further, the study used constraint programming to evaluate the vehicle utilization and security allocation, thereby introducing new parameter on security allocation in open VRP problem.

This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics include: theory – domain decomposition/partitioning, load balancing, parallel solvers/algorithms, parallel mesh generation, adaptive methods, and visualization/graphics; applications – structural mechanics problems, dynamic problems, material/geometrical non‐linear problems, contact problems, fracture mechanics, field problems, coupled problems, sensitivity and optimization, and other problems; hardware and software environments – hardware environments, programming techniques, and software development and presentations. The bibliography at the end of this paper contains 850 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1996 and 2002.

Presents a review on implementing finite element methods on supercomputers, workstations and PCs and gives main trends in hardware and software developments. An appendix included at the end of the paper presents a bibliography on the subjects retrospectively to 1985 and approximately 1,100 references are listed.

The present paper describes a Fortran library FLIPP constituting a run‐time environment that is linked to scientific applications software (such as finite‐element analysis programs) to support programming of interactive program control and use of persistent user‐defined dynamic data structures. The system consists of control and data definition and manipulation subsystems. The FLIPP routines are fully‐portable standard Fortran 77 procedures and the use of FLIPP leads the programmer to information hiding, e.g. as in object‐oriented systems. Program design and maintenance are facilitated to a considerable degree, while at the same time the performance of the programs using the FLIPP system remains fairly good as demonstrated by the examples.

Internet has changed radically in the way people interact in the virtual world, in their careers or social relationships. IoT technology has added a new vision to this process by enabling connections between smart objects and humans, and also between smart objects themselves, which leads to anything, anytime, anywhere, and any media communications. IoT allows objects to physically see, hear, think, and perform tasks by making them talk to each other, share information and coordinate decisions. To enable the vision of IoT, it utilizes technologies such as ubiquitous computing, context awareness, RFID, WSN, embedded devices, CPS, communication technologies, and internet protocols. IoT is considered to be the future internet, which is significantly different from the Internet we use today. The purpose of this paper is to provide up-to-date literature on trends of IoT research which is driven by the need for convergence of several interdisciplinary technologies and new applications.

A comprehensive IoT literature review has been performed in this paper as a survey. The survey starts by providing an overview of IoT concepts, visions and evolutions. IoT architectures are also explored. Then, the most important components of IoT are discussed including a thorough discussion of IoT operating systems such as Tiny OS, Contiki OS, FreeRTOS, and RIOT. A review of IoT applications is also presented in this paper and finally, IoT challenges that can be recently encountered by researchers are introduced.

Studies of IoT literature and projects show the disproportionate importance of technology in IoT projects, which are often driven by technological interventions rather than innovation in the business model. There are a number of serious concerns about the dangers of IoT growth, particularly in the areas of privacy and security; hence, industry and government began addressing these concerns. At the end, what makes IoT exciting is that we do not yet know the exact use cases which would have the ability to significantly influence our lives.

This survey provides a comprehensive literature review on IoT techniques, operating systems and trends.

The purpose of this work is to present a methodology that harnesses the computational power of multiple graphics processing units (GPUs) and hides the complexities of tuning GPU parameters from the users.

A methodology for auto-tuning OpenCL configuration parameters has been developed.

This described process helps simplify coding and generates a significant gain in time for each method execution.

Most authors develop their GPU applications for specific hardware configurations. In this work, a solution is offered to make the developed code portable to any GPU hardware.

This paper aims to sketch the emerging notion of auto‐adaptive software when applied to e‐learning software.

The study and the implementation of the auto‐adaptive architecture are based on the operational framework “ActiveTutor” that is used for teaching the topic of computer science programming in first‐grade university courses.

The paper describes an adaptive heuristic dedicated to the display of knowledge entities which is based on the dynamic balancing of four behavioral criteria for the low‐level agents (cooperation, pedagogy, audacity, and sensibility).

The heuristic may be used in all multi‐agent systems where load balancing problems appear and where an auto‐adaptive behavior is important. Originality/value –The paper presents an auto‐adaptive algorithm.

A tailored graphical user interface (GUI) for finite element analysis, fully integrated into Microsoft Windows 3.1, has been developed. The current application is the simulation of flat sheet extrusion of thermoplastics, but many of the features would be common to a wide range of finite element analyses. Microsoft’s C/C++ Professional Development System 7.0, including the Software Development Kit 3.1 (SDK), has been used as the programming tool for the GUI. The interface is based on the Common User Access Advanced Interface Design Guide, which is part of the IBM Systems Application Architecture Library, and The Windows Interface: An Application Design Guide, which is part of the SDK. A memory handling technique is proposed to break the imposed 64 KB data segmentation. Connected finite element calculation routines are written in Fortran and compiled by the Salford FTN77/x86 32‐bit compiler. The protected mode interface of the Fortran compiler allows direct access by the GUI, and allows the computation to run as a 32‐bit background application, without memory limitations, in the multitasking environment. Finite element routines are supported by pre‐ and post‐processors comprising mesh generation, post‐processing for derived results, and graphical displays. A convenient contouring algorithm is proposed to generate contoured plots of nodal quantities in the form of iso‐lines or iso‐fields.