This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port contain...
详细信息
ISBN:
(纸本)9781728143903
This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port containership stowage problem under the circular route, taking into consideration the sequence of port of call and container information of each port. A greedy algorithm is designed to solve the problem. The efficiency of the algorithm is verified by analyzing the results of the instances and therefore some rules can be obtained to provide reference for subsequent research.
The discounted knapsack problem (DKP) is an NP-hard combinatorial optimization problem that has gained much attention recently. Due to its high complexity, the usual solution combines a global search algorithm with a ...
详细信息
ISBN:
(纸本)9783031226946;9783031226953
The discounted knapsack problem (DKP) is an NP-hard combinatorial optimization problem that has gained much attention recently. Due to its high complexity, the usual solution combines a global search algorithm with a greedy local search algorithm to repair candidate solutions. The current greedy algorithms use a heuristic that ignores the items already in a candidate solution. This paper presents a new greedy algorithm for DKP that uses an expanded set of operators and better heuristics that are more effective at considering the selected items. Experimental results show that the proposed greedy algorithm has superior performance to three well-known greedy algorithms for DKP, both when operating independently and when combined with global search algorithms.
This research aims to discover the way to adjust the web page hyperlink automatically. First we utilize a WUM (Web Usage Mining) analysis tool to analyze the log file of the website, apply the greedy algorithm to the ...
详细信息
ISBN:
(纸本)9812565329
This research aims to discover the way to adjust the web page hyperlink automatically. First we utilize a WUM (Web Usage Mining) analysis tool to analyze the log file of the website, apply the greedy algorithm to the fetched data (or pattern) to extract the most optimum part of the web page hyperlink, and store the analysis result into the database. Finally we convert the hyperlink on the web page to 'dynamic hyperlink' during the design phase, which is load from the mining result of the database. This way, we can automatically adjust the web page hyperlink.
We describe an exhaustive and greedy algorithm for improving the accuracy of multiple sequence alignment. A simple progressive alignment approach is employed to provide initial alignments. The initial alignment is the...
详细信息
We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard-to-process graphs for the greedy algorithm MIN.
ISBN:
(纸本)9781665406505
We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard-to-process graphs for the greedy algorithm MIN.
Buses run on fix routes, which makes it possible to design a predictive Energy Management Strategy (EMS) for hybrid electric bus to achieve better overall efficiency. A new predictive EMS is proposed based on the pred...
详细信息
ISBN:
(纸本)9781467313988
Buses run on fix routes, which makes it possible to design a predictive Energy Management Strategy (EMS) for hybrid electric bus to achieve better overall efficiency. A new predictive EMS is proposed based on the prediction of the bus's velocity profile. Firstly, the bus's velocity profile is predicted via historic driving data and real-time driving data, which provide the future power demand. Then according to the prediction of the velocity profile, the torque spilt is optimized by greedy algorithm. The obtained EMS requires very little computational time and is suitable for real-time implement. Simulation shows that the fuel economy of the presented approach is better than the electric assist control strategy in the Advanced Vehicle Simulator (ADVISOR).
In cognitive radio networks, media access control protocol decides the method how the nodes in the networks receive and send data by shared wireless channels. Whether the MAC protocol can use the limited channel effec...
详细信息
ISBN:
(纸本)9781612846835;9781612846828
In cognitive radio networks, media access control protocol decides the method how the nodes in the networks receive and send data by shared wireless channels. Whether the MAC protocol can use the limited channel effectively plays a very important role in the performance of the cognitive radio network. Focusing on designing and implementation an excellent MAC protocol in cognitive radio networks, this paper describes an improved dynamic spectrum access protocol based on the greedy algorithm. The simulation results shows it's good performance.
Software maintainability is the ease with which a software system can be modified to correct faults, improve performance or other attributes of the source code. Bad smells are symptoms of deeper problem that indicates...
详细信息
ISBN:
(纸本)9781509020287
Software maintainability is the ease with which a software system can be modified to correct faults, improve performance or other attributes of the source code. Bad smells are symptoms of deeper problem that indicates the need for refactoring which is the process of changing internal structure of the software without affecting its external attributes. Applying different refactoring techniques in different parts of a code results in changed maintainability value every time. Therefore, sequence in which refactoring should be applied is important so that optimal results can be obtained. In this study, we have proposed an approach for evaluating sequence of refactoring by with the help of greedy algorithm. The algorithm selects locally optimal solution at each stage with the hope of finding global optimal solution. Different sequences are generated and applied to the source code to calculate sum of software maintainability values. greedy algorithm helps in finding the optimal sequence out of all the search space. We have evaluated the approach with source code having god class, long method, feature envy, long parameter list, data clumps, data class, class hierarchy problem, empty catch block, exception thrown in finally block and nested try statement bad smells which are detected manually. Hence our approach is able to identify sequence for refactoring as well as best refactoring which will increase maintainability and enhance software quality.
Applications of the Incremental algorithm, which was developed in the theory of greedy algorithms in Banach spaces, to approximation and numerical integration are discussed. In particular, it is shown that the Increme...
详细信息
ISBN:
(纸本)9783319335070;9783319335056
Applications of the Incremental algorithm, which was developed in the theory of greedy algorithms in Banach spaces, to approximation and numerical integration are discussed. In particular, it is shown that the Incremental algorithm provides an efficient way for deterministic construction of cubature formulas with equal weights, which give good rate of error decay for a wide variety of function classes.
We establish a necessary and sufficient condition for a greedy algorithm to find an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for...
详细信息
We establish a necessary and sufficient condition for a greedy algorithm to find an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalization of matroids and integer polymatroids preserving the optimality of greedy solutions. (C) 2003 Published by Elsevier B.V.
暂无评论