Search results
1 – 9 of 9Petar Jackovich, Bruce Cox and Raymond R. Hill
This paper aims to define the class of fragment constructive heuristics used to compute feasible solutions for the traveling salesman problem (TSP) into edge-greedy and vertex…
Abstract
Purpose
This paper aims to define the class of fragment constructive heuristics used to compute feasible solutions for the traveling salesman problem (TSP) into edge-greedy and vertex-greedy subclasses. As these subclasses of heuristics can create subtours, two known methodologies for subtour elimination on symmetric instances are reviewed and are expanded to cover asymmetric problem instances. This paper introduces a third novel subtour elimination methodology, the greedy tracker (GT), and compares it to both known methodologies.
Design/methodology/approach
Computational results for all three subtour elimination methodologies are generated across 17 symmetric instances ranging in size from 29 vertices to 5,934 vertices, as well as 9 asymmetric instances ranging in size from 17 to 443 vertices.
Findings
The results demonstrate the GT is the fastest method for preventing subtours for instances below 400 vertices. Additionally, a distinction between fragment constructive heuristics and the subtour elimination methodology used to ensure the feasibility of resulting solutions enables the introduction of a new vertex-greedy fragment heuristic called ordered greedy.
Originality/value
This research has two main contributions: first, it introduces a novel subtour elimination methodology. Second, the research introduces the concept of ordered lists which remaps the TSP into a new space with promising initial computational results.
Details
Keywords
Qingqing Wu, Xianguan Zhao, Lihua Zhou, Yao Wang and Yudi Yang
With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides…
Abstract
Purpose
With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides convenience for life, it also brings many problems such as security risks and public opinion orientation. Various negative, malicious and false information spread across regions, which seriously affect social harmony and national security. Therefore, this paper aims to minimize negative information such as online rumors that has attracted extensive attention. The most existing algorithms for blocking rumors have prevented the spread of rumors to some extent, but these algorithms are designed based on entire social networks, mainly focusing on the microstructure of the network, i.e. the pairwise relationship or similarity between nodes. The blocking effect of these algorithms may be unsatisfactory in some networks because of the sparse data in the microstructure.
Design/methodology/approach
An algorithm for minimizing the influence of dynamic rumor based on community structure is proposed in this paper. The algorithm first divides the network into communities, and integrates the influence of each node within communities and rumor influence probability to measure the influence of each node in the entire network, and then selects key nodes and bridge nodes in communities as blocked nodes. After that, a dynamic blocking strategy is adopted to improve the blocking effect of rumors.
Findings
Community structure is one of the most prominent features of networks. It reveals the organizational structure and functional components of a network from a mesoscopic level. The utilization of community structure can provide effective and rich information to solve the problem of data sparsity in the microstructure, thus effectively improve the blocking effect. Extensive experiments on two real-world data sets have validated that the proposed algorithm has superior performance than the baseline algorithms.
Originality/value
As an important research direction of social network analysis, rumor minimization has a profound effect on the harmony and stability of society and the development of social media. However, because the rumor spread has the characteristics of multiple propagation paths, fast propagation speed, wide propagation area and time-varying, it is a huge challenge to improve the effectiveness of the rumor blocking algorithm.
Details
Keywords
Joshua R. Muckensturm and Dave C. Longhorn
This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing…
Abstract
Purpose
This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing over roads and railways subject to enemy interdiction.
Design/methodology/approach
Graph theory, a heuristic and a binary integer program are used in this paper.
Findings
This work allows transportation analysts at the United States Transportation Command to identify a relatively small number of roads or railways that, if interdicted by an enemy, could disrupt the flow of military cargo within any theater of operation.
Research limitations/implications
This research does not capture aspects of time, such as the reality that cargo requirements and enemy threats may fluctuate each day of the contingency.
Practical implications
This work provides military logistics planners and decision-makers with a vulnerability assessment of theater distribution routes, including insights into which specific roads and railways may require protection to ensure the successful delivery of cargo from ports of debarkation to final destinations.
Originality/value
This work merges network connectivity and flow characteristics with enemy threat assessments to identify militarily-useful roads and railways most vulnerable to enemy interdictions. A geographic combatant command recently used this specific research approach to support their request for rapid rail repair capability.
Details
Keywords
Dave C. Longhorn and John Dale Stobbs
This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment…
Abstract
Purpose
This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment between origin and destination node pairs in some geographic region, which is an important logistics problem at the US Transportation Command.
Design/methodology/approach
The author uses a mathematical program and a traditional heuristic to provide optimal and near-optimal solutions, respectively. The author also compares the approaches for random, small-scale problems to assess the quality and computational efficiency of the heuristic solution, and also uses the heuristic to solve a notional, large-scale problem typical of real problems.
Findings
This work helps analysts identify how many ground transport vehicles are needed to meet cargo delivery requirements in any military theater of operation.
Research limitations/implications
This research assumes all problem data is deterministic, so it does not capture variations in requirements or transit times between nodes.
Practical implications
This work provides prescriptive details to military analysts and decision-makers in a timely manner. Prior to this work, insights for this type of problem were generated using time-consuming simulation taking about a week and often involving trial-and-error.
Originality/value
This research provides new methods to solve an important logistics problem. The heuristic presented in this paper was recently used to provide operational insights about ground vehicle requirements to support a geographic combatant command and to inform decisions for railcar recapitalization within the US Army.
Details
Keywords
Mohammed S. Al-kahtani, Lutful Karim and Nargis Khan
Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an…
Abstract
Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an effective incidence response and disaster recovery framework. Existing sensor routing protocols are mostly not effective in such disaster recovery applications as the networks are affected (destroyed or overused) in disasters such as earthquake, flood, Tsunami and wildfire. These protocols require a large number of message transmissions to reestablish the clusters and communications that is not energy efficient and result in packet loss. This paper introduces ODCR - an energy efficient and reliable opportunistic density clustered-based routing protocol for such emergency sensor applications. We perform simulation to measure the performance of ODCR protocol in terms of network energy consumptions, throughput and packet loss ratio. Simulation results demonstrate that the ODCR protocol is much better than the existing TEEN, LEACH and LORA protocols in term of these performance metrics.
Details
Keywords
Tomás Lopes and Sérgio Guerreiro
Testing business processes is crucial to assess the compliance of business process models with requirements. Automating this task optimizes testing efforts and reduces human error…
Abstract
Purpose
Testing business processes is crucial to assess the compliance of business process models with requirements. Automating this task optimizes testing efforts and reduces human error while also providing improvement insights for the business process modeling activity. The primary purposes of this paper are to conduct a literature review of Business Process Model and Notation (BPMN) testing and formal verification and to propose the Business Process Evaluation and Research Framework for Enhancement and Continuous Testing (bPERFECT) framework, which aims to guide business process testing (BPT) research and implementation. Secondary objectives include (1) eliciting the existing types of testing, (2) evaluating their impact on efficiency and (3) assessing the formal verification techniques that complement testing.
Design/methodology/approach
The methodology used is based on Kitchenham's (2004) original procedures for conducting systematic literature reviews.
Findings
Results of this study indicate that three distinct business process model testing types can be found in the literature: black/gray-box, regression and integration. Testing and verification approaches differ in aspects such as awareness of test data, coverage criteria and auxiliary representations used. However, most solutions pose notable hindrances, such as BPMN element limitations, that lead to limited practicality.
Research limitations/implications
The databases selected in the review protocol may have excluded relevant studies on this topic. More databases and gray literature could also be considered for inclusion in this review.
Originality/value
Three main originality aspects are identified in this study as follows: (1) the classification of process model testing types, (2) the future trends foreseen for BPMN model testing and verification and (3) the bPERFECT framework for testing business processes.
Details
Keywords
Muhammad Ali Memon, Mohamed Hedi Karray, Agnès Letouzey and Bernard Archimède
In difficult geographical zones (mountain, intra-cities areas, etc.), many shippers, from small and medium enterprises to individuals, may demand delivery of different food…
Abstract
Purpose
In difficult geographical zones (mountain, intra-cities areas, etc.), many shippers, from small and medium enterprises to individuals, may demand delivery of different food products (fresh, refrigerated, frozen, etc.) in small quantities. On the other side, carrier companies wish to use their vehicles optimally. Taking into account the perishability constraints (short-shelflife, temperature limits, etc.) of the transported food products and environmental constraints (pollution, carbon impact) while consolidating multiple kinds of food products to use vehicles optimally is not achieved by current transportation planning solutions. The purpose of this paper is to present an interoperable solution of a marketplace, formed by shippers and carriers, dedicated to the schedule of food transport orders.
Design/methodology/approach
This transportation planning system named Interoperable-Pathfinder, Order, Vehicle, Environment and Supervisor (I-POVES) is an interoperable multi-agent system, based on the SCEP (supervisor, customer, environment and producer) model (Archimede and Coudert, 2001). Ontologies are developed to create the planning marketplace comprising demands and offers from different sources (multiple shippers and carriers).
Findings
A hierarchy ontology for food products. A transporter system ontology. A global ontology that contains all shared concepts used by local ontologies of both shippers and carriers. I-POVES an interoperable model, which facilitates collaboration between carriers and their shippers through its active agents.
Practical implications
I-POVES is tested on a case study from the TECCAS Poctefa project, comprising transport and food companies from both sides of the Pyrenees (France and Spain).
Originality/value
There has been much work in the literature on the delivery of products, but very few on the delivery of food products. Work related to delivery of food products focuses mostly on timely delivery for avoiding its wastage. In this paper, constraints related to food products and to environment (pollution and carbon impact) of transport resources are taken into account while planning the delivery.
Details
Keywords
In this paper, the authors introduced a real world new problem, the multi-trip vehicle routing problem with time windows and the possible use of a less-than-truckload carrier to…
Abstract
Purpose
In this paper, the authors introduced a real world new problem, the multi-trip vehicle routing problem with time windows and the possible use of a less-than-truckload carrier to satisfy customer demands. The purpose of this paper is to develop a heuristic algorithm to route the private trucks with time windows and to make a selection between truckload and less-than-truckload carriers by minimizing a total cost function.
Design/methodology/approach
Both mathematical model and heuristic algorithm are developed for routing the private trucks with time windows and for selecting of less-than-truckload carriers by minimizing the total cost function.
Findings
In all, 40 test problems were examined with the heuristics. Computational results show that the algorithm obtains the optimal or near-optimal solutions efficiently in terms of time and accuracy.
Originality/value
The research described in this paper differs from the previous one on fleet planning or vehicle routing, in that it modifies the Clarke and Wright method by shifting the performance measure from a distance to cost and also incorporates the fixed cost of different types of trucks into the model. In addition, the authors simultaneously consider the multiple trip vehicle routing problems with time windows and the selection of less-than-truckload carriers that is an integrated scenario of real-world application. To the best of the authors’ knowledge, this scenario has not been considered in the literature.
Details
Keywords
Euodia Vermeulen and Sara Grobbelaar
In this article we aim to understand how the network formed by fitness tracking devices and associated apps as a subset of the broader health-related Internet of things is capable…
Abstract
Purpose
In this article we aim to understand how the network formed by fitness tracking devices and associated apps as a subset of the broader health-related Internet of things is capable of spreading information.
Design/methodology/approach
The authors used a combination of a content analysis, network analysis, community detection and simulation. A sample of 922 health-related apps (including manufacturers' apps and developers) were collected through snowball sampling after an initial content analysis from a Google search for fitness tracking devices.
Findings
The network of fitness apps is disassortative with high-degree nodes connecting to low-degree nodes, follow a power-law degree distribution and present with low community structure. Information spreads faster through the network than an artificial small-world network and fastest when nodes with high degree centrality are the seeds.
Practical implications
This capability to spread information holds implications for both intended and unintended data sharing.
Originality/value
The analysis confirms and supports evidence of widespread mobility of data between fitness and health apps that were initially reported in earlier work and in addition provides evidence for the dynamic diffusion capability of the network based on its structure. The structure of the network enables the duality of the purpose of data sharing.
Details