a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...

Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has been made for vertex-cut partitioning. Thi...

The Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact Mixed-Integer Programming (MIP) formulation for the SDVRPTW. Standard modeling approach either suffer from inherent symmetries (MIPs with a vehicle index) or cannot exactly capture all aspects of feasibility. Due to the possi...

In graph clustering methods, MinMax Cut tends to provide more balanced clusters as compared to Ratio Cut and Normalized Cut. The traditional approach used spectral relaxation to solve the graph cut problem. The main disadvantage of this approach is that the obtained spectral solution has mixed signs, which could severely deviate from the true solution and have to resort to other clustering meth...

and Applied Analysis 3 If any solution x of 1.1 is either oscillatory, or satisfies the condition 1.7 , or admits the asymptotic representation x i c 1 sin t − α i εi t , i 0, 1, 2, 3 , 1.8 where c / 0 and α are constants, the continuous functions εi i 0, 1, 2, 3 vanish at infinity and ε0 satisfies the inequality cε0 t > 0 for large t, then we say that 1.1 has weak property A. For n 3, the resu...

Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming. In this work, we develop a branch and cut algorithm based on continuous fractional optimization, for generating the whole integer efficient solutions of the MOILFP problem. The basic idea of...

The vase life of cut flowers and foliage is often shortened by vascular occlusions that constrict vase solution supply. Reduction in stem conductivity is typically caused by blockage of cut stem ends and xylem conduits by microbes, physiological plugging, and disruption of water columns in xylem vessels by cavitations and air emboli. Cut flower and foliage longevity can be greatly affected by t...

Abstract:Minimumdisconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem. In this paper we generalise the standard balanced bisection problem for static graphs to a new “dynamic balanced bisection problem”, in wh...