Search results for "11"
showing 10 items of 17291 documents
Model Co-creation from a Modeler’s Perspective: Lessons Learned from the Collaboration Between Ethnographers and Modelers
2018
This paper reports on the authors’ ongoing collaboration on model co-creation, a process that involves not only the reconciliation of methodologies (qualitative vs. quantitative), but also of epistemologies (empirical vs empirical/rationalist) and ontologies (observable referent vs. abstracted referent). The co-creation process has taken place over several months, from early 2017, both in person, teleconferencing and via email. The result was an ethnographic model of the refugee situation in Lesbos, Greece. The qualifier “ethnographic” means that the simulation’s purpose was to capture the problem situation described by ethnographers in a manner that resembles their observations, not to ans…
The Integration of the Supply Chain as a Dynamic Capability for Sustainability: The Case of an Innovative Organic Company
2018
Numerous research projects have demonstrated that a firm’s ability to integrate, build, and reconfigure internal and external competencies to adapt to changes in its environment is a key capability for its competitiveness. However, in the case of developing the capabilities needed to implement innovation, we have found that the ability to integrate knowledge into the supply chain is also crucial since it is an essential requirement for bringing in technological change and product innovation. The purpose of this chapter is to understand the role of supplier integration in the implementation of radical innovation. First, we propose a theoretical model to connect supplier integration as a dyna…
Best proximity point theorems for proximal cyclic contractions
2017
The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Ranking corporate sustainability: a flexible multidimensional approach based on linguistic variables
2017
Corporate sustainability implies a compromise between the present environmental, social, and economic needs of a firm's stakeholders and their future needs. Corporate sustainability is therefore a multidimensional concept. Nowadays, several independent rating agencies rate firms in terms of environmental, social, and governance (ESG) criteria. These ratings are usually used by main sustainability indices such as the Dow Jones Sustainability Index, FTSE4 Good, Stoxx Sustainability Index, or Euronext Vigeo Family to select companies to invest in. Only those firms performing better than the average of their sector are selected. However, although providing linguistic ratings about the performan…
How selection of collaborating partners impact on the green performance of global businesses? An empirical study of green sustainability
2020
In recent days, both collaboration and sustainability have become an integral part of many global supply chains to achieve business excellence. Although previous literature and actual practices confirmed the successful implementation of sustainability practices through supply chain collaborations, it is not clear how collaborating partners can support financial and environmental performance, and hence strengthen the partnership performance in the global supply chains. To address this practice-based research question, we test the theoretical underpinning of suppliers and logistics partners in relation to required skills selection. We capture the depth of interdependencies in collaborations f…
Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
2011
We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Improving the performance of embedded systems with variable neighborhood search
2017
Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood se…