Search results

The dynamic vehicle scheduling problem for a shipper involves managing transport of freight originating at various locations to minimise transport costs. The job involves dynamic assignment of vehicles contracted from carriers to loads available at multiple locations on a real time basis. A framework for building a PC‐based expert system to be used as a decision support system is provided. An example expert scheduling system (EXLOAD) built on VP EXPERT, a PC‐based expert system shell is also shown.

This study aims to propose a new genetic algorithm for solving supply chain scheduling and routing problem in a multi-site manufacturing system. The main research question is: How is the production and transportation scheduled in a multi-site manufacturer? Also the sub-questions are: How is the order assigned to the suppliers? What is the production sequence of the assigned orders to a supplier? How is the order assignment to the vehicles? What are the vehicles routes to convey the orders from the suppliers to the manufacturing centers? The authors’ contributions in this paper are: integration of production scheduling and vehicle routing in multi-site manufacturing supply chain and proposing a new genetic algorithm inspired from the role model concept in sociology.

Considering shared transportation system in production scheduling of a multi-site manufacturer is investigated in this paper. Initially, a mathematical model for the problem is presented. Afterwards, a new genetic algorithm based on the reference group concept in sociology, named Reference Group Genetic Algorithm (RGGA) is introduced for solving the problem. The comparison between RGGA and a developed algorithm of literature closest problem, demonstrates a better performance of RGGA. This comparison is drawn based on many test problems. Moreover, the superiority of RGGA is certificated by comparing it to the optimum solution in the small size problems. Finally, the authors use real data collected from a drug manufacturer in Iran to test the performance of the algorithm. The results show the better performance of RGGA in comparison with obtained outputs from the real case.

The authors presented the mathematical model of the problem and introduced a new genetic algorithm based on the “reference group” concept in sociology. Robert K. Merton is a sociologist who presented the concept of reference groups in society. He believed that some people in each society such as heroes or entertainment artists affect other people. The proposed algorithm uses the reference group concept to the genetic algorithm, namely, RGGA. The comparison of the proposed algorithm with DGA and the optimum solution shows the superiority of RGGA. Finally, the authors implement the algorithm in a real case of drug manufacturing and the results show that the authors’ algorithm gives better outputs than obtained outputs from the real case.

One of the major objectives of supply chains is to create a competitive advantage for the final product. This intension is only achieved when each and every element of the supply chain considers customers’ needs in every function of theirs. This paper studies scheduling in the supply chain of a multi-site manufacturing system. It is assumed that some suppliers produce raw material or initial parts and convey them by a fleet of vehicles to a multi-site manufacturer.

Real time control and scheduling systems determine the vehicle routing plan based on the current status of the system. The status of a system can be represented by different attributes of demand such as location, quantity, and due date. The objective of this article is to propose a real time dynamic vehicle control and scheduling system for multi‐depot physical distribution. To perform the system objectives effectively, the proposed system includes five major modules. These are: global information collection system, depot controller, route planner, vehicle scheduler, vechicle route and time table feedback system. A simulation experiment is described at the end of the article to evaluate the performance of the proposed system. The results indicate that the proposed system is promising and can be implemented in practical operations.

The purpose of this paper is to describe an integer linear programming model to schedule the maintenance crew and the maintenance tasks in a bus operating company.

The proposed methodology relies on an integer linear programming model that finds feasible maintenance schedules. It minimizes the costs associated with maintenance crew and the costs associated with unavailability. The model is applied in a real-world case study of a Portuguese bus operating company. A constructive heuristic approach is put forward, based on solving the maintenance scheduling problem for each bus separately.

The heuristic finds better solutions than the exact methods (based on branch-and-bound techniques) in a much lower computational time.

The results suggest the relevance of such heuristic approaches for maintenance scheduling in practice.

This proposed model is an effective decision-making support method that provides feasible maintenance schedules for the maintenance technicians and for the maintenance tasks in a fleet of buses. It also complies with several operational, technical and labour constraints.

Continual rising fuel costs and rapidly increasing vehicle costs have generated management awareness of the costs incurred in physical distribution. Inevitably, management attention on the distribution function is drawn towards potential cost savings and increases in efficiency. Where transport costs represent a significant part of the total distibution costs, then one area which determines the efficiency of all others is the vehicle routing and scheduling activity which could collectively be known as load planning.

The total capacity of ambulances in metropolitan cities is often less than the post-disaster demand, especially in the case of disasters such as earthquakes. However, because earthquakes are a rare occurrence in these cities, it is unreasonable to maintain the ambulance capacity at a higher level than usual. Therefore, the effective use of ambulances is critical in saving human lives during such disasters. Thus, this paper aims to provide a method for determining how to transport the maximum number of disaster victims to hospitals on time.

The transportation-related disaster management problem is complex and dynamic. The practical solution needs decomposition and a fast algorithm for determining the next mission of a vehicle. The suggested method is a synthesis of mathematical modeling, scheduling theory, heuristic methods and the Voronoi diagram of geometry. This study presents new elements for the treatment, including new mathematical theorems and algorithms. In the proposed method, each hospital is responsible for a region determined by the Voronoi diagram. The region may change if a hospital becomes full. The ambulance vehicles work for hospitals. For every patient, there is an estimated deadline by which the person must reach the hospital to survive. The second part of the concept is the way of scheduling the vehicles. The objective is to transport the maximum number of patients on time. In terms of scheduling theory, this is a problem whose objective function is to minimize the sum of the unit penalties.

The Voronoi diagram can be effectively used for decomposing the complex problem. The mathematical model of transportation to one hospital is the P‖ΣU_j problem of scheduling theory. This study provides a new mathematical theorem to describe the structure of an algorithm that provides the optimal solution. This study introduces the notion of the partial oracle. This algorithmic tool helps to elaborate heuristic methods, which provide approximations to the precise method. The realization of the partial oracle with constructive elements and elements proves the nonexistence of any solution. This paper contains case studies of three hospitals in Tehran. The results are close to the best possible results that can be achieved. However, obtaining the optimal solution requires a long CPU time, even in the nondynamic case, because the problem P‖ΣU_j is NP-complete.

This research suggests good approximation because of the complexity of the problem. Researchers are encouraged to test the proposed propositions further. In addition, the problem in the dynamic environment needs more attention.

If a large-scale earthquake can be expected in a city, the city authorities should have a central control system of ambulances. This study presents a simple and efficient method for the post-disaster transport problem and decision-making. The security of the city can be improved by purchasing ambulances and using the proposed method to boost the effectiveness of post-disaster relief.

The population will be safer and more secure if the recommended measures are realized. The measures are important for any city situated in a region where the outbreak of a major earthquake is possible at any moment.

This paper fulfills an identified need to study the operations related to the transport of seriously injured people using emergency vehicles in the post-disaster period in an efficient way.

In this paper, the authors propose the application of an intelligent engine to develop a set of computational schedules for the maintenance of vehicles to cover all scheduled flights. The aim of the paper is to maximize the utilization of ground support vehicles and enhance the logistics of aircraft maintenance activities.

A mathematical model is formulated and the solution is obtained using genetic algorithms (GA). Simulation is used to verify the method using an Excel GA generator. The model is illustrated with a numerical case study, and the experience of this project is summarized.

The results indicate that this approach provides an effective and efficient schedule for deploying the maintenance equipment resources of the company, China Aircraft Service Limited.

The proposed model using the GA generator provides an effective and efficient schedule for the aircraft maintenance services industry.

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.

The purpose of this paper is to study the use of outsourcing as a mechanism to cope with supply chain uncertainty, more specifically, how to deal with sudden arrival of higher priority jobs that require immediate processing, in an in-house manufacturer's facility from the perspective of outsourcing. An operational level schedule of production and distribution of outsourced jobs to the manufacturer's facility should be determined for the subcontractor in order to achieve overall optimality.

The problem is of bi-criteria in that both the transportation cost measured by number of delivery vehicles and schedule performance measured by jobs’ delivery times. In order to obtain the problem's Pareto front, we propose dynamic programming (DP) heuristic solution procedure based on integrated decision making, and population-heuristic solution procedures using different encoding schemes based on sequential decision making. Computational studies are designed and carried out by randomly generating comparative variations of numerical problem instances.

By comparing several existing performance metrics for the obtained Pareto fronts, it is found that DP heuristic outperforms population-heuristic in both solutions diversity and proximity to optimal Pareto front. Also in population-heuristic, sub-range keys representation appears to be a better encoding scheme for the problem than random keys representation.

This study contributes to the limited yet important knowledge body on using outsourcing approach to coping with possible supply chain disruptions in production scheduling due to sudden customer orders. More specifically, we used modeling methodology to confirm the importance of collaboration with subcontractors to effective supply chain risk management.

This paper aims to investigate the part feeding scheduling problem with electric vehicles (EVs) for automotive assembly lines. A point-to-point part feeding model has been formulated to minimize the number of EVs and the maximum handling time by specifying the EVs and sequence of all the delivery tasks.

First, a mathematical programming model of point-to-point part feeding scheduling problem (PTPPFSP) with EVs is presented. Because the PTPPFSP is NP-hard, an improved multi-objective cuckoo search (IMCS) algorithm is developed with novel search strategies, possessing the self-adaptive Levy flights, the Gaussian mutation and elite selection strategy to strengthen the algorithm’s optimization performance. In addition, two local search operators are designed for deep optimization. The effectiveness of the IMCS algorithm is verified by dealing with the PTPPFSP in different problem scales.

Numerical experiments are used to demonstrate how the IMCS algorithm serves as an efficient method to solve the PTPPFSP with EVs. The effectiveness and feasibility of the IMCS algorithm are validated by approximate Pareto fronts obtained from the instances of different problem scales. The computational results show that the IMCS algorithm can achieve better performance than the other high-performing algorithms in terms of solution quality, convergence and diversity.

This study is applicable without regard to the breakdown of EVs. The current research contributes to the scheduling of in-plant logistics for automotive assembly lines, and it could be modified to cope with similar part feeding scheduling problems characterized by just-in-time (JIT) delivery.

Both limited electricity capacity and no earliness and tardiness constraints are considered, and the scheduling problem is solved satisfactorily and innovatively for an efficient JIT part feeding with EVs applied to in-plant logistics.