Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents the latest solutions in fuel cell (FC) and renewable energy implementation in mobile and stationary applications. The implementation of advanced energy management and optimization strategies are detailed for fuel cell and renewable microgrids, and for the multi-FC stack architecture of FC/electric vehicles to enhance the reliability of these systems and to reduce the costs related to energy production and maintenance. Cyber-security methods based on blockchain technology to increase the resilience of FC renewable hybrid microgrids are also presented. Therefore, this book is for all readers interested in these challenging directions of research.

mobile charging station --- electric vehicle --- operational mode --- location-allocation problem --- battery --- capacitor --- differential flatness --- double-layer capacitor --- energy management --- interleaved converter --- nonlinear control --- second order equation --- supercapacitor --- multi-stack --- Polymer Electrolyte Membrane Fuel Cell (PEMFC) --- power electronics --- stability analysis --- microgrid --- LQR-PI control --- grid-tied mode --- current imbalance --- power quality --- genetic algorithms --- renewable energy --- consumer planning --- real-time strategy --- consumption monitoring --- energy storage systems --- renewable energy sources --- dynamic programming --- cascaded multilevel inverter --- photovoltaic --- leakage current --- IoT security --- Internet of Vehicles --- IoV --- connected car --- Blockchain Governance Game --- mixed game --- stochastic model --- fluctuation theory --- 51 percent attack --- double feed induction generator --- grid frequency and amplitude support --- smart grid --- wind technology (WT) --- load frequency control --- optimization issue --- moth flame optimizer (MFO) --- Harris hawks optimizer (HHO) --- fuel economy --- load-following --- switching strategy --- real-time optimization --- fuel cell vehicle --- fuel cell system --- automatic generation control --- controllers --- optimization techniques --- multisource power system --- interconnected power system --- hybrid gravitational with fire fly algorithm --- gravitational search algorithm --- firefly algorithm

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

Research & information: general --- Mathematics & science --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

Research & information: general --- Mathematics & science --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler–Catalan’s triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times --- n/a --- Euler-Catalan's triangle