Filters








109 Hits in 8.1 sec

A Task-Oriented Heuristic for Repairing Infeasible Solutions to Overlapping Coalition Structure Generation

Guofu Zhang, Zhaopin Su, Miqing Li, Meibin Qi, Jianguo Jiang, Xin Yao
2017 IEEE Transactions on Systems, Man & Cybernetics. Systems  
Next, we develop a generic task-oriented heuristic (TOH) for individual repairs that can be used in binary meta-heuristic algorithms (MHAs) to generate overlapping coalitions in a parallel manner.  ...  To tackle such situations, we first present a natural variation of the traditional OCF model and analyze the size of the solution space and the computational complexity of the overlapping coalition structure  ...  ACKNOWLEDGMENT The authors would like to thank Dr. R. Chen and K. Li for their fruitful discussions.  ... 
doi:10.1109/tsmc.2017.2712624 fatcat:jyajkiv7fjgwbfd5avbhou3meq

Searching for overlapping coalitions in multiple virtual organizations

Guofu Zhang, Jianguo Jiang, Zhaopin Su, Meibin Qi, Hua Fang
2010 Information Sciences  
Coalition formation is an active and essential component for multi-agent systems (MAS) in task-oriented domains in which tasks can be too complicated to be accomplished by a single agent with insufficient  ...  We introduce a two-dimensional binary encoding scheme and propose a novel repairing strategy for resolving conflicts over the usage of joint resources among overlapping coalitions.  ...  In particular, we would like to specify how to design and repair 2-D crossover and mutation operators.  ... 
doi:10.1016/j.ins.2010.04.028 fatcat:arbanvvftvfzjovbhan4seyili

Using Global Constraints for Local Search [chapter]

2001 Lecture Notes in Computer Science  
Other approaches take the general constraint programming framework as a starting point and try to introduce local search methods for constraint satisfaction.  ...  The use of global constraints for local search a l l o ws us to revise a current state on a more global level with domainspeci c knowledge, while preserving features like reusability and maintenance.  ...  Only very general rules apply, w h i c h are comparable to the problems of object-oriented design (see GHJV95] for a discussion and general guidelines).  ... 
doi:10.1007/3-540-45746-1_2 fatcat:e2nl2si56ffxbi4snbxv7vrtoq

Using global constraints for local search [chapter]

Alexander Nareyek
2001 Constraint Programming and Large Scale Discrete Optimization  
Other approaches take the general constraint programming framework as a starting point and try to introduce local search methods for constraint satisfaction.  ...  The use of global constraints for local search a l l o ws us to revise a current state on a more global level with domainspeci c knowledge, while preserving features like reusability and maintenance.  ...  Only very general rules apply, w h i c h are comparable to the problems of object-oriented design (see GHJV95] for a discussion and general guidelines).  ... 
doi:10.1090/dimacs/057/02 dblp:conf/dimacs/Nareyek98 fatcat:35tybb7zzfhmnowtkq5zxl7pye

A Tutorial on Optimization for Multi-Agent Systems

J. Cerquides, A. Farinelli, P. Meseguer, S. D. Ramchurn
2013 Computer journal  
However, contrary following: to IDP, DyCE avoids enumerating a large number of infeasible coalition structures as it uses the structure of 1.  ...  Hence, in the next section, we turn common coalition structure generation cases that to approaches to solve the optimal coalition structure involve a characteristic coalition value  ... 
doi:10.1093/comjnl/bxt146 fatcat:tvebsldktvb2poo7zbly7doone

Decentralized allocation of tasks with temporal and precedence constraints to a team of robots

Ernesto Nunes, Mitchell McIntire, Maria Gini
2016 2016 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR)  
General methods are used to solve any type of MILP, while structural methods use the structure of a problem to generate valid cuts that allow faster convergence to integer solutions.  ...  Coalition formation, in general, requires dealing with two subproblems: coalition value computation and coalition structure generation [166] .  ... 
doi:10.1109/simpar.2016.7862396 dblp:conf/simpar/NunesMG16 fatcat:uxfvmpmmxbbwzn7zm232eob7mu

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
to the well known serious steps und null steps of bundle methods a third type of steps is used to generate the model of dom .  ...  If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  complexityfeasible subsystem In recent y ears several methods have been proposed to help analyzing and repairing infeasible Linear Programs.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
is an indispensable need in today's business world.To satisfy the customer,on-time delivery is crucial for the business to continue in spite of continuous change.This study aims to propose a model to  ...  We develop an interactive approach that helps in finding the best solution of a decision maker who has a quasiconcave utility function.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Pattern Oriented Software Development: Moving Seamlessly from Requirements to Architecture

M. S. Rajasree, P. Jithendra Kumar Reddy, D. Janakiram
2003 International Conference on Software Engineering  
In particular, we want to thank Ricardo Jimenez Serrano (Siemens) for providing a case study to validate our approach.  ...  This work was partly funded by The Swedish Agency for Innovation Systems (VINNOVA), under a grant for the Center for Applied Software Research at Lund University (LUCAS).  ...  Two main software development methods, structured method and object-oriented method, both provide solutions for mapping analysis model to design model.  ... 
dblp:conf/icse/RajasreeRJ03 fatcat:enkenbj75vhkxiggwnfgb5b72q

Policy-based self-management of wireless ad hoc networks

Antonis M. Hadjiantonis, George Pavlou
2009 2009 IFIP/IEEE International Symposium on Integrated Network Management  
Also, if m aterial had to be rem oved, a n o te will ind ica te the deletion.  ...  In the unlikely e v e n t that the a u thor did not send a c o m p le te m anuscript and there are missing pages, these will be noted.  ...  Wliile the aforementioned optimal replica placement problem has not been fonnally proven as a computationally infeasible task, the majority of the algorithms adopted for its solution ai e considered not  ... 
doi:10.1109/inm.2009.5188885 dblp:conf/im/HadjiantonisP09 fatcat:sdd6vgxcdnef5nztnfbnx245ni

Visible Light-Assisted Soft-Chemistry Route to Silver Nanomaterials at Room Temperature

Yi Wu, Xin Liu, Zi Huang, Xiang Fei He, Xi Yang, Qing Li
2019 Key Engineering Materials  
Silver nanoparticles (AgNPs) were synthesizd by a light-assisted liquid phase reduction method with sodium hypophosphite as a reducing agent. DTAB was used to perform as the surfactant.  ...  We develop a repair operator for solutions that violate the constraints.  ...  A three-phase problemsolving methodology was proposed to deal with such problem. In the first phase, a heuristic is used to derive infeasible initial solutions on the basis of templates.  ... 
doi:10.4028/www.scientific.net/kem.807.165 fatcat:xara5sxzf5fsvbib2dy6vrl7j4

Strategic Alignment of Business Processes [chapter]

Evan D. Morrison, Aditya K. Ghose, Hoa K. Dam, Kerry G. Hinge, Konstantin Hoesch-Klohe
2012 Lecture Notes in Computer Science  
A greatful thank you for all of their support during the completion of this thesis. History: Discussed with client. Bibliography  ...  Acknowledgements Work on this project has been supported by the Australian CRC for Smart Services. http://www.smartservicescrc.com.au/.  ...  Work in the area of business strategy as a coalition system [64] has been conducted by Gans et. al. In the work, a methodology for implementation of a coalition system has been shown.  ... 
doi:10.1007/978-3-642-31875-7_3 fatcat:zl76yniycjftvjafhokyiqjv6e

Interoperability, XML Schema [chapter]

2017 Encyclopedia of GIS  
These fundamental requirements make the design of a generic spatial index framework a challenging task.  ...  The heuristics of the R*-tree ) split algorithm are an example for a topological split to be used in this step.  ...  of different orientation angles are 1; 6; 12; and 18, respectively; for s D 2; 4; and 6, those numbers correspond to differing orientation ISO Geography Markup Language (GML) Spatiotemporal Query Languages  ... 
doi:10.1007/978-3-319-17885-1_100625 fatcat:bgxdhdxa4bewzcggrogz56rdpi

Statistical shape modeling in virtual assembly using PCA-technique

Björn Lindau, Lars Lindkvist, Alf Andersson, Rikard Söderberg
2013 Journal of manufacturing systems  
A special thanks to Samuel Lorin PPU at Chalmers and Carl Angervall at VCC for constructive discussions on the subject.  ...  Some researchers have combined both tools, Axiomatic Design and Design Structure Matrix, in a single integrated procedure [5].  ...  Overlapping and non overlapping characters: non overlapping is preferred over overlapping character, cut-off criteria are needed to exclude overlapping data.  ... 
doi:10.1016/j.jmsy.2013.02.002 fatcat:eaucg4ewmre3lefsbiihax6tza

Analytic Hierarchy Process aided Key Management Schemes Evaluation in Wireless Sensor Network

Na Ruan, Yizhi Ren, Yoshiaki Hori, Kouichi Sakurai
2012 Journal of Networks  
General indications for the whole research community about user's expectations and requirements for session migration are presented.  ...  BDFT is intended for high-speed routers where CPU time is crucial. BDFT is time and space efficient thanks to the use of counting Bloom filters as the data structure that represents the bins.  ...  Also, the experimental results were generated from traces made available to us by CAIDA and NLANR.  ... 
doi:10.4304/jnw.7.1.88-100 fatcat:7atjgdr7hngvfjvvfibte6d3pm
« Previous Showing results 1 — 15 out of 109 results