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 study is to develop a holistic optimization model for an integrated sustainable fleet planning and closed-loop supply chain (CLSC) network design problem under uncertainty.

A novel mixed-integer programming model that is able to consider interactions between vehicle fleet planning and CLSC network design problems is first developed. Uncertainties of the product demand and return fractions of the end-of-life products are handled by a chance-constrained stochastic program. Several Pareto optimal solutions are generated for the conflicting sustainability objectives via compromise and fuzzy goal programming (FGP) approaches.

The proposed model is tested on a real-life lead/acid battery recovery system. By using the proposed model, sustainable fleet plans that provide a smaller fleet size, fewer empty vehicle repositions, minimal CO₂ emissions, maximal vehicle safety ratings and minimal injury/illness incidence rate of transport accidents are generated. Furthermore, an environmentally and socially conscious CLSC network with maximal job creation in the less developed regions, minimal lost days resulting from the work's damages during manufacturing/recycling operations and maximal collection/recovery of end-of-life products is also designed.

Unlike the classical network design models, vehicle fleet planning decisions such as fleet sizing/composition, fleet assignment, vehicle inventory control, empty repositioning, etc. are also considered while designing a sustainable CLSC network. In addition to sustainability indicators in the network design, sustainability factors in fleet management are also handled. To the best of the authors' knowledge, there is no similar paper in the literature that proposes such a holistic optimization model for integrated sustainable fleet planning and CLSC network design.

The purpose of this paper is to propose a framework to identify all the feasible disassembly sequences for a multi‐component product and to find an optimal disassembly sequence, according to specific criteria such as cost, duration, profit, etc.

Taking into account topological and geometrical constraints of a product structure, an AND/OR disassembly graph is built. Each graph node represents a feasible subassembly. Two nodes i and j are connected by an arc (i, j), called a transition, if the subassembly j can be obtained from the subassembly i by removing one or several connectors. Constraint programming approach is used to generate the feasible subassemblies and related transitions.

If a cost z_ij is incurred to perform a transition (i, j), an optimal disassembly sequence can be generated for a given subassembly, using the shortest path algorithm or a linear programming model.

The proposed approach performs very well compared to other approaches published in the literature, even when applied to products requiring parallel disassembly and including a large number of parts.

This approach has been successfully applied to assess the wheelchair maintainability at the design stage and will be implemented in CAD systems. One other application, regarding the disassembly process and total revenue maximization for product recycling, is now under consideration.

Applying constraint programming to efficiently generate the set of the feasible subassemblies constitutes the main contribution in this paper. This process is the hardest step in the disassembly sequencing problem.

The purpose of this paper is to present a new method for solving parametric programming problems; a new scheme of constraints fuzzification. In the proposed approach, constraints are learned based on deductive learning.

Adaptive neural‐fuzzy inference system (ANFIS) is used for constraint learning by generating input and output membership functions and suitable fuzzy rules.

The experimental results show the ability of the proposed approach to model the set of constraints and solve parametric programming. Some notes in the proposed method are clustering of similar constraints, constraints generalization and converting crisp set of constraints to a trained system with fuzzy output. Finally, this idea for modeling of constraint in the support vector machine (SVM) classifier is used and shows that this approach can obtain a soft margin in the SVM.

Properties of the new scheme such as global view of constraints, constraints generalization, clustering of similar constraints, creation of real fuzzy constraints, study of constraint strength and increasing the degree of importance to constraints are different aspects of the proposed method.

Logistics is the part of the supply chain (SC) that plans, executes and handles forward and reverse movement and storage of products, services and related information, in order to respond to customers' needs effectively and efficiently. The main concern for logistics is to ensure that the correct product is placed at the right time. This paper introduces a linear model of shipping focused on decision-making, which includes configuration of shipping network, choosing of transport means and transfer of individual customer shipments through a particular transport system.

In this study, authors try to address the problem of supply chain network (SCN) where the primary goal is to determine the appropriate order allocation of products from different sources to different destinations. They also seek to minimize total transportation cost and inventory cost by simultaneously determining optimal locations, flows and shipment composition. The formulated problem of getting optimal allocation turns out to be a problem of multi-objective programming, and it is solved by using the max-addition fuzzy goal programming approach, for obtaining optimal order allocation of products. Furthermore, the problem demand and supply parameters have been considered random in nature, and the maximum likelihood estimation approach has been used to assess the unknown probabilistic distribution parameters with a specified probability level (SPL).

A case study has also been applied for examining the effectiveness and applicability of the developed multi-objective model and the proposed solution methods. Results of this study are very relevant for the manufacturing sector in particular, for those facing logistics issues in SCN. It enables researchers and managers to cope with various types of uncertainty and logistics risks associated with SCN.

The principal contribution of the proposed model is the improved modelling of transportation and inventory, which are affected by different characteristics of SCN. To demonstrate computational information of the suggested methods and proposed model, a case illustration of SCN is provided. Also, environmentalism is increasingly becoming a significant global concern. Hence, the concept proposed could be extended to include environmental aspects as an objective function or constraint.

Efficient integration of logistical cost components, such as transportation costs, inventory costs, with mathematical programming models is an important open issue in logistics optimization. This study expands conventional facility location models to incorporate a range of logistic system elements such as transportation cost and different types of inventory cost, in a multi-product, multi-site network. The research is original and is focused on case studies of real life.

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.

Airspace sectorization is an important task, which has a significant impact in the everyday work of air control services. Especially in recent years, because of the constant increase in air traffic, existing airspace sectorization techniques have difficulties to tackle the large air traffic volumes, creating imbalanced sectors and uneven workload distribution among sectors. The purpose of this paper is to propose a new approach to find optimal airspace sectorization balancing the traffic controller workload between sectors, subject to airspace requirements.

A constraint programming (CP) model called equitable airspace sectorization problem (EQASP) relies on ordered weighted averaging (OWA) multiagent optimization and the parallel portfolio architecture has been developed, which integrates the equity into an existing CP approach (Trandac et al., 2005). The EQASP was evaluated and compared with the method of Trandac et al. (2005), according to the quality of workload balancing between sectors and the resolution performance. The comparison was achieved using real air traffic low-altitude network data sets of French airspace for five flight information regions for 24 h a day and the Algerian airspace for three various periods (off peak hours, peak hours and 24 h).

It has been demonstrated that the proposed EQASP model, which is based on OWA multicriteria optimization method, significantly improved both the solving performance and the workload equity between sectors, while offering strong theoretical properties of the balancing requirement. Interestingly, when solving hard instances, our parallel sectorization tool can provide, at any time, a workable solution, which satisfies all geometric constraints of sectorization.

This study can be used to design well-balanced air sectors in terms of workload between control units in the strategic phase. To fulfil the airspace users’ constraints, one can refer to this study to assess the capacity of each air sector (especially the overloaded sectors) and then adjust the sector’s shape to respond to the dynamic changes in traffic patterns.

This theoretical and practical approach enables the development and support of the definition of the “Air traffic management (ATM) Concept Target” through improvements in human factors specifically (balancing workload across sectors), which contributes to raising the level of capacity, safety and efficiency (SESAR Vision of ATM 2035).

In their approach, the authors proposed an OWA-based multiagent optimization model, ensuring the search for the best equitable solution, without requiring user-defined balancing constraints, which enforce each sector to have a workload between two user-defined bounds (W_min, W_max).

Distribution network design involves a set of strategic decisions in supply chains because of their long-term impacts on the total logistics cost and environment. To incorporate a trade-off between financial and environmental aspects of these decisions, this paper aims to determine an optimal location, among candidate locations, of a new logistics center, its capacity, as well as optimal network flows for an existing distribution network, while concurrently minimizing the total logistics cost and gas emission. In addition, uncertainty in transportation and warehousing costs are considered.

The problem is formulated as a fuzzy multiobjective mathematical model. The effectiveness of this model is demonstrated using an industrial case study. The problem instance is a four-echelon distribution network with 22 products and a planning horizon of 20 periods. The model is solved by using the min–max and augmented ε-constraint methods with CPLEX as the solver. In addition to illustrating model’s applicability, the effect of choosing a new warehouse in the model is investigated through a scenario analysis.

For the applicability of the model, the results indicate that the augmented ε-constraint approach provides a set of Pareto solutions, which represents the ideal trade-off between the total logistics cost and gas emission. Through a case study problem instance, the augmented ε-constraint approach is recommended for similar network design problems. From a scenario analysis, when the operational cost of the new warehouse is within a specific fraction of the warehousing cost of third-party warehouses, the solution with the new warehouse outperforms that without the new warehouse with respective to financial and environmental objectives.

The proposed model is an effective decision support tool for management, who would like to assess the impact of network planning decisions on the performance of their supply chains with respect to both financial and environmental aspects under uncertainty.

A common problem that many universities face, especially with their specialized programs, is coordinating faculty availability and class offerings. The schedule is usually developed using paper and pencil after numerous iterations. As a result, the objectives of the program, such as course integration, length of course, and student workload, are most likely compromised in lieu of faculty availability. This chapter describes a multiple objective approach to this class assignment problem that considers the program’s objectives and faculty preferences. The results of applying this class assignment model to an Executive MBA (EMBA) program are presented.

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.