检索结果-内蒙古大学图书馆

Closed-loop coordination of inland vessels operations in large seaports using hybrid logic-based benders decomposition

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2017年第Jan.期97卷 1-21页

作者： Li, Shijie Negenborn, Rudy R. Lodewijks, Gabriel Delft Univ Technol Dept Maritime & Transport Technol Mekelweg 2 NL-2628 CD Delft Netherlands

This paper addresses two coordination problems that exist in the waterborne transport in large seaports, the long time of stay of inland vessels and insufficient terminal and quay crane planning with respect to their sailing schedules. A novel coordinator' model is proposed and tackled using logic-based Benders decomposition and Large Neighborhood Search. In addition, a closed-loop perspective is taken, in which possible disturbances that may occur are considered. Simulation results show that our approach can scale to real world sizes and provide better schedules for inland vessels within the port. The potential of using inland vessels for inter-terminal transport is also extensively investigated. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Vessel rotation planning constraint programming Benders decomposition

来源：评论

学校读者我要写书评

暂无评论

Solving the manufacturing cell design problem using the modified binary firefly algorithm and the egyptian vulture optimisation algorithm

引用

IET SOFTWARE 2017年第3期11卷 105-115页

作者： Almonacid, Boris Aspee, Fabian Soto, Ricardo Crawford, Broderick Lama, Jacqueline Pontificia Univ Catolica Valparaiso Valparaiso Chile

The manufacturing cell design problem (MCDP) aims to minimise the movements of parts between the production cells. The MCDP is an NP-Hard optimisation problem with a binary domain. For the resolution of the MCDP, the authors employ the firefly algorithm (FA) metaheuristic. FA is a metaheuristic with a real domain;therefore, an efficient method for transfer and discretisation from the real domain to the binary domain has been used. The second metaheuristic used is Egyptian vulture optimisation algorithm (EVOA). EVOA is a recent metaheuristic inspired by the behaviour of the Egyptian vulture bird. EVOA uses a set of operators which must be adapted to the MCDP optimisation problem. Two types of experiments have been performed. The first experiment consists of solving the MCDP with a set of 90 homogeneous incidence matrices. In the tests, FA and EVOA have been used obtaining good results. Subsequently, the obtained results have been compared versus other eight metaheuristics. The second experiment consists in a set of 35 inhomogeneous incidence matrices. The global optimum value for 13 problems has been obtained using constraint programming. Finally, for the other 22 problems, the authors have reported the best values found using FA and EVOA.

关键词： cellular manufacturing design engineering optimisation computational complexity constraint handling matrix algebra manufacturing cell design problem modified binary firefly algorithm Egyptian vulture optimisation algorithm production cells NP-hard optimisation problem binary domain FA metaheuristic EVOA Egyptian vulture bird MCDP optimisation problem homogeneous incidence matrices constraint programming

来源：评论

学校读者我要写书评

暂无评论

Improving quality and efficiency in home health care: An application of constraint logic programming for the ferrara NHS unit

Improving quality and efficiency in home health care: An app...

引用

28th International Conference on Logic programming, ICLP 2012

作者： Cattafi, Massimiliano Herrero, Rosa Gavanelli, Marco Nonato, Maddalena Malucelli, Federico Ramos, Juan José ENDIF Università di Ferrara Italy Dept. de Telecomunicació I Enginyeria de Sistemes UAB Spain Dipartimento di Elettronica E Informazione Politecnico di Milano Italy

ISBN: (纸本)9783939897439

Although sometimes it is necessary, no one likes to stay in a hospital, and patients who need to stay in bed but do not require constant medical surveillance prefer their own bed at home. At the same time, a patient in a hospital has a high cost for the community, that is not acceptable if the patient needs service only a few minutes a day. For these reasons, the current trend in Europe and North-America is to send nurses to visit patients in their home: This choice reduces costs for the community and gives better quality of life to patients. On the other hand, it introduces the combinatorial problem of assigning patients to the available nurses in order to maximize the quality of service, without having nurses travel for overly long distances. In this paper, we describe the problem as a practical application of constraint Logic programming. We first introduce the problem, as it is currently addressed by the nurses in the National Health Service (NHS) in Ferrara, a mid-sized city in the North of Italy. Currently, the nurses solve the problem by hand, and this introduces several inefficiencies in the schedules. We formalize the problem, obtained by interacting with the nurses in the NHS, into a constraint Logic programming model. In order to solve the problem efficiently, we implemented a new constraint that tackles with the routing part of the problem. We propose a declarative semantics for the new constraint, and an implementation based on an external solver. © M. Cattafi, R. Herrero, M. Gavanelli, M. Nonato, F. Malucelli, and J.J. Ramos.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Solving production scheduling with earliness/tardiness penalties by constraint programming

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2011年第4期22卷 553-562页

作者： Kelbel, Jan Hanzalek, Zdenek Czech Tech Univ Fac Elect Engn Dept Control Engn Prague 12135 2 Czech Republic

This paper deals with an application of constraint programming in production scheduling with earliness and tardiness penalties that reflects the scheduling part of the Just-In-Time inventory strategy. Two scheduling problems are studied, an industrial case study problem of lacquer production scheduling, and also the job-shop scheduling problem with earliness/tardiness costs. The paper presents two algorithms that help the constraint programming solver to find solutions of these complex problems. The first algorithm, called the cost directed initialization, performs a greedy initialization of the search tree. The second one, called the time reversing transformation and designed for lacquer production scheduling, reformulates the problem to be more easily searchable when the default search or the cost directed initialization is used. The conducted experiments, using case study instances and randomly generated problem instances, show that our algorithms outperform generic approaches, and on average give better results than other nontrivial algorithms.

关键词： Production scheduling Earliness/tardiness cost constraint programming

来源：评论

学校读者我要写书评

暂无评论

Sketched Answer Set programming 30

Sketched Answer Set Programming

引用

30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Paramonov, Sergey Bessiere, Christian Dries, Anton De Raedt, Luc Katholieke Univ Leuven Leuven Belgium CNRS LIRMM Montpellier France

ISBN: (纸本)9781538674499

Answer Set programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models can be hard. We propose a novel method, called Sketched Answer Set programming (SkASP), aimed at facilitating this. In SkASP, the user writes partial ASP programs, in which uncertain parts are left open and marked with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. SkASP then synthesises a complete ASP program. This is realized by rewriting the SkASP program into another ASP program, which can then be solved by traditional ASP solvers. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karps 21 NP-complete problems and on publicly available ASP encodings.

关键词： inductive logic programming constraint learning answer set programming sketching constraint programming relational learning

来源：评论

学校读者我要写书评

暂无评论

Local and global symmetry breaking in itemset mining

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2017年第1期80卷 91-112页

作者： Benhamou, Belaid Aix Marseille Univ LSIS Domaine Univ St Jerome F-13397 Marseille 20 France

The concept of symmetry has been extensively studied in the field of constraint programming and in the propositional satisfiability. Several methods for detection and removal of these symmetries have been developed, and their use in known solvers of these domains improved dramatically their effectiveness on a big variety of problems considered difficult to solve. The concept of symmetry may be exported to other areas where some structures can be exploited effectively. Particularly, in the area of data mining where some tasks can be expressed as constraints or logical formulas. We are interested here, by the detection and elimination of local and global symmetries in the item-set mining problem. Recent works have provided effective encodings as Boolean constraints for these data mining tasks and some idea on symmetry elimination in this area begin to appear, but still few and the techniques presented are often on global symmetry that is detected and eliminated statically in a preprocessing phase. In this work we study the notion of local symmetry and compare it to global symmetry for the itemset mining problem. We show how local symmetries of the boolean encoding can be detected dynamically and give some properties that allow to eliminate theses symmetries in SAT-based itemset mining solvers in order to enhance their efficiency.

关键词： Symmetry Item-set mining Data mining Satisfiability constraint programming

来源：评论

学校读者我要写书评

暂无评论

Learning discrete decomposable graphical models via constraint optimization

引用

STATISTICS AND COMPUTING 2017年第1期27卷 115-130页

作者： Janhunen, Tomi Gebser, Martin Rintanen, Jussi Nyman, Henrik Pensar, Johan Corander, Jukka Aalto Univ Dept Comp Sci Espoo Finland Univ Potsdam Potsdam Germany Griffith Univ Brisbane Qld Australia Abo Akad Univ Dept Math & Stat Turku Finland Univ Helsinki Dept Math & Stat Helsinki Finland

Statistical model learning problems are traditionally solved using either heuristic greedy optimization or stochastic simulation, such as Markov chain Monte Carlo or simulated annealing. Recently, there has been an increasing interest in the use of combinatorial search methods, including those based on computational logic. Some of these methods are particularly attractive since they can also be successful in proving the global optimality of solutions, in contrast to stochastic algorithms that only guarantee optimality at the limit. Here we improve and generalize a recently introduced constraint-based method for learning undirected graphical models. The new method combines perfect elimination orderings with various strategies for solution pruning and offers a dramatic improvement both in terms of time and memory complexity. We also show that the method is capable of efficiently handling a more general class of models, called stratified/labeled graphical models, which have an astronomically larger model space.

关键词： Graphical models Structure learning constraint programming Satisfiability MAXSAT Answer set programming

来源：评论

学校读者我要写书评

暂无评论

Computational Flux Balance Analysis Predicts that Stimulation of Energy Metabolism in Astrocytes and their Metabolic Interactions with Neurons Depend on Uptake of K⁺ Rather than Glutamate

引用

NEUROCHEMICAL RESEARCH 2017年第1期42卷 202-216页

作者： DiNuzzo, Mauro Giove, Federico Maraviglia, Bruno Mangia, Silvia Univ Copenhagen Ctr Basic & Translat Neurosci Fac Hlth & Med Sci Blegdamsvej 3B24-2-40 DK-2200 Copenhagen N Denmark Museo Stor Fis Rome Italy Ctr Studi & Ric Enrico Fermi Rome Italy Fdn Santa Lucia IRCCS Rome Italy Univ Minnesota Dept Radiol Ctr Magnet Resonance Res Minneapolis MN 55455 USA

Brain activity involves essential functional and metabolic interactions between neurons and astrocytes. The importance of astrocytic functions to neuronal signaling is supported by many experiments reporting high rates of energy consumption and oxidative metabolism in these glial cells. In the brain, almost all energy is consumed by the Na+/K+ ATPase, which hydrolyzes 1 ATP to move 3 Na+ outside and 2 K+ inside the cells. Astrocytes are commonly thought to be primarily involved in transmitter glutamate cycling, a mechanism that however only accounts for few % of brain energy utilization. In order to examine the participation of astrocytic energy metabolism in brain ion homeostasis, here we attempted to devise a simple stoichiometric relation linking glutamatergic neurotransmission to Na+ and K+ ionic currents. To this end, we took into account ion pumps and voltage/ligand-gated channels using the stoichiometry derived from available energy budget for neocortical signaling and incorporated this stoichiometric relation into a computational metabolic model of neuron-astrocyte interactions. We aimed at reproducing the experimental observations about rates of metabolic pathways obtained by C-13-NMR spectroscopy in rodent brain. When simulated data matched experiments as well as biophysical calculations, the stoichiometry for voltage/ligand-gated Na+ and K+ fluxes generated by neuronal activity was close to a 1: 1 relationship, and specifically 63/58 Na+/K+ ions per glutamate released. We found that astrocytes are stimulated by the extracellular K+ exiting neurons in excess of the 3/2 Na+/K+ ratio underlying Na+/K+ ATPase-catalyzed reaction. Analysis of correlations between neuronal and astrocytic processes indicated that astrocytic K+ uptake, but not astrocytic Na+-coupled glutamate uptake, is instrumental for the establishment of neuron-astrocytic metabolic partnership. Our results emphasize the importance of K+ in stimulating the activation of astrocytes, which is rele

关键词： Brain energy metabolism Potassium Neuron-astrocyte interactions constraint programming Flux balance analysis

来源：评论

学校读者我要写书评

暂无评论

A constraint programming-based solution approach for medical resident scheduling problems

引用

COMPUTERS & OPERATIONS RESEARCH 2011年第1期38卷 246-255页

作者： Topaloglu, Seyda Ozkarahan, Irem Dokuz Eylul Univ Dept Ind Engn TR-35160 Izmir Turkey Troy Univ Montgomery Dept Comp Sci Montgomery AL 36104 USA

Persistent calls come from within the graduate medical education community and from external sources for regulating the resident duty hours in order to meet the obligations about the quality of resident education, the well-being of residents themselves, and the quality of patient care services. The report of the Accreditation Council for Graduate Medical Education (ACGME) proposes common program requirements for resident hours. In this paper, we first develop a mixed-integer programming model for scheduling residents' duty hours considering the on-call night, day-off, rest period, and total work-hour ACGME regulations as well as the demand coverage requirements of the residency program. Subsequently, we propose a column generation model that consists of a master problem and an auxiliary problem. The master problem finds a configuration of individual schedules that minimizes the sum of deviations from the desired service levels for the day and night periods. The formulation of this problem is possible by representing the feasible schedules using column variables, whereas the auxiliary problem finds the whole set of feasible schedules using constraint programming. The proposed approach has been tested on a series of problems using real data obtained from a hospital. The results indicate that high-quality schedules can be obtained within a few seconds. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Medical resident scheduling Mixed-integer programming constraint programming Accreditation Council for Graduate Medical Education Duty hours

来源：评论

学校读者我要写书评

暂无评论

A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs 18

A Scheduling-Based Approach to Multi-Agent Path Finding with...

引用

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems

作者： Roman Barták Ji?í Švancara Marek Vlk Charles University Prague Czech Rep Charles University & Czech Technical University in Prague Prague Czech Rep

Multi-agent path finding (MAPF) deals with the problem of finding a collision-free path for a set of agents. The agents are located at nodes of a directed graph, they can move over the arcs, and each agent has its own destination node. It is not possible for two agents to be at the same node at the same time. The usual setting is that each arc has length one so at any time step, each agent either stays in the node, where it is, or moves to one of its neighboring nodes. This paper suggests to model the MAPF problem using scheduling techniques, namely, nodes and arcs are seen as resources. The concept of optional activities is used to model which nodes and arcs an agent will visit. We first describe a model, where each agent can visit each node at most once. Then, we extend the model to allow agents re-visiting the *** major motivation for the scheduling model of MAPF is its capability to naturally include other constraints. We will study particularly the problems, where the capacity of arcs can be greater than one (more agents can use the same arc at the same time), and the lengths of arcs can be greater than one (moving between different pairs of nodes takes different times). These extensions make the model closer to reality than the original MAPF formulation. We compare the efficiency of models experimentally.

关键词： capacity constraints path finding multiple agents scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：