Search results

The conducted examination of programming affordances and constraints had the purpose of adding knowledge and value that facilitate the on-going national curricula revision; knowledge that also could be of general interest outside the Swedish K-12 context.

With a qualitative approach, the study was conducted as a document analysis where submitted lesson plans were the base for a directed content analysis.

This study presents findings on how the involvement of programming in mathematics and technology have potential to foster engagement and motivation among students. Findings also indicate that the implementation of programming can develop important general skills that go beyond the boundaries of mathematics and technology. Moreover, the identified constraints could be valuable to improve the on-going curriculum development for K-12 mathematics and technology.

This qualitative study was conducted on a relatively small number of teachers where the majority has taken the courses on a voluntary basis. An important complement would be to conduct a larger quantitative study with data from a more general sample of K-12 teachers.

Results and discussions provide guidance for K-12 teachers and other stakeholders who want to introduce programming as a complementary tool in teaching and learning activities.

The study has a contribution to the on-going implementation of the Swedish national curricula for K-12 mathematics and technology.

During the last years, many studies have been published on teacher training in programming, and how the training can be improved. This study goes beyond the actual teacher training and examine aspects teachers translate to theirs daily work after completing the training.

The purpose of this paper is the need to build a novel approach that would allow flexible modeling and solving of food supply chain management (FSCM) problems. The models developed would use the data (data-driven modeling) as early as possible at the modeling phase, which would lead to a better and more realistic representation of the problems being modeled.

An essential feature of the presented approach is its declarativeness. The use of a declarative approach that additionally includes constraint satisfaction problems and provides an opportunity of fast and easy modeling of constrains different in type and character. Implementation of the proposed approach was performed with the use of an original hybrid method in which constraint logic programming (CLP) and mathematical programming (MP) are integrated and transformation of a model is used as a presolving technique.

The proposed constraint-driven approach has proved to be extremely flexible and efficient. The findings obtained during part of experiments dedicated to efficiency were very interesting. The use of the constraint-driven approach has enabled finding a solution depending on the instance data up to 1,000 times faster than using the MP.

Due to the limited use of exact methods for NP-hard problems, the future study should be to integrate the CLP with environments other than the MP. It is also possible, e.g., with metaheuristics like genetic algorithms, ant colony optimization, etc.

There is a possibility of using the approach as a basis to build a decision support system for FSCM, simple integration with databases, enterprise resource planning systems, management information systems, etc.

The new constraint-driven approach to FSCM has been proposed. The proposed approach is an extension of the hybrid approach. Also, a new decision-making model of distribution and logistics for the food supply chain is built. A presolving technique for this model has been presented.

The paper aims to propose a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day.

This paper proposes a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. The access channel serves as a gate for vessels entering or leaving the port. During low-depth tidal periods the vessels with deep drafts have to wait until the depth of the access channel reaches the required depth.

A number of numerical experiments are performed using the operational data collected from Port of Bandar Abbas (Iran). Results demonstrate that the suggested methodology is able to improve the existing port operations and significantly decrease delayed vessel departures.

The contribution of this study to the state of the art is a novel mathematical model for allocation and scheduling of vessels at multiple terminals of the same port, taking into consideration channel depth variations by time of day. To the best of the authors’ knowledge, this is the first continuous berth scheduling linear model that addresses the tidal effects on berth scheduling (both in terms of vessel arrival and departure at/from the berth) at multiple marine container terminals.

Disaster management and humanitarian logistics (HT) play crucial roles in large-scale events such as earthquakes, floods, hurricanes and tsunamis. Well-organized disaster response is crucial for effectively managing medical centres, staff allocation and casualty distribution during emergencies. To address this issue, this study aims to introduce a multi-objective stochastic programming model to enhance disaster preparedness and response, focusing on the critical first 72 h after earthquakes. The purpose is to optimize the allocation of resources, temporary medical centres and medical staff to save lives effectively.

This study uses stochastic programming-based dynamic modelling and a discrete-time Markov Chain to address uncertainty. The model considers potential road and hospital damage and distance limits and introduces an a-reliability level for untreated casualties. It divides the initial 72 h into four periods to capture earthquake dynamics.

Using a real case study in Istanbul’s Kartal district, the model’s effectiveness is demonstrated for earthquake scenarios. Key insights include optimal medical centre locations, required capacities, necessary medical staff and casualty allocation strategies, all vital for efficient disaster response within the critical first 72 h.

This study innovates by integrating stochastic programming and dynamic modelling to tackle post-disaster medical response. The use of a Markov Chain for uncertain health conditions and focus on the immediate aftermath of earthquakes offer practical value. By optimizing resource allocation amid uncertainties, the study contributes significantly to disaster management and HT research.

Environmental issues have become an important concern in modern supply chain management. The structure of closed-loop supply chain (CLSC) networks, which considers both forward and reverse logistics, can greatly improve the utilization of materials and enhance the performance of the supply chain in coping with environmental impacts and cost control.

A biobjective mixed-integer programming model is developed to achieve the balance between environmental impact control and operational cost reduction. Various factors regarding the capacity level and the environmental level of facilities are incorporated in this study. The scenario-based method and the Epsilon method are employed to solve the stochastic programming model under uncertain demand.

The proposed stochastic mixed-integer programming (MIP) model is an effective way of formulating and solving the CLSC network design problem. The reliability and precision of the Epsilon method are verified based on the numerical experiments. Conversion efficiency calculation can achieve the trade-off between cost control and CO₂ emissions. Managers should pay more attention to activities about facility operation. These nodes might be the main factors of costs and environmental impacts in the CLSC network. Both costs and CO₂ emissions are influenced by return rate especially costs. Managers should be discreet in coping with cost control for CO₂ emissions barely affected by return rate. It is advisable to convert the double target into a single target by the idea of “Efficiency of CO₂ Emissions Control Reduction.” It can provide managers with a way to double-target conversion.

We proposed a biobjective optimization problem in the CLSC network considering environmental impact control and operational cost reduction. The scenario-based method and the Epsilon method are employed to solve the mixed-integer programming model under uncertain demand.

The purpose of this paper is to improve the tactical planning of the stakeholders of the midstream liquefied natural gas (LNG) supply chain, using an optimisation approach. The results can contribute to enhance the proactivity on significant investment decisions.

A decision support tool (DST) is proposed to minimise the operational cost of a fleet of vessels. Mixed integer linear programming (MILP) used to perform contract assignment combined with a genetic algorithm solution are the foundations of the DST. The aforementioned methods present a formulation of the maritime transportation problem from the scope of tramp shipping companies.

The validation of the DST through a realistic case study illustrates its potential in generating quantitative data about the cost of the midstream LNG supply chain and the annual operations schedule for a fleet of LNG vessels.

The LNG transportation scenarios included assumptions, which were required for resource reasons, such as omission of stochasticity. Notwithstanding the assumptions made, it is to the authors’ belief that the paper meets its objectives as described above.

Potential practitioners may exploit the results to make informed decisions on the operation of LNG vessels, charter rate quotes and/or redeployment of existing fleet.

The research has a novel approach as it combines the creation of practical management tool, with a comprehensive mathematical modelling, for the midstream LNG supply chain. Quantifying future fleet costs is an alternative approach, which may improve the planning procedure of a tramp shipping company.

The purpose of this paper is to provide an outline of the major contributions in the literature on the determination of the least distance in data envelopment analysis (DEA). The focus herein is primarily on methodological developments. Specifically, attention is mainly paid to modeling aspects, computational features, the satisfaction of properties and duality. Finally, some promising avenues of future research on this topic are stated.

DEA is a methodology based on mathematical programming for the assessment of relative efficiency of a set of decision-making units (DMUs) that use several inputs to produce several outputs. DEA is classified in the literature as a non-parametric method because it does not assume a particular functional form for the underlying production function and presents, in this sense, some outstanding properties: the efficiency of firms may be evaluated independently on the market prices of the inputs used and outputs produced; it may be easily used with multiple inputs and outputs; a single score of efficiency for each assessed organization is obtained; this technique ranks organizations based on relative efficiency; and finally, it yields benchmarking information. DEA models provide both benchmarking information and efficiency scores for each of the evaluated units when it is applied to a dataset of observations and variables (inputs and outputs). Without a doubt, this benchmarking information gives DEA a distinct advantage over other efficiency methodologies, such as stochastic frontier analysis (SFA). Technical inefficiency is typically measured in DEA as the distance between the observed unit and a “benchmarking” target on the estimated piece-wise linear efficient frontier. The choice of this target is critical for assessing the potential performance of each DMU in the sample, as well as for providing information on how to increase its performance. However, traditional DEA models yield targets that are determined by the “furthest” efficient projection to the evaluated DMU. The projected point on the efficient frontier obtained as such may not be a representative projection for the judged unit, and consequently, some authors in the literature have suggested determining closest targets instead. The general argument behind this idea is that closer targets suggest directions of enhancement for the inputs and outputs of the inefficient units that may lead them to the efficiency with less effort. Indeed, authors like Aparicio et al. (2007) have shown, in an application on airlines, that it is possible to find substantial differences between the targets provided by applying the criterion used by the traditional DEA models, and those obtained when the criterion of closeness is utilized for determining projection points on the efficient frontier. The determination of closest targets is connected to the calculation of the least distance from the evaluated unit to the efficient frontier of the reference technology. In fact, the former is usually computed through solving mathematical programming models associated with minimizing some type of distance (e.g. Euclidean). In this particular respect, the main contribution in the literature is the paper by Briec (1998) on Hölder distance functions, where formally technical inefficiency to the “weakly” efficient frontier is defined through mathematical distances.

All the interesting features of the determination of closest targets from a benchmarking point of view have generated, in recent times, the increasing interest of researchers in the calculation of the least distance to evaluate technical inefficiency (Aparicio et al., 2014a). So, in this paper, we present a general classification of published contributions, mainly from a methodological perspective, and additionally, we indicate avenues for further research on this topic. The approaches that we cite in this paper differ in the way that the idea of similarity is made operative. Similarity is, in this sense, implemented as the closeness between the values of the inputs and/or outputs of the assessed units and those of the obtained projections on the frontier of the reference production possibility set. Similarity may be measured through multiple distances and efficiency measures. In turn, the aim is to globally minimize DEA model slacks to determine the closest efficient targets. However, as we will show later in the text, minimizing a mathematical distance in DEA is not an easy task, as it is equivalent to minimizing the distance to the complement of a polyhedral set, which is not a convex set. This complexity will justify the existence of different alternatives for solving these types of models.

As we are aware, this is the first survey in this topic.

The purpose of this paper is to review the relevant literature in order to identify trends and suggest some possible directions for future research in the framework of humanitarian aid distribution logistics with accessibility constraints.

The authors developed a systematic literature review to study the state of the art on distribution logistics considering accessibility constraints. The electronic databases used were Web of science, Scopus, Science Direct, Jstor, Emerald, EBSCO, Scielo and Redalyc. As a result, 49 articles were reviewed in detail.

This study identified some gaps, as well as some research opportunities. The main conclusions are the need for further studies on the interrelationships and hierarchies of multiple actors, explore intermodality, transshipment options and redistribution relief goods to avoid severe shortages in some nodes and excess inventory in others, studies of the vulnerability of transport networks, correlational analysis of road failures and other future lines.

The bibliography is limited to peer-reviewed academic journals due to their academic relevance, accessibility and ease of searching. Most of the studies included in the review were conducted in high-income countries, which may limit the generalizability of the results to low-income countries. However, the authors focused on databases covering important journals on humanitarian logistics.

This paper contextualises and synthesises research into humanitarian aid distribution logistics with accessibility constrains, highlights key themes and suggests areas for further research.

The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of the periodic vehicle routing problem.

The conditions for seamless (collision-free) synchronization of periodically executed local transport processes presented in this paper guarantee cyclic execution of supply processes, thereby preventing traffic flow congestion.

Systems that satisfy this characteristic, cyclic deliveries executed along supply chains are given and what is sought is the number of vehicles needed to operate the local transport processes in order to ensure delivery from and to specific loading/unloading points on given dates. Determination of sufficient conditions guaranteeing the existence of feasible solutions that satisfy these constraints makes it possible to solve the considered class of problems online.

The computer experiments reported in this paper show the possibilities of practical application of the proposed approach in the construction of decision support systems for food supply chain management.

The aim of the present work is to develop a methodology for the synthesis of regularly structured supply networks that would ensure fixed cyclic execution of local transport processes. The proposed methodology, which implements sufficient conditions for the synchronization of local cyclic processes, allows one to develop a method for rapid prototyping of supply processes that satisfies the time windows constraints given.