Improved Ga-doped Li7La3Zr2O12 garnet-type solid electrolytes for solid-state Li-ion batteries

Journal of Solid State Electrochemistry - Li7La3Zr2O12 (LLZO) is one of the most competent candidates as a solid electrolyte for next-generation Li-ion batteries. Although the stabilization of the...     

The helical melamine–Keggin hybrid nanorods: syntheses and characterizations with two strategies,one-step solid-state chemical reaction and experimental solvent diffusion method

Two new Melamine-Keggin hybrid nanorods, MELH-PMo₁₂ and MELH-PW₁₂, for the first time are successfully synthesized by two chemical methods, one-step solid-state chemical reaction method and experimental solvent diffusion method at room temperature. One-step solid-state reactions involve grounded nanorod materials along with grinding of row material and with solvent diffusion method these nanorods synthesized in single crystals form. These compounds crystallized in trigonal space groups P-3. Elemental analysis, infrared spectroscopy, UV spectroscopy and XRD analysis results prove that the samples still possess Keggin type structure. Transmittance electron microscopy and single-crystal X-ray have shown that the samples have nanorod structures.     

Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network

This paper addresses a generalization of the capacitated location-routing problem (CLRP) arising in the design of a collection network for a company engaged in collecting used products from customer zones. The company offers customers a financial incentive per unit of used products. This incentive determines the quantity of used products which are returned by customers. Moreover, it is not necessary for the company to visit all customer zones or to collect all returns in each visited customer zone. The objective is to simultaneously find the location of collection centers, the routes of vehicles, the value of incentive offered and the amount of used products collected from customer zones, so as to maximize the company's overall profit. We develop two mixed integer linear programming formulations of the problem and a heuristic algorithm based on iterated local search. Extensive computational experiments on this problem demonstrate the effectiveness of the proposed algorithm.