ALMM Solver - Database Structure and Data Access Layer Architecture

Rączka, Krzysztof; Kucharska, Edyta

doi:10.1007/978-3-319-58274-0_43

Cited by 4 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An idea of solver using the ALMM methodology has been developed. However, work related to its implementation is still under in progress [45][46][47][48].…”

Section: Discussionmentioning

confidence: 99%

Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

Kucharska

2019

Symmetry

View full text Add to dashboard Cite

The Dynamic Vehicle Routing Problem (DVRP) is one of the most important problems in the area of enterprise logistics. DVRP problems involve these dynamics: the appearance of customers, travel times, service times, or vehicle availability. One of the most often considered aspects of the DVRP is the availability of customers, in which a part or all of the customers are revealed dynamically during the design or execution of the routes. A classification of the DVRP problem due to various elements causing dynamism is proposed. The aim of the paper is to distinguish dynamic VRP, which takes into account the dynamic appearance of customers to serve during the design or execution of the routes. In particular, the difference between the predictive and unexpected aspects of the customer’s availability is considered. Above all, the variant of customer’s availability which is predicted according to an appropriate general rule is modeled using the algebraic-logical meta-model (ALMM). It is a methodology which enables making collective decisions in successive process stages, not separately for individual vehicles. The algebraic-logical model of the dynamic vehicle routing problem with predicted consumer availability is proposed. The paper shows the possibilities of applying the ALMM approach to dynamic problems both with predicted and unexpected customer availability.

show abstract

“…An idea of solver using the ALMM methodology has been developed. However, work related to its implementation is still under in progress [45][46][47][48].…”

Section: Discussionmentioning

confidence: 99%

Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

Kucharska

2019

Symmetry

View full text Add to dashboard Cite

show abstract

“…This paper constitutes a summary and extension of previous work and represents a generalized method that can be applied to a wide class of scheduling problems. The presented research is also part of a team effort to build an ALMM solver-an IT tool to optimize discrete processes that involve complex dependencies or constraints [35][36][37][38][39][40].…”

Section: Introductionmentioning

confidence: 99%

Heuristic Method for Decision-Making in Common Scheduling Problems

Kucharska

2017

Applied Sciences

Self Cite

View full text Add to dashboard Cite

Abstract:The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM), which enables making collective decisions in successive process stages, not separately for individual objects or executors. Moreover, taking into account the limitations of the problem, it involves constructing only an acceptable solution and significantly reduces the amount of calculations. A general algorithm based on the presented method is composed of the following elements: preliminary analysis of the problem, techniques for the choice of decision at a given state, the pruning non-perspective trajectory, selection technique of the initial state for the trajectory final part, and the trajectory generation parameters modification. The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship between tasks is defined by the graph. The article also presents the results of computational experiments.

show abstract

ALMM Solver - Idea of Algorithm Module

Kucharska

Rączka

2018

Beyond Databases, Architectures and Structures. Facing the Challenges of Data Proliferation and Growing Variety

View full text Add to dashboard Cite

ALMM Solver - Database Structure and Data Access Layer Architecture

Cited by 4 publications

References 25 publications

Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

Heuristic Method for Decision-Making in Common Scheduling Problems

ALMM Solver - Idea of Algorithm Module

Contact Info

Product

Resources

About