Search results
1 – 10 of 11The purpose of this paper is to resolve three problems in ship routing and scheduling systems. Problem 1 is the anticipation of the future cargo transport demand when the shipping…
Abstract
Purpose
The purpose of this paper is to resolve three problems in ship routing and scheduling systems. Problem 1 is the anticipation of the future cargo transport demand when the shipping models are stochastic based on this demand. Problem 2 is the capacity of these models in processing large number of ships and cargoes within a reasonable time. Problem 3 is the viability of tramp shipping when it comes to real problems.
Design/methodology/approach
A commodity-trade forecasting system is developed, an information technology platform is designed and new shipping elements are added to the models to resolve tramp problems of en-route ship bunkering, low-tide port calls and hold-cleaning cost caused by carrying incompatible cargoes.
Findings
More realistic stochastic cargo quantity and freight can now be anticipated, larger number of ships and cargoes are now processed in time and shipping systems are becoming more viable.
Practical implications
More support goes to ship owners to make better shipping decisions.
Originality/value
New norms are established in forecasting, upscaling and viability in ship routing and scheduling systems.
Details
Keywords
Abdelrahman E.E. Eltoukhy, Felix T.S. Chan and S.H. Chung
The purpose of this paper is twofold: first to carry out a comprehensive literature review for state of the art regarding airline schedule planning and second to identify some new…
Abstract
Purpose
The purpose of this paper is twofold: first to carry out a comprehensive literature review for state of the art regarding airline schedule planning and second to identify some new research directions that might help academic researchers and practitioners.
Design/methodology/approach
The authors mainly focus on the research work appeared in the last three decades. The search process was conducted in database searches using four keywords: “Flight scheduling,” “Fleet assignment,” “Aircraft maintenance routing” (AMR), and “Crew scheduling”. Moreover, the combination of the keywords was used to find the integrated models. Any duplications due to database variety and the articles that were written in non-English language were discarded.
Findings
The authors studied 106 research papers and categorized them into five categories. In addition, according to the model features, subcategories were further identified. Moreover, after discussing up-to-date research work, the authors suggested some future directions in order to contribute to the existing literature.
Research limitations/implications
The presented categories and subcategories were based on the model characteristics rather than the model formulation and solution methodology that are commonly used in the literature. One advantage of this classification is that it might help scholars to deeply understand the main variation between the models. On the other hand, identifying future research opportunities should help academic researchers and practitioners to develop new models and improve the performance of the existing models.
Practical implications
This study proposed some considerations in order to enhance the efficiency of the schedule planning process practically, for example, using the dynamic Stackelberg game strategy for market competition in flight scheduling, considering re-fleeting mechanism under heterogeneous fleet for fleet assignment, and considering the stochastic departure and arrival times for AMR.
Originality/value
In the literature, all the review papers focused only on one category of the five categories. Then, this category was classified according to the model formulation and solution methodology. However, in this work, the authors attempted to propose a comprehensive review for all categories for the first time and develop new classifications for each category. The proposed classifications are hence novel and significant.
Details
Keywords
Suggests that, in recent years, remarkable progress has been madein the development of the topological design of logistics networks,especially in the warehouse location problem…
Abstract
Suggests that, in recent years, remarkable progress has been made in the development of the topological design of logistics networks, especially in the warehouse location problem. Extends the standard warehouse location problem to a generalization of multiproduct capacitated warehouse location problem, as opposed to differentiated variations of a single‐product warehouse location problem, where each warehouse has a given capacity for carrying each product. Presents an algorithm based on cross‐decomposition, to reduce the computational difficulty by incorporating Benders decomposition and Lagrangean relaxation. Computational results of this algorithm are encouraging.
Details
Keywords
Ting Wang, Xiaoling Shao and Xue Yan
In intelligent scheduling, parallel batch processing can reasonably allocate production resources and reduce the production cost per unit product. Hence, the research on a…
Abstract
Purpose
In intelligent scheduling, parallel batch processing can reasonably allocate production resources and reduce the production cost per unit product. Hence, the research on a parallel batch scheduling problem (PBSP) with uncertain job size is of great significance to realize the flexibility of product production and mass customization of personalized products.
Design/methodology/approach
The authors propose a robust formulation in which the job size is defined by budget constrained support. For obtaining the robust solution of the robust PBSP, the authors propose an exact algorithm based on branch-and-price framework, where the pricing subproblem can be reduced to a robust shortest path problem with resource constraints. The robust subproblem is transformed into a deterministic mixed integer programming by duality. A series of deterministic shortest path problems with resource constraints is derived from the programming for which the authors design an efficient label-setting algorithm with a strong dominance rule.
Findings
The authors test the performance of the proposed algorithm on the extension of benchmark instances in literature and compare the infeasible rate of robust and deterministic solutions in simulated scenarios. The authors' results show the efficiency of the authors' algorithm and importance of incorporating uncertainties in the problem.
Originality/value
This work is the first to study the PBSP with uncertain size. To solve this problem, the authors design an efficient exact algorithm based on Dantzig–Wolfe decomposition. This can not only enrich the intelligent manufacturing theory related to parallel batch scheduling but also provide ideas for relevant enterprises to solve problems.
Details
Keywords
G.V. CHALY, S.G. ZLOTNIK, A.I. LAZEBNIK and G.V. SPIRIDONOVA
In this paper two effective algorithms are given for optimizing power systems schedules. These algorithms are based on the simplex method. Rapid convergence of the iterative…
Abstract
In this paper two effective algorithms are given for optimizing power systems schedules. These algorithms are based on the simplex method. Rapid convergence of the iterative processes, on which these algorithms are based, and a relatively brief calculation time at each iterative step lead to a high efficiency of the procedure for optimizing the schedules.
Matthew Gilbert and Andrew Tyas
Computerized layout (or “topology”) optimization was pioneered almost four decades back. However, despite dramatic increases in available computer power and the application of…
Abstract
Computerized layout (or “topology”) optimization was pioneered almost four decades back. However, despite dramatic increases in available computer power and the application of increasingly efficient optimization algorithms, even now only relatively modest sized problems can be tackled using the traditional “ground structure” approach. This is because of the need, in general, for the latter to contain every conceivable member connecting together the nodes in a problem. A simple, but effective solution method capable of tackling problems with large numbers of potential members (e.g. >100,000,000) is presented. Though the method draws on the linear programming technique of “column generation”, since layout optimization specific heuristics are employed it is presented as an iterative “member adding” method. The method requires a ground structure with minimal connectivity to be used in the first iteration; members are then added as required in subsequent iterations until the (provably) optimal solution is found.
Details
Keywords
Fabián Castaño and Nubia Velasco
To solve the problem, a mathematical model is proposed; it relies on a directed acyclic graph (DAG), in which arcs are used to indicate whether a pair of appointments can be…
Abstract
Purpose
To solve the problem, a mathematical model is proposed; it relies on a directed acyclic graph (DAG), in which arcs are used to indicate whether a pair of appointments can be assigned to the same route or not (and so to the same care worker). The proposed model aims at minimizing the personnel required to meet daily demand and balancing workloads among the workers while considering the varying traffic patterns derived from traffic congestion.
Design/methodology/approach
This paper aims at providing solution approaches for addressing the problem of assigning care workers to deliver home health-care (HHC) services, demanding different skills each. First, a capacity planning problem is considered, where it is necessary to define the number of workers required to satisfy patients' requests and then, patients are assigned to the care workers along with the sequence followed to visit them, thus solving a scheduling problem. The benefits obtained by permitting patients to propose multiple time slots where they can be served are also explored.
Findings
The results indicate that the problem can be efficiently solved for medium-sized instances, that is, up to 100 daily patient requests. It is also indicated that asking patients to propose several moments when they can receive services helps to minimize the need for care workers through more efficient route allocations without affecting significantly the balance of the workloads.
Originality/value
This article provides a new framework for modeling and solving a HHC routing problem with multiskilled personnel. The proposed model can be used to identify efficient daily plans and can handle realistic characteristics such as time-dependent travel times or be extended to other real-life applications such as maintenance scheduling problems.
Details
Keywords
Daniel Esene Okojie, Adisa Abdul-Ganiyu Jimoh, Yskandar Hamam and Adebayo Ademola Yusuff
This paper aims to survey the need for full capacity utilisation of transmission lines in power systems network operations. It proposes a review of the N-1 security criterion that…
Abstract
Purpose
This paper aims to survey the need for full capacity utilisation of transmission lines in power systems network operations. It proposes a review of the N-1 security criterion that does not ensure reliable dispatch of optimum power flow during outage contingency. The survey aims to enlarge the network capacity utilisation to rely on the entire transmission lines network operation.
Design/methodology/approach
The paper suggests transmission line switching (TLS) approach as a viable corrective mechanism for power dispatch. The TLS process is incorporated into a constraint programming language extension optimisation solver that selects the switchable line candidates as integer variables in the mixed integer programming problem.
Findings
The paper provides a practical awareness of reserve capacity in the lines that provide network security in outage contingency. At optimum power flow dispatch, the TLS is extended to optimal transmission line switching (OTLS) that indicates optimal capacity utilisation (OCU) of the available reserve capacity (ARC) in the network lines.
Practical implications
Computational efficiency influenced the extension of the OTLS to optimal transmission switching of power flow (OTSPF). The application of OTSPF helps reduce the use of flexible AC transmission systems (FACTS) and construction of new transmission lines..
Originality/value
The paper surveys TLS efforts in network capacity utilisation. The suggested ARC fulfils the need for an index with which the dispatchable lines may be identified for the optimal capacity utilisation of transmission lines network.
The purpose of this study is to develop an immune genetic algorithm (IGA) to solve the simple assembly line balancing problem of type 1 (SALBP-1). The objective is to minimize the…
Abstract
Purpose
The purpose of this study is to develop an immune genetic algorithm (IGA) to solve the simple assembly line balancing problem of type 1 (SALBP-1). The objective is to minimize the number of workstations and workstation load for a given cycle time of the assembly line.
Design/methodology/approach
This paper develops a new solution method for SALBP-1, and a user-defined function named ψ(·) is proposed to convert all the individuals to satisfy the precedence relationships during the operation of IGA.
Findings
Computational experiments suggest that the proposed method is efficient.
Originality/value
An IGA is proposed to solve the SALBP-1 for the first time.
Details
Keywords
In this paper, the author introduces a new variant of the pickup and delivery transportation problem, where one commodity is collected from many pickup locations to be delivered…
Abstract
Purpose
In this paper, the author introduces a new variant of the pickup and delivery transportation problem, where one commodity is collected from many pickup locations to be delivered to many delivery locations within pre-specified time windows (one–to many–to many). The author denotes to this new variant as the 1-commodity pickup-and-delivery vehicle routing problem with soft time windows (1-PDVRPTW).
Design/methodology/approach
The author proposes a hybrid genetic algorithm and a scatter search to solve the 1-PDVRPTW. It proposes a new constructive heuristic to generate the initial population solution and a scatter search (SS) after the crossover and mutation operators as a local search. The hybrid genetic scatter search replaces two steps in SS with crossover and mutation, respectively.
Findings
So, the author proposes a greedy local search algorithm as a metaheuristic to solve the 1-PDVRPTW. Then, the author proposes to hybridize the metaheuristic to solve this variant and to make a good comparison with solutions presented in the literature.
Originality/value
The author considers that this is the first application in one commodity. The solution methodology based on scatter search method combines a set of diverse and high-quality candidate solutions by considering the weights and constraints of each solution.
Details