in this paper, new (2e, 2'e)-3, 3'-(((3- hydroxypropane-1, 2-diyl) bis (oxy)) bis (2, 1-phenylene)) bis (1-phenylprop-2-en-1-one) (2a) was prepared in good yield by condensation reaction of acetophenone with bisaldehyde (1a) in ethanolic naoh solutions at room temperature. the (2e, 2'e)-3, 3'-(((3- hydroxypropane-1, 2-diyl) bis (oxy)) bis (2, 1-phenylene)) bis (1-phenylprop-...

A series of four random copolyesters were synthesized by the polycondensation of a chalcone diol by making use of two diacid chlorides namely terephthaloyl chloride and succinyl chloride. The four chalcone diols involved are (2E)-1,3-bis(4-hydroxyphenyl)prop-2-en-1-one, (2E)-1-(4-hydroxyphenyl)-3-(4-hydroxy-3-methoxyphenyl)-prop-2-en1-one, (2E)-1-(4-hydroxy-3-methoxyphenyl)-3-(4-hydroxyphenyl)-...

A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on plane grid points and all edges are drawn as straight line segments between their endpoints without any edge-intersection. In this paper we give a very simple algorithm to find a grid drawing of any given 4-connected plane graph G with four or more vertices on the outer face. The algorithm take...

Korean mondshood root polysaccharides (KMPS) isolated from the root of Aconitum coreanum (Lévl.) Rapaics have shown anti-inflammatory activity, which is strongly influenced by their chemical structures and chain conformations. However, the mechanisms of the anti-inflammatory effect by these polysaccharides have yet to be elucidated. A RG-II polysaccharide (KMPS-2E, Mw 84.8 kDa) was isolated fro...

Contemporary vehicle routing requires ubiquitous computing and massive data in order to deal with the three aspects of transportation such as operations, planning and safety. Out of the three aspects, safety is the most vital and this study refers safety as the reduction of CO2 emissions and hazardous risks. Hence, this paper presents a data driven multi-objective differential evolution (MODE) ...

Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time...

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

This paper presents a new exact algorithm for the Capacitated Vehicle Routing Problem (CVRP) based on the set partitioning formulation with additional cuts that correspond to capacity and clique inequalities. The exact algorithm uses a bounding procedure that finds a near optimal dual solution of the LP-relaxation of the resulting mathematical formulation by combining three dual ascent heuristi...

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the...