Abstract Finding the shortest travelling distance based on various situations might assist travelers in making a better selection of route decisions. The main goal this paper is to solve routing problem for company’s fleet vehicle (XpressBees) order find best under constraints such as Signalized Intersections, Vehicle Capacity, Customer Demands, and Time Windows reduce transportation costs by u...

In recent years, numerous approaches have been utilized for finding the exact solutions to nonlinear partial differential equations. One such method is known as the new extended (G'/G)-expansion method and was proposed by Roshid et al. In this paper, we apply this method and achieve exact solutions to nonlinear partial differential equations (NLPDEs), namely the Benjamin-Ono equation. It is est...

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree > 4) is NP-complete, thus solving a long-standing open problem. On the positive side, we give an efficient algorithm for several restricted variants, such as graphs of bounded branch width a...

A 1.5D terrain is an x-monotone polyline with n vertices. An imprecise 1.5D terrain is a 1.5D terrain with a y-interval at each vertex, rather than a fixed y-coordinate. A realization of an imprecise terrain is a sequence of n y-coordinates—one for each interval— such that each y-coordinate is within its corresponding interval. For certain applications in terrain analysis, it is important to be...

L.A. Shepp has posed aild analyzed the problem of optimal random drawinp with Jut replacement from an urn containing predetermined numbers of plus and minus balls. ;Here Shepp’s results are extended by improving the bounds on value; of penturbeu urns, deriving an exact algorithm for the urn values and computing the stopping boundary for urns of u-, tn 200 balls.

A k-uniform, d-regular instance of Exact Cover is a family of m sets Fn,d,k = {Sj ⊆ {1, . . . , n}}, where each subset has size k and each 1 ≤ i ≤ n is contained in d of the Sj . It is satisfiable if there is a subset T ⊆ {1, . . . , n} such that |T ∩ Sj | = 1 for all j. Alternately, we can consider it a d-regular instance of Positive 1-in-k SAT, i.e., a Boolean formula with m clauses and n var...

The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation ...

Finding common motifs from a set of strings coding biological sequences is an important problem in Molecular Biology. Several versions of the motif finding problem have been proposed in the literature and for each version, numerous algorithms have been developed. However, many of these algorithms fall under the category of heuristics. In this paper, we concentrate on the Simple Motif Problem (S...